Steepest descent method for solving zero-one nonlinear programming problems

被引：13

作者：

Anjidani, M. ^{[1
]}

Effati, S. ^{[1
]}

机构：

[1] Teacher Training Univ Sabzevar, Dept Math, Sabzevar, Iran

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2007年 / 193卷 / 01期

关键词：

zero-one nonlinear programming problem; steepest descent method; penalty function; unconstrained optimization;

D O I：

10.1016/j.amc.2007.03.088

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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.

引用

页码：197 / 202

页数：6