A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems

作者：Nezhad Ali Mohammad^*; Mahlooji Hashem

来源：Computers & Operations Research, 2011, 38(8): 1164-1174.

DOI：10.1016/j.cor.2010.11.007

• Particle swarm optimization
• Discrete Lagrange multipliers
• Nonlinear programming
• Priority based feasibility strategy

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.

• 出版日期2011-8