中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Branch-and-Cut Algorithmic Framework for 0-1 Mixed-Integer Convex Nonlinear Programs

文献类型:期刊论文

作者Wu, Hao1,2; Wen, Hao2; Zhu, Yushan1
刊名INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH
出版日期2009-10-21
卷号48期号:20页码:9119-9127
关键词CUTTING PLANE METHOD OUTER-APPROXIMATION GLOBAL OPTIMIZATION MINLP OPTIMIZATION BOUND ALGORITHM GOMORY CUTS PROJECT
ISSN号0888-5885
通讯作者Zhu, YS
英文摘要With widespread use of mixed-integer modeling for continuous and discontinuous nonlinear chemical processes, a robust mixed-integer nonlinear optimization algorithm is strongly demanded for the design and operation of chemical processes that achieve greater profits and also satisfy environmental and safety constraints. In this article, an extensive evaluation of a branch-and-cut algorithmic framework for 0-1 mixed-integer convex nonlinear programs, called MINO for Mixed-Integer Nonlinear Optimizer, is presented, The numerical performances of MINO are tested against four sets of medium-sized practical application problems from the fields of operations research and chemical engineering, The effects of the nonlinear programming (NLP) solvers, the cut generating and maintaining strategy, the node selection method, and the frequency of cut generation are examined, in order to handle MINLP problem with different mathematical structures. Preliminary computational results show that MINO exhibits a capability for handling practical MINLP problems that is comparable to that of the commercial solvers SBB and DICOPT, and it shows better performance for some problems for which either commercial solver encounters convergence problem within a CPU time limit of 6 h.
WOS标题词Science & Technology ; Technology
类目[WOS]Engineering, Chemical
研究领域[WOS]Engineering
关键词[WOS]CUTTING PLANE METHOD ; OUTER-APPROXIMATION ; GLOBAL OPTIMIZATION ; MINLP OPTIMIZATION ; BOUND ALGORITHM ; GOMORY CUTS ; PROJECT
收录类别SCI
语种英语
WOS记录号WOS:000270671300009
公开日期2013-11-29
版本出版稿
源URL[http://ir.ipe.ac.cn/handle/122111/6561]  
专题过程工程研究所_多相复杂系统国家重点实验室
作者单位1.Tsinghua Univ, Dept Chem Engn, Beijing 100084, Peoples R China
2.Chinese Acad Sci, Inst Proc Engn, Beijing 100190, Peoples R China
推荐引用方式
GB/T 7714
Wu, Hao,Wen, Hao,Zhu, Yushan. Branch-and-Cut Algorithmic Framework for 0-1 Mixed-Integer Convex Nonlinear Programs[J]. INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH,2009,48(20):9119-9127.
APA Wu, Hao,Wen, Hao,&Zhu, Yushan.(2009).Branch-and-Cut Algorithmic Framework for 0-1 Mixed-Integer Convex Nonlinear Programs.INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH,48(20),9119-9127.
MLA Wu, Hao,et al."Branch-and-Cut Algorithmic Framework for 0-1 Mixed-Integer Convex Nonlinear Programs".INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH 48.20(2009):9119-9127.

入库方式: OAI收割

来源:过程工程研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。