A MILP formulation for generalized geometric programming using piecewise-linear approximations

DOI10.1016/J.EJOR.2015.01.038MaRDI QIDQ319582zbMATH OpenOpenAlexWikidataFDO

Authors Chung-Li Tseng, Yiduo Zhan, Qipeng P. Zheng, Manish Kumar

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

zbMATH Keywords

global optimizationgeneralized geometric programmingmixed-integer linear programmingpiecewise-linear approximation

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Mixed integer programming (90C11)

Recommendations

• Engineering design by geometric programming
• Linearization method of global optimization for generalized geometric programming
• A tutorial on geometric programming
• A global optimization using linear relaxation for generalized geometric programming
• A new linearization method for posynomial constrained generalized geometric programming

Cites work

• A deterministic global optimization algorithm for generalized geometric programming
• A global optimization using linear relaxation for generalized geometric programming
• A modified convace simplex algorithm for geometric programming
• A polyhedral branch-and-cut approach to global optimization
• A robust algorithm for generalized geometric programming
• A set of geometric programming test problems and their solutions
• An efficient convexification method for solving generalized geometric problems
• Branch-reduction-bound algorithm for generalized geometric programming
• Comparison of generalized geometric programming algorithms
• Convex underestimation strategies for signomial functions
• Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
• Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions
• Global optimization for generalized geometric programs with mixed free-sign variables
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
• Global optimization of signomial geometric programming problems
• Linearization method of global optimization for generalized geometric programming
• MM algorithms for geometric and signomial programming
• Objective function approximations in mathematical programming
• On generalized geometric programming problems with non-positive variables
• Optimal objective function approximation for separable convex quadratic programming
• Prediction of oligopeptide conformations via deterministic global optimization
• Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
• Solving highly nonlinear convex separable programs using successive approximation
• Successive approximation in separable programming: An improved procedure for convex separable programs
• Treating free variables in generalized geometric global optimization programs

Cited in

(5)

• MILP-Formulations for the Total Adjustment Cost Problem
• Engineering design by geometric programming
• A practicable contraction approach for the sum of the generalized polynomial ratios problem
• Piecewise linear approximation of functions of two variables in MILP models
• An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming

Describes a project that uses

Uses Software

• APOGEE

This page was built for publication: A MILP formulation for generalized geometric programming using piecewise-linear approximations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319582)