A disjunctive cutting plane based branch-and-cut algorithm for mixed-integer nonlinear optimization problems*

摘要：

In this paper, a disjunctive cutting plane based branch-and-cut algorithm is developed to solve the 0-1 mixed-integer convex nonlinear programming (MINLP) problems. In a branch-and-bound framework, the 0-1 MINLP problem is approximated with a 0-1 mixed-integer linear program at each node, then the lift-and-project technology is used to generate valid cuts in order to speed up the branching process.

关键词： Mixed-integer nonlinear programming branch-and-cut disjunctive cutting plane MINLP.

作者: ZHU Yushan HU Yijiong

作者单位: Department of Chemical Engineering,Tsinghua University,Beijing 100084,China.

会议类型: 国际会议

会议名称: 第四届亚洲过程系统工程会议暨2007年中国国际系统工程年会(The 4th International Symposium on Design,Operation & Control of Chemical Processes)(PSE ASIA 2007)

会议地点: 西安

会议语种:英文

在线出版日期: 2007-08-15（万方平台首次上网日期，不代表论文的发表时间）