Generalized theorems for permanent basic and nonbasic variables

DOI10.1007/BF02591751zbMath0561.90062OpenAlexW2052687392MaRDI QIDQ5187070

No author found.

Publication date: 1985

Published in: Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

optimal basic solutionknown finite optimum valuepermanent basic and non-basic variables

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (3)

Eliminating columns in the simplex method for linear programming ⋮ Admission control strategies for tandem Markovian loss systems ⋮ Computational efficiency and interactive MOLP algorithms: An implementation of the SIMOLP procedure

Cites Work

• Unnamed Item
• Unnamed Item
• Redundancy in mathematical programming. A state-of-the-art survey
• OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations
• New criteria for the simplex algorithm
• Comment on a paper by M.C. Cheng
• Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
• Redundante Ungleichungen bei linearen Ungleichungssystemen

This page was built for publication: Generalized theorems for permanent basic and nonbasic variables