Analytical Approach for Linear Programming Using Barrier and Penalty Function Methods

In order to solve the primal linear programming problems (and its dual) some methods have been used such as simplex method, geometric approach and interior points methods. None of these methods used Lagrangian function as a tool to solve the problem. This raises a question why are we not using t...

Description complète

Détails bibliographiques
Auteur principal: Moengin, Parwadi
Format: Thèse
Langue:anglais
anglais
Publié: 2003
Sujets:
Accès en ligne:http://psasir.upm.edu.my/id/eprint/9577/1/FSAS_2003_35.pdf

Documents similaires