✦ LIBER ✦

Algorithms of bilinear programming

✍ Scribed by E. N. Sokiryanskaya

Book ID: 105058593
Publisher: Springer US
Year: 1976
Tongue: English
Weight: 492 KB
Volume: 10
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01071550

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bilinear programming: An exact algorithm

✍ Giorgio Gallo; Aydin Ülkücü 📂 Article 📅 1977 🏛 Springer-Verlag 🌐 English ⚖ 910 KB

Accelerating convergence of cutting plan

Accelerating convergence of cutting plane algorithms for disjoint bilinear programming

✍ Xiaosong Ding; Faiz Al-Khayyal 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 246 KB

Bundle Trust-Region Algorithm for Biline

Bundle Trust-Region Algorithm for Bilinear Bilevel Programming

✍ S. Dempe; J. F. Bard 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 138 KB

A cutting plane algorithm for solving bi

A cutting plane algorithm for solving bilinear programs

✍ Hiroshi Konno 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 546 KB

A cutting plane algorithm for the biline

A cutting plane algorithm for the bilinear programming problem

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

Efficient algorithms for solving rank tw

Efficient algorithms for solving rank two and rank three bilinear programming problems

✍ Yasutoshi Yajima; Hiroshi Konno 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 866 KB

Finitely convergent algorithms for solving rank two and three bilinear programming problems are proposed. A rank k bilinear programming problem is a nonconvex quadratic programming problem with the following structure: minimize c& + df,y + i c;x-d;y(xEX, yEY , j=l I where XC R"' and Y C RnZ are non