Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems - MaRDI portal

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

From MaRDI portal
Publication:5508058

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




Related Items

General criteria for redundant and nonredundant linear inequalitiesA constraint selection technique for a class of linear programsA degenerate extreme point strategy for the classification of linear constraints as redundant or necessaryEfficient model and heuristic for the intermodal terminal location problemConsistency, redundancy, and implied equalities in linear systemsRedundante Ungleichungen bei linearen UngleichungssystemenA comparative study of redundant constraints identification methods in linear programming problemsConstraint optimal selection techniques (COSTs) for nonnegative linear programming problemsZur Identifikation redundanter Nebenbedingungen in linearen ProgrammenSaturation in linear optimizationMinimal representation of convex polyhedral setsHit-and-run algorithms for the identification of nonredundant linear inequalitiesThe pivot and probe algorithm for solving a linear programOnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizationsGeneralized theorems for permanent basic and nonbasic variablesA general method for determining the set of all efficient solutions to a linear vectormaximum problemInteractive partitioning criteria set method for multiple objective linear programmingSafe feature elimination for non-negativity constrained convex optimizationLeast distance methods for the scheme of polytopesA constraint selection technique in limit analysisIntegrating categorical variables in data envelopment analysis models: a simple solution techniqueRedundancy in linear inequality systemUnnamed ItemAn algorithm for determining redundant inequalities and all solutions to convex polyhedraSelected bibliography on degeneracyDegeneracy graphs: Theory and applications. An updated survey