<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Inamdar, Satish R.</style></author><author><style face="normal" font="default" size="100%">Karimi, I. A.</style></author><author><style face="normal" font="default" size="100%">Parulekar, S. J.</style></author><author><style face="normal" font="default" size="100%">Kulkarni, B. D.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Sharp cut algorithm for optimization</style></title><secondary-title><style face="normal" font="default" size="100%">Computers &amp; Chemical Engineering</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Convergence theorem</style></keyword><keyword><style  face="normal" font="default" size="100%">Cutting plane</style></keyword><keyword><style  face="normal" font="default" size="100%">Sharp cut</style></keyword><keyword><style  face="normal" font="default" size="100%">Successive linear programming</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">DEC</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">12</style></number><publisher><style face="normal" font="default" size="100%">PERGAMON-ELSEVIER SCIENCE LTD</style></publisher><pub-location><style face="normal" font="default" size="100%">THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND</style></pub-location><volume><style face="normal" font="default" size="100%">35</style></volume><pages><style face="normal" font="default" size="100%">2716-2728</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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. (C) 2010 Elsevier Ltd. All rights reserved.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">12</style></issue><custom3><style face="normal" font="default" size="100%">&lt;p&gt;Foreign&lt;/p&gt;</style></custom3><custom4><style face="normal" font="default" size="100%">3.17</style></custom4></record></records></xml>