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

Simple item page
dc.contributor.authorBoyd, E. Andrew
dc.date.accessioned2018-06-18T17:28:18Z
dc.date.available2018-06-18T17:28:18Z
dc.date.issued1988-12
dc.date.noteDecember 1988
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.
dc.format.extent26 pp
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>.
dc.identifier.digitalTR88-15
dc.identifier.urihttps://hdl.handle.net/1911/101651
dc.language.isoeng
dc.titleThe Lagrangian as a Primal Cutting Plane Method for Linear Integer Programming Problems
dc.typeTechnical report
dc.type.dcmiText
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
CAAM Technical Reports