Cut-generating functions and S-free sets - BIPOP Accéder directement au contenu
Article Dans Une Revue Mathematics of Operations Research Année : 2014

Cut-generating functions and S-free sets

Résumé

We consider the separation problem for sets X that are pre-images of a given set S by a linear mapping. Classical examples occur in integer programming, as well as in other optimization problems such as complementarity. One would like to generate valid inequalities that cut off some point not lying in X, without reference to the linear mapping. To this aim, we introduce a concept: cut-generating functions (cgf) and we develop a formal theory for them, largely based on convex analysis. They are intimately related to S-free sets and we study this relation, disclosing several definitions for minimal cgf's and maximal S-free sets. Our work unifies and puts in perspective a number of existing works on S-free sets; in particular, we show how cgf's recover the celebrated Gomory cuts.
Fichier principal
Vignette du fichier
cut-generating-functions.pdf (426.52 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01123860 , version 1 (05-03-2015)

Identifiants

Citer

Michele Conforti, Gérard Cornuéjols, Aris Daniilidis, Claude Lemaréchal, Jérôme Malick. Cut-generating functions and S-free sets. Mathematics of Operations Research, 2014, 40 (2), pp.276 - 391. ⟨10.1287/moor.2014.0670⟩. ⟨hal-01123860⟩
382 Consultations
192 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More