In this paper we consider Quadratic Programming (QP) problems with general linear constraints. We show, through a computational investigation, that a careful selection of a suitable reformulation of such problems, together with the related relaxation, and an intensive application of bound tightening are simple but very effective ingredients in order to make a standard branch and bound approach very competitive and in some cases able to outperform even well known commercial solvers.
A computational study on QP problems with general linear constraints / Liuzzi, G.; Locatelli, M.; Piccialli, V.. - In: OPTIMIZATION LETTERS. - ISSN 1862-4472. - (2022). [10.1007/s11590-021-01846-6]
A computational study on QP problems with general linear constraints
Locatelli M.;
2022-01-01
Abstract
In this paper we consider Quadratic Programming (QP) problems with general linear constraints. We show, through a computational investigation, that a careful selection of a suitable reformulation of such problems, together with the related relaxation, and an intensive application of bound tightening are simple but very effective ingredients in order to make a standard branch and bound approach very competitive and in some cases able to outperform even well known commercial solvers.| File | Dimensione | Formato | |
|---|---|---|---|
|
OPTL_QP_2021.pdf
Open Access dal 02/02/2023
Tipologia:
Documento in Post-print
Licenza:
Creative commons
Dimensione
373.27 kB
Formato
Adobe PDF
|
373.27 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
