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

Date
1988-12
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract

Lagrangian 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.

Description
Advisor
Degree
Type
Technical report
Keywords
Citation

Boyd, E. Andrew. "The Lagrangian as a Primal Cutting Plane Method for Linear Integer Programming Problems." (1988) https://hdl.handle.net/1911/101651.

Has part(s)
Forms part of
Published Version
Rights
Link to license
Citable link to this page