Steepest descent method for solving zero-one nonlinear programming problems

摘要

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. (C) 2007 Elsevier Inc. All rights reserved.