Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
From MaRDI portal
Publication:421696
DOI10.1016/j.ejor.2011.06.046zbMath1242.90177OpenAlexW2137291218MaRDI QIDQ421696
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.06.046
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Global optimization of signomial geometric programming problems, A MILP formulation for generalized geometric programming using piecewise-linear approximations, Solving generalized polynomial problem by using new affine relaxed technique, A reduced space branch and bound algorithm for a class of sum of ratios problems, Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms, A reformulation framework for global optimization, A practicable contraction approach for the sum of the generalized polynomial ratios problem, A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming, An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming, A review of deterministic optimization methods in engineering and management, Solving geometric programming problems with normal, linear and zigzag uncertainty distributions, A novel optimization method for nonconvex quadratically constrained quadratic programs, Copula theory approach to stochastic geometric programming, Integrated data envelopment analysis: linear vs. nonlinear model, Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints, Inner approximation algorithm for generalized linear multiplicative programming problems
Uses Software
Cites Work
- Unnamed Item
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- A review of recent advances in global optimization
- On generalized geometric programming problems with non-positive variables
- Global solution of optimization problems with signomial parts
- Exact \(L_{2}\)-norm plane separation
- Convexity of products of univariate functions and convexification transformations for geometric programming
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Some transformation techniques with applications in global optimization
- A collection of test problems for constrained global optimization algorithms
- Comparison of generalized geometric programming algorithms
- Handbook of test problems in local and global optimization
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- Prediction of oligopeptide conformations via deterministic global optimization
- Linearization method of global optimization for generalized geometric programming
- A global optimization algorithm for linear fractional and bilinear programs
- Finding all solutions of nonlinearly constrained systems of equations
- Deterministic global optimization. Theory, methods and applications
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A deterministic global optimization algorithm for generalized geometric programming
- Convex relaxation for solving posynomial programs
- An Efficient Global Approach for Posynomial Geometric Programming Problems
- A Superior Representation Method for Piecewise Linear Functions
- Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables
- Convex underestimation strategies for signomial functions
- Complementary Geometric Programming
- A set of geometric programming test problems and their solutions
- Generalized Polynomial Optimization
- Generalized Weighted Mean Programming
