An LP/NLP based branch and bound algorithm for convex MINLP optimization problems
- 1 October 1992
- journal article
- Published by Elsevier in Computers & Chemical Engineering
- Vol. 16 (10-11) , 937-947
- https://doi.org/10.1016/0098-1354(92)80028-8
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- On the Generalized Benders DecompositionComputers & Chemical Engineering, 1991
- A global optimization algorithm (GOP) for certain classes of nonconvex NLPs—I. TheoryComputers & Chemical Engineering, 1990
- Mixed-integer nonlinear programming techniques for the synthesis of engineering systemsResearch in Engineering Design, 1990
- Global optimum search for nonconvex NLP and MINLP problemsComputers & Chemical Engineering, 1989
- A mixed-integer nonlinear programming formulation for the synthesis of heat-integrated distillation sequencesComputers & Chemical Engineering, 1988
- An outer-approximation algorithm for a class of mixed-integer nonlinear programsMathematical Programming, 1986
- A mixed‐integer nonlinear programming algorithm for process systems synthesisAIChE Journal, 1986
- Branch and Bound Experiments in Convex Nonlinear Integer ProgrammingManagement Science, 1985
- Global optimization using special ordered setsMathematical Programming, 1976
- Generalized Benders decompositionJournal of Optimization Theory and Applications, 1972