TY - JOUR
T1 - An extended cutting plane method for a class of non-convex MINLP problems
AU - Westerlund, Tapio
AU - Skrifvars, Hans
AU - Harjunkoski, Iiro
AU - Pörn, Ray
PY - 1998
Y1 - 1998
N2 - An extended cutting plane method is introduced. The extended method can be applied in the solution of a class of non-convex MINLP (mixed-integer non-linear programming) problems, although the method was originally introduced for the solution of convex problems only. Global convergence properties of the method are given for pseudo-convex MINLP problems in the present paper and a numerical example from the paper-converting industry is finally provided to illustrate the numerical procedure.
AB - An extended cutting plane method is introduced. The extended method can be applied in the solution of a class of non-convex MINLP (mixed-integer non-linear programming) problems, although the method was originally introduced for the solution of convex problems only. Global convergence properties of the method are given for pseudo-convex MINLP problems in the present paper and a numerical example from the paper-converting industry is finally provided to illustrate the numerical procedure.
KW - Extended cutting plane method
KW - Integer non-linear programming
KW - Mixed-integer non-linear programming
KW - Optimization
KW - Pseudo-convex functions
KW - Quasi-convex functions
UR - http://www.scopus.com/inward/record.url?scp=0031676324&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:0031676324
SN - 0098-1354
VL - 22
SP - 357
EP - 365
JO - Computers and Chemical Engineering
JF - Computers and Chemical Engineering
IS - 3
ER -