Steepest descent method for solving zero-one nonlinear programming problems
作者：
Highlights：
•
摘要
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.
论文关键词：Zero-one nonlinear programming problem,Steepest descent method,Penalty function,Unconstrained optimization
论文评审过程：Available online 14 April 2007.
论文官网地址：https://doi.org/10.1016/j.amc.2007.03.088
