✦ LIBER ✦

Identifying an optimal basis in linear programming

✍ Scribed by Stephen A. Vavasis; Yinyu Ye

Book ID: 112712095
Publisher: Springer US
Year: 1996
Tongue: English
Weight: 345 KB
Volume: 62
Category: Article
ISSN: 0254-5330
DOI: 10.1007/bf02206830

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Degenerate optimal basis graphs in linea

Degenerate optimal basis graphs in linear programming

✍ Lin Yixun; Wen Jianjun 📂 Article 📅 2000 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 433 KB

An efficient basis update for asymptotic

An efficient basis update for asymptotic linear programming

✍ Bernard F. Lamond 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 980 KB

Advanced basis construction in linear pr

Advanced basis construction in linear programming

✍ H. J. Greenberg 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 547 KB

Advanced basis construction in linear pr

Advanced basis construction in linear programming

✍ H. J. Greenberg 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 648 KB

Identifying the optimal partition in con

Identifying the optimal partition in convex quadratic programming

✍ Stephen E. Wright 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 131 KB

Given an optimal solution for a convex quadratic programming (QP) problem, the optimal partition of the QP can be computed by solving a pair of linear or QP problems for which nearly optimal solutions are known.

Constructing an artificial basis in the

Constructing an artificial basis in the symmetric linear programming problems

✍ I. P. Momot 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 317 KB