OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations

DOI10.1007/BF01919484zbMath0423.90043OpenAlexW2032022831MaRDI QIDQ3858015

Jan Telgen

Publication date: 1979

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01919484

zbMATH Keywords

computational complexityinequalitieslinear programminglinear constraintsredundancycounterexamplesalgebraic rulessimplifications and reductions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Linear inequalities of matrices (15A39) Polytopes and polyhedra (52Bxx)

Related Items (9)

General criteria for redundant and nonredundant linear inequalities ⋮ Minimal representation of convex polyhedral sets ⋮ A Calculation of all Separating Hyperplanes of two Convex Polytopes ⋮ Formal optimization of some reduced linear programming problems ⋮ Constraint classification in mathematical programming ⋮ On a calculation of an arbitrary separating hyperplane of convex polyhedral sets ⋮ Generalized theorems for permanent basic and nonbasic variables ⋮ Randomly generated polytopes for testing mathematical programming algorithms ⋮ The Average number of pivot steps required by the Simplex-Method is polynomial

Cites Work

• Unnamed Item
• Linear multiobjective programming
• Zur Identifikation redundanter Nebenbedingungen in linearen Programmen
• Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
• Redundante Ungleichungen bei linearen Ungleichungssystemen

This page was built for publication: OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations