DocumentCode
3428396
Title
On solving structured integer programming problems with Lagrangean relaxation and/or decomposition
Author
Guignard, Monique
Author_Institution
Dept of Decision Sci., Pennsylvania Univ., Philadelphia, PA, USA
fYear
1989
fDate
13-15 Dec 1989
Firstpage
1136
Abstract
The use of Lagrangean relaxation and Lagrangean decomposition to obtain bounds for (mixed-) integer programming problems is treated. It is assumed that the constraint set contains at least one, and in the case of Lagrangean decomposition multiple, structured subsets of constraints. Conditions under which strong bounds can be obtained are reviewed, some applications are presented, and computational results for some of these problems are reported
Keywords
integer programming; Lagrangean decomposition; Lagrangean relaxation; structured integer programming; Costs; Lagrangian functions; Linear programming; Lot sizing;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 1989., Proceedings of the 28th IEEE Conference on
Conference_Location
Tampa, FL
Type
conf
DOI
10.1109/CDC.1989.70311
Filename
70311
Link To Document