✦ LIBER ✦

A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems

✍ Scribed by F. Cole; W. Gochet; Y. Smeer

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A primal-dual cutting-plane algorithm fo

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

A cutting plane algorithm for the biline

✍ H. Vaish; C. M. Shetty 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 731 KB

A long-step primal–dual algorithm for th

✍ L. Faybusovich; R. Arana 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 94 KB

A primal-dual infeasible-interior-point

✍ Huang Hui; Fei Pu-sheng; Yuan Yuan 📂 Article 📅 2005 🏛 Wuhan University 🌐 English ⚖ 290 KB

A central cutting plane algorithm for th

✍ Jack Elzinga; Thomas G. Moore 📂 Article 📅 1975 🏛 Springer-Verlag 🌐 English ⚖ 496 KB

A note on the primal-dual and out-of-kil

✍ J. F. Shapiro 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 341 KB 👁 1 views