Lagrangean methods to linear integer programming problems

Lagrangean methods to linear integer programming problems

0.00 Avg rating0 Votes
Article ID: iaor19931533
Country: Brazil
Volume: 2
Issue: 2
Start Page Number: 127
End Page Number: 146
Publication Date: Dec 1991
Journal: Investigacin Operativa
Authors:
Keywords: lagrange multipliers
Abstract:

There exist many Lagrangean methods for solving linear integer problems from which one of the most used is the Lagrangean relaxation. This paper presents a survey of such methods. The different Lagrangean lower bounds are compared and it is attempted to show how a linear integer problem may be analysed in order to choose a good Lagrangean method.

Reviews

Required fields are marked *. Your email address will not be published.