A MILP formulation for generalized geometric programming using piecewise-linear approximations
From MaRDI portal
Publication:319582
DOI10.1016/j.ejor.2015.01.038zbMath1346.90633OpenAlexW2074551798WikidataQ57734085 ScholiaQ57734085MaRDI QIDQ319582
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.01.038
global optimizationmixed-integer linear programminggeneralized geometric programmingpiecewise-linear approximation
Related Items (2)
A practicable contraction approach for the sum of the generalized polynomial ratios problem ⋮ An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming
Uses Software
Cites Work
- Global optimization of signomial geometric programming problems
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
- Treating free variables in generalized geometric global optimization programs
- On generalized geometric programming problems with non-positive variables
- A robust algorithm for generalized geometric programming
- Solving highly nonlinear convex separable programs using successive approximation
- Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions
- Comparison of generalized geometric programming algorithms
- Optimal objective function approximation for separable convex quadratic programming
- Prediction of oligopeptide conformations via deterministic global optimization
- Linearization method of global optimization for generalized geometric programming
- A polyhedral branch-and-cut approach to global optimization
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- A modified convace simplex algorithm for geometric programming
- An efficient convexification method for solving generalized geometric problems
- Branch-reduction-bound algorithm for generalized geometric programming
- A global optimization using linear relaxation for generalized geometric programming
- MM algorithms for geometric and signomial programming
- A deterministic global optimization algorithm for generalized geometric programming
- Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables
- Convex underestimation strategies for signomial functions
- Successive approximation in separable programming: An improved procedure for convex separable programs
- A set of geometric programming test problems and their solutions
- Objective function approximations in mathematical programming
- Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
This page was built for publication: A MILP formulation for generalized geometric programming using piecewise-linear approximations
