Finding duplicate rows in a linear programming model
From MaRDI portal
Publication:1090077
DOI10.1016/0167-6377(86)90093-3zbMath0621.65058OpenAlexW2027814833MaRDI QIDQ1090077
Publication date: 1986
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(86)90093-3
Related Items (14)
Geometry of optimal value functions with applications to redundancy in linear programming ⋮ Coefficient strengthening: a tool for reformulating mixed-integer programs ⋮ A constraint selection technique for a class of linear programs ⋮ Presolving in linear programming ⋮ A heuristic algorithm for resource allocation/reallocation problem ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Graph problems arising from parameter identification of discrete dynamical systems ⋮ Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints ⋮ A note on detecting simple redundancies in linear systems ⋮ A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space ⋮ Equivalences between data envelopment analysis and the theory of redundancy in linear systems ⋮ A constraint selection technique in limit analysis ⋮ A heuristic approach for identification of redundant constraints in linear programming models ⋮ MOPS -- Mathematical optimization system
Cites Work
This page was built for publication: Finding duplicate rows in a linear programming model
