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...

Descrición completa

Gardado en:
Detalles Bibliográficos
Autor Principal: Moengin, Parwadi
Formato: Thesis
Idioma:English
English
Publicado: 2003
Subjects:
Acceso en liña:http://psasir.upm.edu.my/id/eprint/9577/1/FSAS_2003_35.pdf
Tags: Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!