Global solution of optimization problems with signomial parts

DOI10.1016/j.disopt.2007.11.005zbMath1134.90041OpenAlexW1977299961MaRDI QIDQ924639

Ray Pörn, Tapio Westerlund, Kaj-Mikael Björk

Publication date: 16 May 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2007.11.005

zbMATH Keywords

global optimizationconvexificationmixed integer nonlinear programmingvariable transformationssignomials

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30)

Related Items

An efficient convexification method for solving generalized geometric problems ⋮ Global optimization of signomial geometric programming problems ⋮ Finding all global optima of engineering design problems with discrete signomial terms ⋮ Branch-reduction-bound algorithm for generalized geometric programming ⋮ Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms ⋮ Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms ⋮ 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 ⋮ Efficient Convexification Strategy for Generalized Geometric Programming Problems

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized concavity
• Bibliographical note on geometric programming
• Current state of the art of algorithms and computer software for geometric programming
• Different transformations for solving non-convex trim-loss problems by MINLP
• Approximating separable nonlinear functions via mixed zero-one programs
• A global optimization algorithm for linear fractional and bilinear programs
• Finding all solutions of nonlinearly constrained systems of equations
• Jointly Constrained Biconvex Programming
• Branch and Bound Methods for Mathematical Programming Systems
• Generalized Polynomial Optimization

This page was built for publication: Global solution of optimization problems with signomial parts