Detecting infeasibility and fixing variables in 0–1 linear programming problems

Detecting infeasibility and fixing variables in 0–1 linear programming problems

0.00 Avg rating0 Votes
Article ID: iaor2003385
Country: Cuba
Volume: 23
Issue: 3
Start Page Number: 91
End Page Number: 103
Publication Date: Sep 2002
Journal: Revista de Investigacin Operacional
Authors:
Keywords: sets
Abstract:

In this paper we present a procedure for obtaining lower bounds on a linear function by means of certain families of packings, coverings and special ordered sets. We also present new methods for detecting infeasibility and fixing variables in 0–1 linear programming problems based on these bounds that allow consideration of several constraints jointly. Furthermore, we show some situations which are detected by these new methods, but not by the traditional methods, which consider the constraints individually.

Reviews

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