Title of article
A revisedparticleswarmoptimizationbaseddiscreteLagrangemultipliers method fornonlinearprogrammingproblems
Author/Authors
Ali MohammadNezhad ، نويسنده , , HashemMahlooji، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2011
Pages
11
From page
1164
To page
1174
Abstract
In thispaper,anewalgorithmforsolvingconstrainednonlinearprogrammingproblemsispresented.The
basisofourproposedalgorithmisnoneotherthanthenecessaryandsufficientconditionsthatonedeals
withinadiscreteconstrainedlocaloptimuminthecontextofthediscreteLagrangemultiplierstheory.We
adopt arevisedparticleswarmoptimizationalgorithmandextendittowardsolvingnonlinear
programmingproblemswithcontinuousdecisionvariables.Tomeasurethemeritsofouralgorithm,
we providenumericalexperimentsforseveralrenownedbenchmarkproblemsandcomparetheoutcome
against thebestresultsreportedintheliterature.Theempiricalassessmentsdemonstratethatour
algorithmisefficientandrobust.
Keywords
Priority based feasibility strategy , Particle swarm optimization , Discrete Lagrange multipliers , Nonlinear programming
Journal title
Computers and Operations Research
Serial Year
2011
Journal title
Computers and Operations Research
Record number
927935
Link To Document