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

41Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.

Abstract

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. Copyright © 2005 Hindawi Publishing Corporation.

Cite

CITATION STYLE

APA

Yeniay, O. (2005). A comparative study on optimization methods for the constrained nonlinear programming problems. Mathematical Problems in Engineering, 2005(2), 165–173. https://doi.org/10.1155/MPE.2005.165

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free