✦ LIBER ✦

A quadratic programming view of the linear complementary problem

✍ Scribed by Bruce R. Feiring

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 141 KB
Volume: 3
Category: Article
ISSN: 0893-9659
DOI: 10.1016/0893-9659(90)90132-u

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear, quadratic, and bilinear programm

Linear, quadratic, and bilinear programming approaches to the linear complementarity problem

✍ Faiz A. Al-Khayyal 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 899 KB

Linear programming for the 0–1 quadratic

Linear programming for the 0–1 quadratic knapsack problem

✍ Alain Billionnet; Frédéric Calmels 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 852 KB

A descent approach to solving the comple

A descent approach to solving the complementary programming problem

✍ V. Venkateswaran 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 810 KB

The solution of an integer quadratic pro

The solution of an integer quadratic programming problem

✍ V.V. Bashurov 📂 Article 📅 1966 🏛 Elsevier Science ⚖ 158 KB

On the performance of linear programming

On the performance of linear programming heuristics applied on a quadratic transformation in the classification problem

✍ William J. Banks; Prakash L. Abad 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 397 KB

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