✦ LIBER ✦

The decomposition principle and algorithms for linear programming

✍ Scribed by K. Kim; J.L. Nazareth

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 788 KB
Volume: 152
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(91)90270-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New purification algorithms for linear p

New purification algorithms for linear programming

✍ K. O. Kortanek; Zhu Jishan 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 675 KB

A linear algorithm for nonredundant deco

A linear algorithm for nonredundant decompositions

✍ J.F. Cordoba 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 239 KB

Deterministic Algorithms for 2-d Convex

Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming

✍ Timothy M Chan 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 228 KB

We present a deterministic algorithm for solving two-dimensional convex pro-Ž . grams with a linear objective function. The algorithm requires O k log k primitive operations for k constraints; if a feasible point is given, the bound reduces to Ž . O k log krlog log k . As a consequence, we can decid

Numerical behavior of LP algorithms base

Numerical behavior of LP algorithms based upon the decomposition principle

✍ Larry Nazareth 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 271 KB

Some algorithms for solving non-linear i

Some algorithms for solving non-linear integer mathematical programming problems

✍ Y.G. Mitev 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 455 KB

Decomposition of linear programs by dyna

Decomposition of linear programs by dynamic programming

✍ George L. Nemhauser 📂 Article 📅 1964 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB