On the Simplex method for 0/1 polytopes

Authors Jesús A. De Loera, Sean Kafer, Laura Sanità

Publication date 27 November 2021

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Abstract: We present new pivot rules for the Simplex method for LPs over 0/1 polytopes. We show that the number of non-degenerate steps taken using these rules is strongly polynomial and even linear in the dimension or in the number of variables. Our bounds on the number of steps are asymptotically optimal on several well-known combinatorial polytopes. Our analysis is based on the geometry of 0/1 polytopes and novel modifications to the classical Steepest-Edge and Shadow-Vertex pivot rules. We draw interesting connections between our pivot rules and other well-known algorithms in combinatorial optimization.

This page was built for publication: On the Simplex method for 0/1 polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6384119)