✦ LIBER ✦

A generalized homogeneous and self-dual algorithm for linear programming

✍ Scribed by Xiaojie Xu; Yinyu Ye

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 410 KB
Volume: 17
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(95)00002-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A mutual primal-dual linear programming

A mutual primal-dual linear programming algorithm

✍ Milton Y. Harris 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 329 KB

A dual version of tardos's algorithm for

A dual version of tardos's algorithm for linear programming

✍ James B Orlin 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 520 KB

A primal-dual cutting-plane algorithm fo

A primal-dual cutting-plane algorithm for all-integer programming

✍ Parviz Ghandforoush; Larry M. Austin 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 495 KB 👁 1 views

Homogeneous sets and domination: A linea

Homogeneous sets and domination: A linear time algorithm for distance—hereditary graphs

✍ Falk Nicolai; Thomas Szymczak 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

Conical algorithms for solving a concave

Conical algorithms for solving a concave programming problem and some generalizations

✍ S.L. Utkin; V.R. Khachaturov; H. Tuy 📂 Article 📅 1988 🏛 Elsevier Science ⚖ 490 KB

A steepest edge active set algorithm for

A steepest edge active set algorithm for solving sparse linear programming problems

✍ S. W. Sloan 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 863 KB

A steepest edge active set algorithm is described which is suitable for solving linear programming problems where the constraint matrix is sparse and has more rows than columns. The algorithm uses a steepest edge criterion for selecting the search direction at each iteration and recurrence relations