Finding multiple optimal solutions of signomial discrete programming problems with free variables

DOI10.1007/S11081-011-9137-3zbMath1284.90082OpenAlexW2104684477MaRDI QIDQ2443364

Ming-Hua Lin, Jung-Fa Tsai

Publication date: 7 April 2014

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-011-9137-3

zbMATH Keywords

global optimizationmultiple solutionsfree variablessignomial discrete programming

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31)

Related Items (4)

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 ⋮ A review of deterministic optimization methods in engineering and management ⋮ An enhanced logarithmic method for signomial programming with discrete variables

Uses Software

• LINDO
• LINGO

Cites Work

• Unnamed Item
• Unnamed Item
• A review of recent advances in global optimization
• Global optimization of signomial mixed-integer nonlinear programming problems with free variables
• Some transformation techniques with applications in global optimization
• An improved branch and bound algorithm for mixed integer nonlinear programs
• Solving mixed integer nonlinear programs by outer approximation
• Tabu search applied to global optimization
• A mixed-integer programming model for a class of assortment problems
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Review of nonlinear mixed-integer and disjunctive programming techniques
• Heuristic optimization of experimental designs.
• Finding all solutions of nonlinearly constrained systems of equations
• A branch-and-cut method for 0-1 mixed convex programming
• Finding multiple solutions to general integer linear programs
• Investigating a hybrid simulated annealing and local search algorithm for constrained optimization
• Generalized Benders decomposition
• Convex underestimation strategies for signomial functions
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Canonical Cuts on the Unit Hypercube
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming

This page was built for publication: Finding multiple optimal solutions of signomial discrete programming problems with free variables