In this paper we investigate two generalizations of the continuous mixing set studied by Miller and Wolsey and Van Vyve: the intersection set and the continuous mixing set with flows, which appears as a strong relaxation of some single-item lot-sizing problems. We give two extended formulations for the convex hull of each of these sets. In particular, for the latter sets the sizes of the extended formulations are polynomial in the size of the original description of the set, thus proving that the corresponding linear optimization problem can be solved in polynomial time.

The intersection of continuous mixing polyhedra and the continuous mixing polyhedron with flows

CONFORTI, MICHELANGELO;DI SUMMA, MARCO;
2007

Abstract

In this paper we investigate two generalizations of the continuous mixing set studied by Miller and Wolsey and Van Vyve: the intersection set and the continuous mixing set with flows, which appears as a strong relaxation of some single-item lot-sizing problems. We give two extended formulations for the convex hull of each of these sets. In particular, for the latter sets the sizes of the extended formulations are polynomial in the size of the original description of the set, thus proving that the corresponding linear optimization problem can be solved in polynomial time.
2007
Integer Programming and Combinatorial Optimization (IPCO)
12th International IPCO Conference
9783540727910
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/1783145
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 9
  • ???jsp.display-item.citation.isi??? 5
  • OpenAlex ND
social impact