Abstract
The major practical consequence of the correspondence established in Theorems 8.4A/8.4B is that the cut generating linear program (CGLP)k need not be formulated and solved explicitly; instead, the procedure for solving it can be mimicked on the linear programming relaxation (LP) of the original mixed 0-1 problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
E. Balas and M. Perregaard, A Precise Correspondence Between Lift-and-Project Cuts, Simple Disjunctive Cuts, and Mixed Integer Gomory Cuts for 0-1 Programming. Mathematical Programming B, 94, 2003, 221–245.
R.E. Bixby, S. Ceria, C.M. McZeal, M.W.P. Savelsbergh, An updated Mixed Integer Programming Library: MIPLIB 3.0. http://www.caam.rice.edu/~bixby/miplib/miplib.html.
M. Perregaard, Generating disjunctive cuts for mixed integer programs. Ph.D. thesis, CMU, 2003.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Balas, E. (2018). Solving (CGLP)k on the LP Simplex Tableau. In: Disjunctive Programming. Springer, Cham. https://doi.org/10.1007/978-3-030-00148-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-00148-3_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00147-6
Online ISBN: 978-3-030-00148-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)