.png){kind=icon}
返回
Convergence of a continuous approach for zero-one programming problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2010.11.022.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper a new continuous formulation for the zero-one programming problem is presented, followed by an investigation of the algorithm for it. This paper first reformulates the zero-one programming problem as an equivalent mathematical programs with complementarity constraints, then as a smooth ordinary nonlinear programming problem with the help of the Fischer-Burmeister function. After that the augmented Lagrangian method is introduced to solve the resulting continuous problem, with optimality conditions for the non-smooth augmented Lagrangian problem derived on the basis of approximate smooth variational principle, and with convergence properties established. To our benefit, the sequence of solutions generated converges to feasible solutions of the original problem, which provides a necessary basis for the convergence results. (C) 2010 Elsevier Inc. All rights reserved.
Keyword:
Zero-one programming problems
Boolean variables
Fischer-Burmeister function
Optimality condition
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
分享收藏A retrofit strategy to achieve “Fast, Flexible, Future (F3)” pharmaceutical production processes
OAAI
OAAI分享收藏
查看更多内容