Solving (CGLP)k on the LP Simplex Tableau

Egon Balas

Chapter Chapter 9 in Disjunctive Programming, 2018, pp 107-119 from Springer

Abstract: 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.

Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-00148-3_9

Ordering information: This item can be ordered from
http://www.springer.com/9783030001483

DOI: 10.1007/978-3-030-00148-3_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().