A comparative study of redundant constraints identification methods in linear programming problems.
S., Paulraj, P., Sumathi (2010)
Mathematical Problems in Engineering
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Airspace sectorization with constraints”
A comparative study of redundant constraints identification methods in linear programming problems.
How to treat decision problems by different programming methodologies
G. Cioni, A. Miola (1988)
Banach Center Publications
Similarity:
Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming.
Ram, Balasubramanian, Babu, A.J.G. (1988)
International Journal of Mathematics and Mathematical Sciences
Similarity:
An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function
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.