On generalized geometric programming problems with non-positive variables

DOI10.1016/j.ejor.2005.11.037zbMath1109.90050OpenAlexW2049533604MaRDI QIDQ857357

Yi-Chung Hu, Ming-Hua Lin, Jung-Fa Tsai

Publication date: 14 December 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.11.037

zbMATH Keywords

global optimizationconvexificationgeneralized geometric programmingnon-positive variables

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Management decision making, including multiple objectives (90B50)

Related Items (11)

Global optimization of signomial geometric programming problems ⋮ A review of recent advances in global optimization ⋮ A MILP formulation for generalized geometric programming using piecewise-linear approximations ⋮ Using geometric arithmetic mean to solve non-linear fractional programming problems ⋮ Multi-parametric disaggregation technique for global optimization of polynomial programming problems ⋮ Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems ⋮ 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 ⋮ Convexity of products of univariate functions and convexification transformations for geometric programming

Uses Software

• LINDO
• LINGO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• Investigation of path-following algorithms for signomial geometric programming problems
• 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
• Global optimization of nonconvex polynomial programming problems having rational exponents
• Global optimization of signomial geometric programming using linear relaxation.
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• Deterministic global optimization. Theory, methods and applications
• Complementary Geometric Programming
• Generalized Polynomial Optimization
• Generalized Weighted Mean Programming

This page was built for publication: On generalized geometric programming problems with non-positive variables