Finding multiple optimal solutions of signomial discrete programming problems with free variables
From MaRDI portal
Publication:2443364
Recommendations
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- An enhanced logarithmic method for signomial programming with discrete variables
- Global optimization for generalized geometric programs with mixed free-sign variables
- 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
Cites work
- A branch-and-cut method for 0-1 mixed convex programming
- A mixed-integer programming model for a class of assortment problems
- A review of recent advances in global optimization
- An improved branch and bound algorithm for mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Canonical Cuts on the Unit Hypercube
- Convex underestimation strategies for signomial functions
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Finding all solutions of nonlinearly constrained systems of equations
- Finding multiple solutions to general integer linear programs
- Generalized Benders decomposition
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Heuristic optimization of experimental designs.
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Investigating a hybrid simulated annealing and local search algorithm for constrained optimization
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Solving mixed integer nonlinear programs by outer approximation
- Some transformation techniques in global optimization
- Some transformation techniques with applications in global optimization
- Tabu search applied to global optimization
Cited in
(4)- An enhanced logarithmic method for signomial programming with discrete variables
- A review of deterministic optimization methods in engineering and management
- Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms
- Finding all global optima of engineering design problems with discrete signomial terms
This page was built for publication: Finding multiple optimal solutions of signomial discrete programming problems with free variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2443364)
