Inamdar, S. R. ; Karimi, L. A. ; Parulekar, S. J. ; Kulkarni, B. D. (2011) A sharp cut algorithm for optimization Computers & Chemical Engineering, 35 (12). pp. 2716-2728. ISSN 0098-1354
Full text not available from this repository.
Official URL: http://www.sciencedirect.com/science/article/pii/S...
Related URL: http://dx.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.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Elsevier. |
| Keywords: | Cutting Plane; Successive Linear Programming; Sharp Cut; Convergence Theorem |
| ID Code: | 85717 |
| Deposited On: | 05 Mar 2012 14:08 |
| Last Modified: | 05 Mar 2012 14:08 |
Repository Staff Only: item control page
