Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
From MaRDI portal
Publication:3042870
DOI10.1287/mnsc.29.10.1209zbMath0527.90066OpenAlexW2013925092MaRDI 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 algorithmsimplex methodcomputational experienceredundant constraintredundancy identificationimplicit equalitysystem of linear inequality constraints
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05)
Related Items (20)
The minimum sum representation as an index of voting power ⋮ Input optimization: I. Optimal realizations of mathematical models ⋮ Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution ⋮ Eliminating columns in the simplex method for linear programming ⋮ Consistency, redundancy, and implied equalities in linear systems ⋮ Minimum equivalent precedence relation systems ⋮ Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs ⋮ New techniques for linear arithmetic: cubes and equalities ⋮ A heuristic algorithm for resource allocation/reallocation problem ⋮ Wald, QLR, and score tests when parameters are subject to linear inequality constraints ⋮ A comparative study of redundant constraints identification methods in linear programming problems ⋮ Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming ⋮ Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints ⋮ Quadratically constrained convex quadratic programmes: Faculty feasible regions ⋮ An algorithm for set covering problem ⋮ Quantum extremal surfaces and the holographic entropy cone ⋮ On infeasibility of systems of convex analytic inequalities ⋮ Infeasibility analysis for systems of quadratic convex inequalities ⋮ On minimal generators for semi-closed polyhedra ⋮ A heuristic approach for identification of redundant constraints in linear programming models
This page was built for publication: Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
