𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of linear programming

✍ Scribed by J.F. Traub; H. Woźniakowski


Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
415 KB
Volume
1
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Complexity analysis of logarithmic barri
✍ Zhi-Quan Luo; C. Roos; T. Terlaky 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 816 KB

In this paper, we analyze a logarithmic barrier decomposition method for solving a semi-infinite linear programming problem. This method is in some respects similar to the column generation methods using analytic centers. Although the method was found to be very efficient in the recent computational