Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10347291 | Computers & Operations Research | 2011 | 11 Pages |
Abstract
In this paper, a new algorithm for solving constrained nonlinear programming problems is presented. The basis of our proposed algorithm is none other than the necessary and sufficient conditions that one deals within a discrete constrained local optimum in the context of the discrete Lagrange multipliers theory. We adopt a revised particle swarm optimization algorithm and extend it toward solving nonlinear programming problems with continuous decision variables. To measure the merits of our algorithm, we provide numerical experiments for several renowned benchmark problems and compare the outcome against the best results reported in the literature. The empirical assessments demonstrate that our algorithm is efficient and robust.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Ali Mohammad Nezhad, Hashem Mahlooji,