ON SUBADDITIVE DUALITY FOR CONIC MIXED-INTEGER PROGRAMS

Kocuk, B

Keywords: mixed-integer programming, conic programming, subadditive duality

Abstract

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.

Más información

Título según WOS: ON SUBADDITIVE DUALITY FOR CONIC MIXED-INTEGER PROGRAMS
Título de la Revista: SIAM JOURNAL ON OPTIMIZATION
Volumen: 29
Número: 3
Editorial: SIAM PUBLICATIONS
Fecha de publicación: 2019
Página de inicio: 2320
Página final: 2336
Idioma: English
DOI:

10.1137/18M1210812

Notas: ISI