Detecting constraint redundancy in 0-1 linear programming problems
In this paper we present a procedure for obtaining upper bounds on a linear function by means of certain families of packings, coverings and special ordered sets. We also present a new method for detecting redundant constraints in 0-1 linear programming problems based on these bounds that allows con...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universidad de Costa Rica
2009-02-01
|
| Series: | Revista de Matemática: Teoría y Aplicaciones |
| Online Access: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/193 |
| Summary: | In this paper we present a procedure for obtaining upper bounds on a linear function by means of certain families of packings, coverings and special ordered sets. We also present a new method for detecting redundant constraints in 0-1 linear programming problems based on these bounds that allows consideration of several constraints jointly. Furthermore, we show a redundancy situation which is detected by this new method, but not by the traditional methods, which consider the constraints individually.
Keywords: Redundant constraints, packings, coverings, special ordered sets, admissible families |
|---|---|
| ISSN: | 2215-3373 |