Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones

We propose the formulation of convex Generalized Disjunctive Programming (GDP) problems using conic inequalities leading to conic GDP problems. We then show the reformulation of conic GDPs into Mixed-Integer Conic Programming (MICP) problems through both the big-M and hull reformulations. These refo...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computational optimization and applications Ročník 88; číslo 1; s. 251 - 312
Hlavní autori:	Bernal Neira, David E., Grossmann, Ignacio E.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.05.2024 Springer Nature B.V
Predmet:	Algebra Approximation Artificial intelligence Chemical engineering Cones Convex analysis Convex and Discrete Geometry Integer programming Linear programming Machine learning Management Science Mathematical analysis Mathematics Mathematics and Statistics Mixed integer Nonlinear programming Operations Research Operations Research/Decision Theory Optimization Solvers Statistics Systems engineering Perspective function Generalized disjunctive programming Mixed-integer nonlinear programming Conic programming
ISSN:	0926-6003, 1573-2894
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!