Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
From MaRDI portal
Cited in
(27)- Integrating categorical variables in data envelopment analysis models: a simple solution technique
- General criteria for redundant and nonredundant linear inequalities
- A constraint selection technique for a class of linear programs
- A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
- Minimal representation of convex polyhedral sets
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Interactive partitioning criteria set method for multiple objective linear programming
- Selected bibliography on degeneracy
- Degeneracy graphs: Theory and applications. An updated survey
- Consistency, redundancy, and implied equalities in linear systems
- Saturation in linear optimization
- A constraint selection technique in limit analysis
- An algorithm for determining redundant inequalities and all solutions to convex polyhedra
- Safe feature elimination for non-negativity constrained convex optimization
- Hit-and-run algorithms for the identification of nonredundant linear inequalities
- Efficient model and heuristic for the intermodal terminal location problem
- OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations
- Zur Identifikation redundanter Nebenbedingungen in linearen Programmen
- Least distance methods for the scheme of polytopes
- Redundancy in linear inequality system
- Dual extrapolation for sparse GLMs
- The pivot and probe algorithm for solving a linear program
- Generalized theorems for permanent basic and nonbasic variables
- Redundante Ungleichungen bei linearen Ungleichungssystemen
- A comparative study of redundant constraints identification methods in linear programming problems
- An efficient solution methodology for the airport slot allocation problem with preprocessing and column-and-row generation
- Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems
This page was built for publication: Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5508058)
