Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems

DOI10.1287/MNSC.12.7.588zbMath0135.19904OpenAlexW2007134319MaRDI QIDQ5508058

Stanley Zionts, Fred M. Tonge, Gerald L. Thompson

Publication date: 1966

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.12.7.588

zbMATH Keywords

operations research

Related Items (26)

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 ⋮ Efficient model and heuristic for the intermodal terminal location problem ⋮ Consistency, redundancy, and implied equalities in linear systems ⋮ Redundante Ungleichungen bei linearen Ungleichungssystemen ⋮ A comparative study of redundant constraints identification methods in linear programming problems ⋮ Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems ⋮ Zur Identifikation redundanter Nebenbedingungen in linearen Programmen ⋮ Saturation in linear optimization ⋮ Minimal representation of convex polyhedral sets ⋮ Hit-and-run algorithms for the identification of nonredundant linear inequalities ⋮ The pivot and probe algorithm for solving a linear program ⋮ OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations ⋮ Generalized theorems for permanent basic and nonbasic variables ⋮ 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 ⋮ Safe feature elimination for non-negativity constrained convex optimization ⋮ Least distance methods for the scheme of polytopes ⋮ A constraint selection technique in limit analysis ⋮ Integrating categorical variables in data envelopment analysis models: a simple solution technique ⋮ Redundancy in linear inequality system ⋮ Unnamed Item ⋮ An algorithm for determining redundant inequalities and all solutions to convex polyhedra ⋮ Selected bibliography on degeneracy ⋮ Degeneracy graphs: Theory and applications. An updated survey

This page was built for publication: Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems