Detecting constraint redundancy in 0-1 linear programming problems
Shranjeno v:
Avtor: | |
---|---|
Format: | artículo original |
Status: | Versión publicada |
Fecha de Publicación: | 2001 |
Opis: | 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. |
País: | Portal de Revistas UCR |
Institucija: | Universidad de Costa Rica |
Repositorio: | Portal de Revistas UCR |
Jezik: | Español |
OAI Identifier: | oai:portal.ucr.ac.cr:article/193 |
Online dostop: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/193 |
Ključna beseda: | Redundant constraints packings coverings special ordered sets admissible families Restricciones redundantes empaquetamientos recubrimientos conjuntos ordenados especiales familias admisibles |