An extended cutting plane method for a class of non-convex MINLP problems
Authors:
- Tapio WesterlundTWTapio Westerlund
- Hans SkrifvarsHSHans Skrifvars
- Iiro HarjunkoskiIHIiro Harjunkoski
- Ray PörnRPRay Pörn
- 1 February 1998
- journal article
- Published by Elsevier in Computers & Chemical Engineering
- Vol. 22 (3) , 357-365
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- ?BB: A global optimization method for general constrained nonconvex problemsJournal of Global Optimization, 1995
- Global optimization of nonconvex NLPs and MINLPs with applications in process designComputers & Chemical Engineering, 1995
- Optimization of pump configurations as a MINLP problemComputers & Chemical Engineering, 1994
- Solving mixed integer nonlinear programs by outer approximationMathematical Programming, 1994
- An LP/NLP based branch and bound algorithm for convex MINLP optimization problemsComputers & Chemical Engineering, 1992
- An outer-approximation algorithm for a class of mixed-integer nonlinear programsMathematical Programming, 1986
- Branch and Bound Experiments in Convex Nonlinear Integer ProgrammingManagement Science, 1985
- Optimization by Simulated AnnealingScience, 1983
- Generalized Benders decompositionJournal of Optimization Theory and Applications, 1972
- A tree-search algorithm for mixed integer programming problemsThe Computer Journal, 1965