Determination of Feasible Directions by Successive Quadratic Programming and Zoutendijk Algorithms: A Comparative Study


Abstract views: 31 / PDF downloads: 35

Authors

  • Tripti Sharma Addis Ababa Science and Technology University, Ethiopia
  • Semeneh Hunachew Arba Minch University, Ethiopia

Keywords:

Zoutendijk Algorithm, Successive Quadratic Programming Method, optimization, Feasible points, Feasible directions

Abstract

This study is focused on comparison between Method of Zoutendijk and Successive Quadratic Programming (SQP) Method, which are the methods to find feasible directions while solving a non-linear programming problem by moving from a feasible point to an improved feasible point.

Downloads

Published

15-12-2014

How to Cite

Tripti Sharma, & Semeneh Hunachew. (2014). Determination of Feasible Directions by Successive Quadratic Programming and Zoutendijk Algorithms: A Comparative Study. International Journal of Mathematics And Its Applications, 2(4), 59–70. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/319

Issue

Vol. 2 No. 4 (2014)

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.