Disjunctive Programming X: Solving the Cut-Generating LP on the Simplex TableauTextbook
Chapter 8 established an exact correspondence between lift-and-project cuts and simple disjunctive
cuts, but its practical payoff is what this chapter develops: the cut-generating LP (CGLP)_k
never needs to be formulated or solved on its own. Every pivot of (CGLP)_k can instead be
mimicked directly on the much smaller simplex tableau of the original LP…