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...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English English |
| 出版: |
2003
|
| 主題: | |
| 在線閱讀: | http://psasir.upm.edu.my/id/eprint/9577/1/FSAS_2003_35.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|