Global optimization of signomial mixed-integer nonlinear programming problems with free variables

DOI10.1007/s10898-007-9211-8zbMath1173.90483OpenAlexW1981199891MaRDI QIDQ1024826

Jung-Fa Tsai, Ming-Hua Lin

Publication date: 17 June 2009

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-007-9211-8

zbMATH Keywords

global optimizationconvexificationmixed-integer nonlinear programmingfree variable

Mathematics Subject Classification ID

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

Related Items (13)

Global Optimization of Mixed-Integer Signomial Programming Problems ⋮ Global optimization of signomial geometric programming problems ⋮ Finding all global optima of engineering design problems with discrete signomial terms ⋮ Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms ⋮ An efficient method for solving multi-objective signomial programming problems in real life ⋮ A reformulation framework for global optimization ⋮ 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 ⋮ Optimal incentive pricing on relaying services for maximizing connection availability in multihop cellular networks ⋮ A review of deterministic optimization methods in engineering and management ⋮ Finding multiple optimal solutions of signomial discrete programming problems with free variables ⋮ An efficient deterministic optimization approach for rectangular packing problems ⋮ Univariate parameterization for global optimization of mixed-integer polynomial problems

Uses Software

• LINDO
• LINGO
• Tabu search

Cites Work

• Unnamed Item
• Convexification and concavification for a general class of global optimization problems
• Treating free variables in generalized geometric global optimization programs
• An improved branch and bound algorithm for mixed integer nonlinear programs
• Solving mixed integer nonlinear programs by outer approximation
• A hybrid genetic algorithm for nonconvex function minimization.
• A hybrid descent method for global optimization
• Review of nonlinear mixed-integer and disjunctive programming techniques
• Finding all solutions of nonlinearly constrained systems of equations
• State of the art in global optimization: computational methods and applications. Papers of the conference, Princeton, NJ, USA, April 28--30, 1995
• A branch-and-cut method for 0-1 mixed convex programming
• Generalized Benders decomposition
• Mixed integer models for the stationary case of gas network optimization
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems
• Global optimization using special ordered sets
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming
• A convexification method for a class of global optimization problems with applications to reliability optimization

This page was built for publication: Global optimization of signomial mixed-integer nonlinear programming problems with free variables