Improving the solution of indefinite quadratic programs and linear programs with complementarity constraints by a progressive MIP method
Indefinite quadratic programs (QPs) are known to be very difficult to be solved to global optimality, so are linear programs with linear complementarity constraints (LPCCs). It is a classic result that for a QP with an optimal solution, the QP has an equivalent formulation as a certain LPCC in terms...
Uložené v:
| Vydané v: | Mathematical programming computation |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
16.09.2025
|
| ISSN: | 1867-2949, 1867-2957 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!