A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints
Year of publication: |
2019
|
---|---|
Authors: | Chieu, N. H. ; Chuong Thai Doan ; Jeyakumar, Vaithilingam ; Li, Guoyin |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 47.2019, 6, p. 530-536
|
Subject: | Binary constraint | Conic programming | Conic relaxation | Generalized Farkas' lemma | Nonconvex quadratic system | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Farkas' lemma : three decades of generalizations for mathematical optimization
Dinh, N., (2014)
-
Daily scheduling of generating units with natural-gas market constraints
Constante-Flores, Gonzalo E., (2024)
-
A conic relaxation model for searching for the global optimum of network data envelopment analysis
Chen, Kun, (2020)
- More ...
-
Chieu, N. H., (2017)
-
Chieu, N. H., (2018)
-
Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
Chieu, N. H., (2020)
- More ...