Pages that link to "Item:Q3100377"

The following pages link to Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables (Q3100377):

Displaying 24 items.

• Reducing multivalued discrete variables in solving separable task assignment problems (Q290332) (← links)
• Global optimization of signomial geometric programming problems (Q296971) (← links)
• A MILP formulation for generalized geometric programming using piecewise-linear approximations (Q319582) (← links)
• Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems (Q421696) (← links)
• A continuous strategy to solve a class of mixed optimization problems (Q496673) (← links)
• Treating free variables in generalized geometric global optimization programs (Q811884) (← links)
• On generalized geometric programming problems with non-positive variables (Q857357) (← links)
• Global optimization of signomial mixed-integer nonlinear programming problems with free variables (Q1024826) (← links)
• An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming (Q1704917) (← links)
• Geometric programming with discrete variables subject to max-product fuzzy relation constraints (Q1726989) (← links)
• An enhanced logarithmic method for signomial programming with discrete variables (Q1752141) (← links)
• A logarithmic method for eliminating binary variables and constraints for the product of free-sign discrete functions (Q1941533) (← links)
• A review of deterministic optimization methods in engineering and management (Q1955154) (← links)
• Linearization technique with superior expressions for centralized planning problem with discount policy (Q2137652) (← links)
• Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms (Q2164609) (← links)
• Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables (Q2295318) (← links)
• An efficient convexification method for solving generalized geometric problems (Q2358874) (← links)
• Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms (Q2397434) (← links)
• Finding multiple optimal solutions of signomial discrete programming problems with free variables (Q2443364) (← links)
• Incremental and encoding formulations for mixed integer programming (Q2450751) (← links)
• Mixed integer linear programming formulation techniques (Q2808240) (← links)
• Finding all global optima of engineering design problems with discrete signomial terms (Q5059294) (← links)
• Efficient Convexification Strategy for Generalized Geometric Programming Problems (Q5138255) (← links)
• A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)