Pages that link to "Item:Q5508058"
From MaRDI portal
The following pages link to Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems (Q5508058):
Displayed 26 items.
- Efficient model and heuristic for the intermodal terminal location problem (Q337109) (← links)
- A comparative study of redundant constraints identification methods in linear programming problems (Q624719) (← links)
- Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems (Q903045) (← links)
- Integrating categorical variables in data envelopment analysis models: a simple solution technique (Q1041013) (← links)
- General criteria for redundant and nonredundant linear inequalities (Q1076606) (← links)
- A constraint selection technique for a class of linear programs (Q1105487) (← links)
- A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary (Q1106721) (← links)
- Minimal representation of convex polyhedral sets (Q1158127) (← links)
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem (Q1245073) (← links)
- Interactive partitioning criteria set method for multiple objective linear programming (Q1260749) (← links)
- Selected bibliography on degeneracy (Q1312748) (← links)
- Degeneracy graphs: Theory and applications. An updated survey (Q1312751) (← links)
- Consistency, redundancy, and implied equalities in linear systems (Q1380438) (← links)
- Saturation in linear optimization (Q1411507) (← links)
- A constraint selection technique in limit analysis (Q1823877) (← links)
- An algorithm for determining redundant inequalities and all solutions to convex polyhedra (Q1846732) (← links)
- Safe feature elimination for non-negativity constrained convex optimization (Q2302836) (← links)
- Hit-and-run algorithms for the identification of nonredundant linear inequalities (Q3026740) (← links)
- OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations (Q3858015) (← links)
- Zur Identifikation redundanter Nebenbedingungen in linearen Programmen (Q4048846) (← links)
- Least distance methods for the scheme of polytopes (Q4192906) (← links)
- Redundancy in linear inequality system (Q4210734) (← links)
- (Q5149027) (← links)
- The pivot and probe algorithm for solving a linear program (Q5184665) (← links)
- Generalized theorems for permanent basic and nonbasic variables (Q5187070) (← links)
- Redundante Ungleichungen bei linearen Ungleichungssystemen (Q5640986) (← links)