Check out RSS, or use RSS reader to subscribe this item
Confirmation
Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
Sponsored by the Center for Science and Technology Development of the Ministry of Education
Supervised by Ministry of Education of the People's Republic of China
In 1995 Westerlund and Pettersson proposed extended cutting plane (ECP) method for solving MINLP problems which is extended from Kelley's Cutting Plane (CP) method. The advantage of ECP method is simplicity and robustness of the solution and ECP method is suitable for solving large convex MINLP problems with moderate degree nonlinearity. In 1967 Veinott introduced a supporting hyperplane (SHP) method for solving NLP problems. Following the idea of ECP method, SHP method can be extended to solve MINLP problems. When SHP method is applied for solving MINLP problems, an interior point or a feasible solution must be gotten at first. However, finding a good feasible solution to a MINLP problem is difficult. So in this paper a new kind of SHP method, non interior point based SHP (NISHP) method,is introduced. A feasible solution is not required at the beginning in this method, and this method is more efficient than ECP method.