Diego A. Morán R.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Diego A. Morán R. has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Burak Kocuk
Industrial Engineering Program Sabancı University 34956 Istanbul Turkey
4 shared publications - Oktay Günlük
School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853
1 shared publication - Sanjeeb Dash
IBM Research
1 shared publication
Latest Publications
- 5 July 2025
- Published by Springer Nature
- p. 1-11
Conic Mixed Integer Programming: Subadditive Duality
- 31 July 2024
- Published by Springer Nature
- p. 1-11
Conic Mixed Integer Programming: Subadditive Duality
- 21 September 2022
- Published by Springer Nature
- p. 1-11
Conic Mixed Integer Programming: Subadditive Duality
- 21 September 2022
- Published by Springer Nature
- p. 1-11
Conic Mixed Integer Programming: Subadditive Duality
- Open Access
On Subadditive Duality for Conic Mixed-Integer Programs
In this paper, we show that the subadditive dual of a feasible conic mixed-integer program (MIP) is a strong dual whenever it is feasible. Moreover, we show that this dual feasibility condition is equivalent to feasibility of the conic dual of the continuous relaxation of the conic MIP. In addition, we prove that all known conditions and other 'natural' conditions for strong duality, such as strict mixed-integer feasibility, boundedness of the feasible set or essentially strict feasibility imply that the subadditive dual is feasible. As an intermediate result, we extend the so-called 'finiteness property' from full-dimensional convex sets to intersections of full-dimensional convex sets and Dirichlet convex sets.
Open AccessOn Subadditive Duality for Conic Mixed-Integer Programs
In this paper, we show that the subadditive dual of a feasible conic mixed-integer program (MIP) is a strong dual whenever it is feasible. Moreover, we show that this dual feasibility condition is equivalent to feasibility of the conic dual of the continuous relaxation of the conic MIP. In addition, we prove that all known conditions and other 'natural' conditions for strong duality, such as strict mixed-integer feasibility, boundedness of the feasible set or essentially strict feasibility imply that the subadditive dual is feasible. As an intermediate result, we extend the so-called 'finiteness property' from full-dimensional convex sets to intersections of full-dimensional convex sets and Dirichlet convex sets.
- 19 March 2019
- Published by Springer Nature in Mathematical Programming
- Vol. 181 (1) , 119-147
Lattice closures of polyhedra
- 19 March 2019
- Published by Springer Nature in Mathematical Programming
- Vol. 181 (1) , 119-147
Lattice closures of polyhedra