Limits to the scope of applicability of extended formulations for LP models of combinatorial optimization problems: A summary
Computational Complexity
2016-10-21 v2 Discrete Mathematics
Optimization and Control
Abstract
We show that new definitions of the notion of "projection" on which some of the recent "extended formulations" works (such as Kaibel (2011); Fiorini et al. (2011; 2012); Kaibel and Walter (2013); Kaibel and Weltge (2013) for example) have been based can cause those works to over-reach in their conclusions in relating polytopes to one another when the sets of the descriptive variables for those polytopes are disjoint.
Keywords
Cite
@article{arxiv.1403.0529,
title = {Limits to the scope of applicability of extended formulations for LP models of combinatorial optimization problems: A summary},
author = {Moustapha Diaby and M. H. Karwan},
journal= {arXiv preprint arXiv:1403.0529},
year = {2016}
}
Comments
9 pages. arXiv admin note: substantial text overlap with arXiv:1309.1823; This version (.v2) is simply a more formalized presentation