𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new technique for generating quadratic programming test problems

✍ Scribed by Paul H. Calamai; Luis N. Vicente; Joaquim J. Júdice

Publisher
Springer-Verlag
Year
1993
Tongue
English
Weight
994 KB
Volume
61
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new linearization technique for multi-
A new linearization technique for multi-quadratic 0–1 programming problems
✍ Wanpracha Chaovalitwongse; Panos M Pardalos; Oleg A Prokopyev 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 205 KB

We consider the reduction of multi-quadratic 0-1 programming problems to linear mixed 0-1 programming problems. In this reduction, the number of additional continuous variables is O(kn) (n is the number of initial 0-1 variables and k is the number of quadratic constraints). The number of 0-1 variabl

A new algorithm for quadratic programmin
A new algorithm for quadratic programming
✍ Tamás Terlaky 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 531 KB

We present a new finite algorithm for quadratic programming. Our algorithm is based on the solution procedures of linear programming (pivoting, Bland's rule, Hungarian Methods, criss-cross method), however this method does not require the enlargement of the basic tableau as Frank-Wolfe method does.

A decomposition method for structured qu
A decomposition method for structured quadratic programming problems
✍ K. Ritter 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 877 KB

This paper describes a decomposition method for large structured quadratic maximization problems. The method can be applied to problems which contain coupling constraints or coupling variables occurring in the objective function.