An improved genetic algorithm (IGA) based on a novel selection strategy to handle nonlinear programming problems is proposed. Each individual in selection process is represented as a three-dimensional ...

A new nonmonotone line-search procedure is presented for the generally constrained case of nonlinear programming problems. The new algorithm is based on the use of standard penalty methods for the ...

K. Deb, Nonlinear Goal Programming Using Multi-Objective Genetic Algorithms, The Journal of the Operational Research Society, Vol. 52, No. 3 (Mar., 2001), pp. 291-302 ...

Linear and nonlinear programming are powerful methods for optimizing complex problems that involve multiple variables and constraints. However, they also have some challenges and limitations that ...

A novel nonlinear programming based control allocation scheme is developed. The performance of this nonlinear control allocation algorithm is compared with that of other control allocation approaches, ...

The first algorithm is based on an objective space cut and bound method for solving convex FP problems and the second algorithm is based on the proposed bi-objective algorithm for solving nonlinear FP ...

Learn how to navigate the common challenges of nonlinear programming (NLP), such as finding global optima, handling non-convexity, and solving large-scale models.

This paper presents an efficient method which accelerates the nonlinear analysis process. In this method, some path-following algorithms have been used to pass the limit points. A computer program is ...