The Lagrangian as a Primal Cutting Plane Method for Linear Integer Programming Problems

Simple item page
dc.contributor.authorBoyd, E. Andrewen_US
dc.date.accessioned2018-06-18T17:28:18Zen_US
dc.date.available2018-06-18T17:28:18Zen_US
dc.date.issued1988-12en_US
dc.date.noteDecember 1988en_US
dc.description.abstractLagrangian relaxation and more recently cutting plane techniques have both proven to be powerful methods in the solution of integer problems. This paper explores the relationship between these techniques by interpreting Lagrangian relaxation as a primal cutting plane method. Properties of the cuts generated by the Lagrangian are discussed and practical ramifications of the interpretation are emphasized. Computational results are presented.en_US
dc.format.extent26 ppen_US
dc.identifier.citationBoyd, E. Andrew. "The Lagrangian as a Primal Cutting Plane Method for Linear Integer Programming Problems." (1988) <a href="https://hdl.handle.net/1911/101651">https://hdl.handle.net/1911/101651</a>.en_US
dc.identifier.digitalTR88-15en_US
dc.identifier.urihttps://hdl.handle.net/1911/101651en_US
dc.language.isoengen_US
dc.titleThe Lagrangian as a Primal Cutting Plane Method for Linear Integer Programming Problemsen_US
dc.typeTechnical reporten_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR88-15.pdf
Size:
202.31 KB
Format:
Adobe Portable Document Format
Download
Collections
CMOR Technical Reports