✦ LIBER ✦

On the worst case complexity of potential reduction algorithms for linear programming

✍ Scribed by Dimitris Bertsimas; Xiaodong Luo

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extensions of the potential reduction al

✍ Y. Y. Ye 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 628 KB

Near boundary behavior of primal—dual po

✍ Y. Ye; K. O. Kortanek; J. Kaliski; S. Huang 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 685 KB

On monotonicity in the scaled potential

✍ Kurt M. Anstreicher 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 583 KB

Worst-Case Complexity Bounds on Algorith

✍ Iliopoulos, Costas S. 📂 Article 📅 1989 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 772 KB

On the Worst-Case Behavior of String-Sea

✍ Rivest, Ronald L. 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 589 KB

On the efficacy of distributed simplex a

✍ James K. Ho; R. P. Sundarraj 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 794 KB