Pages that link to "Item:Q421696"

The following pages link to Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems (Q421696):

Displaying 16 items.

• Global optimization of signomial geometric programming problems (Q296971) (← links)
• A MILP formulation for generalized geometric programming using piecewise-linear approximations (Q319582) (← links)
• A reformulation framework for global optimization (Q367160) (← links)
• A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming (Q902804) (← links)
• A reduced space branch and bound algorithm for a class of sum of ratios problems (Q1647365) (← links)
• An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming (Q1704917) (← links)
• A novel optimization method for nonconvex quadratically constrained quadratic programs (Q1724769) (← links)
• Integrated data envelopment analysis: linear vs. nonlinear model (Q1754321) (← links)
• A review of deterministic optimization methods in engineering and management (Q1955154) (← links)
• Inner approximation algorithm for generalized linear multiplicative programming problems (Q2061502) (← links)
• Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms (Q2164609) (← links)
• Copula theory approach to stochastic geometric programming (Q2231327) (← links)
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← links)
• A practicable contraction approach for the sum of the generalized polynomial ratios problem (Q2424762) (← links)
• Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
• Solving geometric programming problems with normal, linear and zigzag uncertainty distributions (Q5890837) (← links)