Abstract
In this paper, we develop a new filled function method to solve nonlinear integer programming problem. It is shown that any local minimizer of the new filled function constructed from a current local minimizer is either a better local minimizer of the original integer programming problem or a vertex of its constrained domain. Hence a better local minimizer can be obtained just by local search scheme for the new filled function. An algorithm based on the nice properties of the new filled function is proposed for locating the global minimizer of the original integer programming problem. Several numerical examples are presented to show the efficiency of the algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
