A comparative study of redundant constraints identification methods in linear programming problems.
S., Paulraj, P., Sumathi (2010)
Mathematical Problems in Engineering
Similarity:
S., Paulraj, P., Sumathi (2010)
Mathematical Problems in Engineering
Similarity:
John Sylva, Alejandro Crema (2008)
RAIRO - Operations Research
Similarity:
An algorithm for enumerating all nondominated vectors of multiple objective integer linear programs is presented. The method tests different regions where candidates can be found using an auxiliary binary problem for tracking the regions already explored. An experimental comparision with our previous efforts shows the method has relatively good time performance.
José Luis Quintero, Alejandro Crema (2009)
RAIRO - Operations Research
Similarity:
The multiparametric 0-1-Integer Programming (0-1-IP) problem relative to the objective function is a family of 0-1-IP problems which are related by having identical constraint matrix and right-hand-side vector. In this paper we present an algorithm to perform a complete multiparametric analysis relative to a generalized min max objective function such that the min sum and min max are particular cases.
Ritu Narang, S.R. Arora (2009)
The Yugoslav Journal of Operations Research
Similarity:
Yi-Chih Hsieh (2002)
The Yugoslav Journal of Operations Research
Similarity:
Dorota Kuchta (2007)
Control and Cybernetics
Similarity:
Miroslav Tůma (1991)
Kybernetika
Similarity:
José Luis Quintero, Alejandro Crema (2005)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The multiparametric min max 0-1-Integer Programming (0-1-IP) problem relative to the objective function is a family of min max 0-1-IP problems which are related by having identical constraint matrix and right-hand-side vector. In this paper we present an algorithm to perform a complete multiparametric analysis relative to the objective function.