On some Aspects of the Matrix Data Perturbation in Linear Program
Margita Kon-Popovska (2003)
The Yugoslav Journal of Operations Research
Similarity:
Margita Kon-Popovska (2003)
The Yugoslav Journal of Operations Research
Similarity:
José Luis Quintero, Alejandro Crema (2006)
RAIRO - Operations Research
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.
G. Cioni, A. Miola (1988)
Banach Center Publications
Similarity:
Shyam S. Chadha (1988)
Trabajos de Investigación Operativa
Similarity:
Duality of linear programming is used to establish an important duality theorem for a class of non-linear programming problems. Primal problem has quasimonotonic objective function and a convex polyhedron as its constraint set.
(2017)
Kybernetika
Similarity:
A. Nowak (1977)
Colloquium Mathematicae
Similarity:
Nelson Maculan, Marcos de Mendonça Passini, José André de Moura Brito, Irene Loiseau (2010)
RAIRO - Operations Research
Similarity:
We present an exact method for integer linear programming problems that combines branch and bound with column generation at each node of the search tree. For the case of models involving binary column vectors only, we propose the use of so-called geometrical cuts to be added to the subproblem in order to eliminate previously generated columns. This scheme could be applied to general integer problems without specific structure. We report computational results on a successful application...