Steepest descent method for solving zero-one nonlinear programming problems
- 作者：M. Anjidani ; S. Effati
- 关键词：Zero-one nonlinear programming problem ; Steepest descent method ; Penalty function ; Unconstrained optimization
- 刊名：Applied Mathematics and Computation
- 出版年：2007
- 期刊代码：7_00963003
- 类别：cp
- 出版时间：1 October 2007
- 卷：193
- 期：1
- 页码：197-202
- 文件大小：114 K
摘要
In this paper we use steepest descent method for solving zero-one nonlinear programming problem. Using penalty function we transform this problem to an unconstrained optimization problem and then by steepest descent method we obtain the original problem optimal solution.