On Harmonic Convexity (Concavity) and Application to Non-Linear Programming Problems

OPSEARCH ◽  
2003 ◽  
Vol 40 (1) ◽  
pp. 42-51 ◽  
Author(s):  
C. Das ◽  
S. Mishra ◽  
P. K. Pradhan
Keyword(s):  
Linear Programming ◽  
Non Linear Programming ◽  
Non Linear ◽  
Linear Programming Problems ◽  
Harmonic Convexity

IMPROVED PARTICLE SWARM OPTIMIZATION FOR NON-LINEAR PROGRAMMING PROBLEM WITH BARRIER METHOD

2017 ◽  
Vol 5 (4) ◽  
pp. 72-80
Author(s):  
Raju Prajapati ◽  
Om Prakash Dubey ◽  
Randhir Kumar
Keyword(s):  
Linear Programming ◽  
Particle Swarm Optimization ◽  
Programming Language ◽  
Particle Swarm ◽  
Barrier Method ◽  
Lagrangian Multipliers ◽  
Swarm Optimization ◽  
Non Linear Programming ◽  
Non Linear ◽  
Linear Programming Problems

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.

Sign in / Sign up

Export Citation Format

Share Document