✦ LIBER ✦

Dynamic decomposition method for linear programming problems with ceneralized upper bounds

✍ Scribed by V. A. Trubin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An implementation of the simplex method

✍ Michael J. Todd 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 910 KB

A generalized upper bounding method for

✍ James K. Hartman; Leon S. Lasdon 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 902 KB

A quantitative method for solving proble

✍ N.P. Naumov 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 804 KB

A non-linear programming method approach

✍ M. Vicente da Silva; A. N. Antão 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 561 KB

A projection and division method for pro

✍ V.P. Belukhin 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 852 KB

A decomposition method of solving block

✍ V.Yu. Lebedev 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 301 KB