Pages that link to "Item:Q1763283"

The following pages link to Linearization method of global optimization for generalized geometric programming (Q1763283):

Displaying 31 items.

• Global optimization of signomial geometric programming problems (Q296971) (← links)
• A MILP formulation for generalized geometric programming using piecewise-linear approximations (Q319582) (← links)
• Single-projection procedure for linear optimization (Q330507) (← links)
• Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems (Q421696) (← links)
• The discrete ellipsoid covering problem: a discrete geometric programming approach (Q496677) (← links)
• A new global optimization algorithm for solving generalized geometric programming (Q624692) (← links)
• A review of recent advances in global optimization (Q842710) (← links)
• Computational method for the profit bounds of inventory model with interval demand and unit cost (Q864804) (← links)
• A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming (Q902804) (← links)
• A new bound-and-reduce approach of nonconvex quadratic programming problems (Q902837) (← links)
• Fuzzy profit measures for a fuzzy economic order quantity model (Q949990) (← links)
• Convexity of products of univariate functions and convexification transformations for geometric programming (Q1014014) (← links)
• A parametric linearizing approach for quadratically inequality constrained quadratic programs (Q1644881) (← links)
• A novel optimization method for nonconvex quadratically constrained quadratic programs (Q1724769) (← links)
• An effective algorithm for globally solving quadratic programs using parametric linearization technique (Q1738251) (← links)
• Multi-parametric disaggregation technique for global optimization of polynomial programming problems (Q1941031) (← links)
• Newton polytopes and relative entropy optimization (Q2067684) (← links)
• An effective global optimization algorithm for quadratic programs with quadratic constraints (Q2335092) (← links)
• A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs (Q2389836) (← links)
• Branch-reduction-bound algorithm for generalized geometric programming (Q2392111) (← links)
• Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs (Q2409582) (← links)
• A global optimization using linear relaxation for generalized geometric programming (Q2427180) (← links)
• A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints (Q2479256) (← links)
• Relative entropy relaxations for signomial optimization (Q2805708) (← links)
• A new linearization method for posynomial constrained generalized geometric programming (Q3196009) (← links)
• (Q3473723) (← links)
• Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
• Two-level linear relaxation method for generalized linear fractional programming (Q6047583) (← links)
• A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems (Q6568950) (← links)
• A global interior point method for nonconvex geometric programming (Q6572703) (← links)
• An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications (Q6582024) (← links)