IMPROVED PARTICLE SWARM OPTIMIZATION FOR NON-LINEAR PROGRAMMING PROBLEM WITH BARRIER METHOD
2017 ◽
Vol 5
(4)
◽
pp. 72-80
Keyword(s):
The Non-Linear Programming Problems (NLPP) are computationally hard to solve as compared to the Linear Programming Problems (LPP). To solve NLPP, the available methods are Lagrangian Multipliers, Sub gradient method, Karush-Kuhn-Tucker conditions, Penalty and Barrier method etc. In this paper, we are applying Barrier method to convert the NLPP with equality constraint to an NLPP without constraint. We use the improved version of famous Particle Swarm Optimization (PSO) method to obtain the solution of NLPP without constraint. SCILAB programming language is used to evaluate the solution on sample problems. The results of sample problems are compared on Improved PSO and general PSO.
Using quantum-behaved particle swarm optimization algorithm to solve non-linear programming problems
2007 ◽
Vol 84
(2)
◽
pp. 261-272
◽
2021 ◽