A sharp cut algorithm for optimization

Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.compchemeng.2010.11.010

Title:	A sharp cut algorithm for optimization
Authors:	Inamdar, S.R. Karimi, I.A. Parulekar, S.J. Kulkarni, B.D.
Keywords:	02.60.Pn Convergence theorem Cutting plane Sharp cut Successive linear programming
Issue Date:	14-Dec-2011
Citation:	Inamdar, S.R., Karimi, I.A., Parulekar, S.J., Kulkarni, B.D. (2011-12-14). A sharp cut algorithm for optimization. Computers and Chemical Engineering 35 (12) : 2716-2728. ScholarBank@NUS Repository. https://doi.org/10.1016/j.compchemeng.2010.11.010
Abstract:	In this paper, we introduce a new cutting plane algorithm which is computationally less expensive and more efficient than Kelley's algorithm. This new cutting plane algorithm uses an intersection cut of three types of cutting planes. We find from numerical results that the global search method formed using successive linear programming and a new intersection set is at least twice as fast as Kelley's cutting planes. The necessary mathematical analysis and convergence theorem are provided. The key findings are illustrated via optimization of a cascade of three CSTRs. © 2010 Elsevier Ltd.
Source Title:	Computers and Chemical Engineering
URI:	http://scholarbank.nus.edu.sg/handle/10635/63408
ISSN:	00981354
DOI:	10.1016/j.compchemeng.2010.11.010
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check