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

共 50 条

[21] A DECOMPOSITION METHOD FOR QUADRATIC ZERO-ONE PROGRAMMING
CHARDAIRE, P
SUTTER, A
[J]. MANAGEMENT SCIENCE, 1995, 41 (04) : 704 - 712
[22] Efficient Solutions for Special Zero-One Programming Problems
Ariela Bilitzky
Arik Sadeh
[J]. Journal of Combinatorial Optimization, 2005, 10 : 227 - 238
[23] AN IMPROVED ENUMERATIVE ALGORITHM FOR SOLVING QUADRATIC ZERO-ONE PROGRAMMING
LU, SH
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1984, 15 (01) : 110 - 120
[24] SOLVING A ZERO-ONE INTEGER LINEAR-PROGRAMMING PROBLEM
PATEL, HM
[J]. INDUSTRIAL ENGINEERING, 1989, 21 (03): : 49 - 51
[25] Efficient solutions for special zero-one programming problems
Bilitzky, A
Sadeh, A
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2005, 10 (03) : 227 - 238
[26] PENALTY FORMULATION FOR ZERO-ONE NONLINEAR-PROGRAMMING
KALANTARI, B
ROSEN, JB
[J]. DISCRETE APPLIED MATHEMATICS, 1987, 16 (02) : 179 - 182
[27] Convergence of a continuous approach for zero-one programming problems
Li, Yanyan
Tan, Tao
Li, Xingsi
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2011, 217 (09) : 4691 - 4698
[28] REDUCTION OF INTEGER POLYNOMIAL PROGRAMMING PROBLEMS TO ZERO-ONE LINEAR PROGRAMMING
WATTERS, LJ
[J]. OPERATIONS RESEARCH, 1967, 15 (06) : 1171 - &
[29] ZERO-ONE HYPERBOLIC PROGRAMMING
FLORIAN, M
ROBILLARD, P
[J]. REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1971, 5 (NV1): : 3 - 9
[30] An improved linearization strategy for zero-one quadratic programming problems
Hanif D. Sherali
J. Cole Smith
[J]. Optimization Letters, 2007, 1 : 33 - 47

← 1 2 3 4 5 →