Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
From MaRDI portal
Publication:3042870
DOI10.1287/mnsc.29.10.1209zbMath0527.90066MaRDI QIDQ3042870
Publication date: 1983
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.29.10.1209
polynomial algorithm; simplex method; computational experience; redundant constraint; redundancy identification; implicit equality; system of linear inequality constraints
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
90C05: Linear programming
Related Items
Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming, A heuristic algorithm for resource allocation/reallocation problem, A comparative study of redundant constraints identification methods in linear programming problems, Eliminating columns in the simplex method for linear programming, Quadratically constrained convex quadratic programmes: Faculty feasible regions, On infeasibility of systems of convex analytic inequalities, Infeasibility analysis for systems of quadratic convex inequalities, Consistency, redundancy, and implied equalities in linear systems, An algorithm for set covering problem, A heuristic approach for identification of redundant constraints in linear programming models, Input optimization: I. Optimal realizations of mathematical models
