Abstract
Purchase PDF (758 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (12)
Purchase PDF (370 K)
doi:10.1016/0305-0548(92)90072-D 
Copyright © 1992 Published by Elsevier Science Ltd.
An approximate method for local optima for nonlinear mixed integer programming problems
Available online 19 May 2003.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
For a nonlinear 0–1 integer programming problem with constraint set X = (x1, …xn), we first add new constraints
to the constraint set, thus to convert the integer problem into a nonlinear programming problem. Then we utilize a modified penalty function method to solve this nonlinear program to obtain a local optima. Running the proposed method by a widely commercialized nonlinear program software shows that this method is more convenient than current approaches as branch-and-bound method and implicit enumeration method. One issue remained for studies is to expand this method into a global method by systematically generating suitable starting points then to perform optimization processes from each of these points.