Mathematical Problems in Engineering
Volume 2005 (2005), Issue 2, Pages 165-173

A comparative study on optimization methods for the constrained nonlinear programming problems

Ozgur Yeniay

Department of Statistics, Faculty of Science, Hacettepe University, 06532 Beytepe, Ankara, Turkey

Received 2 August 2004; Revised 12 November 2004

Copyright © 2005 Ozgur Yeniay. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Constrained nonlinear programming problems often arise in many engineering applications. The most well-known optimization methods for solving these problems are sequential quadratic programming methods and generalized reduced gradient methods. This study compares the performance of these methods with the genetic algorithms which gained popularity in recent years due to advantages in speed and robustness. We present a comparative study that is performed on fifteen test problems selected from the literature.