求非线性整数规划的逐次下降方法

O1; In this paper, a new method named as the gradually descent method was proposed to solve the discrete global optimization problem. With the aid of an auxiliary function, this method enables to convert the problem of finding one discrete minimizer of the objective function f to that of finding ano...

Full description

Saved in:
Bibliographic Details
Published in上海大学学报（英文版） Vol. 11; no. 1; pp. 39 - 44
Main Authors 杨永建, 张连生
Format Journal Article
LanguageChinese
Published Department of Mathematics, College of Sciences, Shanghai University, Shanghai 200444, P. R. China 2007
Subjects
integer programming
nonlinear integer programming
gradually descent method
algorithm
Online AccessGet full text
ISSN1007-6417

Cover

More Information
Summary:O1; In this paper, a new method named as the gradually descent method was proposed to solve the discrete global optimization problem. With the aid of an auxiliary function, this method enables to convert the problem of finding one discrete minimizer of the objective function f to that of finding another at each cycle. The auxiliary function can ensure that a point, except a prescribed point, is not its integer stationary point if the value of objective function at the point is greater than the scalar which is chosen properly. This property leads to a better minimizer of f found more easily by some classical local search methods. The computational results show that this algorithm is quite efficient and reliable for solving nonlinear integer programming problems.
ISSN:1007-6417