The penalty function method is one basic method for solving constrained nonlinear programming, in which simple smooth exact penalty functions draw much attention for their simpleness and smoothness. This article offer...The penalty function method is one basic method for solving constrained nonlinear programming, in which simple smooth exact penalty functions draw much attention for their simpleness and smoothness. This article offers a new kind of simple smooth approximative exact penalty function of general constrained nonlinear programmings and analyzes its properties.展开更多
Engineering optimization problems can be always classified into two main categories including the linear programming(LP)and nonlinear programming(NLP)problems.Each programming problem further involves the unconstraine...Engineering optimization problems can be always classified into two main categories including the linear programming(LP)and nonlinear programming(NLP)problems.Each programming problem further involves the unconstrained conditions and constrained conditions for design variables of the optimized system.This paper will focus on the issue about the design problem of NLP with the constrained conditions.The employed method for such NLP problems is a variant of particle swarm optimization(PSO),named improved particle swarm optimization(IPSO).The developed IPSO is to modify the velocity updating formula of the algorithm to enhance the search ability for given optimization problems.In this work,many different kinds of physical engineering optimization problems are examined and solved via the proposed IPSO algorithm.Simulation results compared with various optimization methods reported in the literature will show the effectiveness and feasibility for solving NLP problems with the constrained conditions.展开更多
文摘The penalty function method is one basic method for solving constrained nonlinear programming, in which simple smooth exact penalty functions draw much attention for their simpleness and smoothness. This article offers a new kind of simple smooth approximative exact penalty function of general constrained nonlinear programmings and analyzes its properties.
基金This work was partially supported by the Ministry of Science and Technology of Taiwan Under Grant No.MOST 108-2221-E-366-003.
文摘Engineering optimization problems can be always classified into two main categories including the linear programming(LP)and nonlinear programming(NLP)problems.Each programming problem further involves the unconstrained conditions and constrained conditions for design variables of the optimized system.This paper will focus on the issue about the design problem of NLP with the constrained conditions.The employed method for such NLP problems is a variant of particle swarm optimization(PSO),named improved particle swarm optimization(IPSO).The developed IPSO is to modify the velocity updating formula of the algorithm to enhance the search ability for given optimization problems.In this work,many different kinds of physical engineering optimization problems are examined and solved via the proposed IPSO algorithm.Simulation results compared with various optimization methods reported in the literature will show the effectiveness and feasibility for solving NLP problems with the constrained conditions.
