期刊
OPTIMIZATION AND ENGINEERING
卷 3, 期 3, 页码 253-280出版社
SPRINGER
DOI: 10.1023/A:1021091110342
关键词
optimization; mixed-integer non-linear programming; integer non-linear programming; quasi-convex functions; pseudo-convex functions; non-convex MINLP problems; extended cutting plane method
类别
资金
- Research Institute of the Foundation of Abo Akademi
In the present paper a cutting plane approach to solve mixed-integer non-linear programming (MINLP) problems, containing pseudo-convex functions, is given. It is shown how valid cutting planes for pseudo convex functions can be obtained and, furthermore, it is shown how a class of non-convex MINLP problems with a pseudo-convex objective function and pseudo-convex constraints, can be solved to global optimality with the considered cutting plane technique. Finally the numerical efficiency of the procedure, when solving some example problems, is illustrated.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据