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: | Susana Muñoz |
---|---|
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 |
Similar Items
-
A two-phase linear programming approach for redundancy allocation problems
by: Hsieh Yi-Chih
Published: (2002-01-01) -
Constraints on neural redundancy
by: Jay A Hennig, et al.
Published: (2018-08-01) -
On a geometric programming problem with linear constraints
by: I. Maruşciac
Published: (1980-08-01) -
On a geometric programming problem with linear constraints
by: I. Maruşciac
Published: (1980-08-01) -
A simplex procedure for linear programs with some 0-1 integer constraints /
by: 206104 Chakravarty, A. K.
Published: (1980)