Generalized theorems for permanent basic and nonbasic variables
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1971074
- Determining basic variables of optimal solutions in Karmarkar's new LP algorithm
- scientific article; zbMATH DE number 3883944
- An optimal-basis identification technique for interior-point linear programming algorithms
- Recovering Optimal Basic Variables in Karmarkar's Polynomial Algorithm for Linear Programming
Cites work
- scientific article; zbMATH DE number 3709925 (Why is no real title available?)
- scientific article; zbMATH DE number 3744912 (Why is no real title available?)
- Comment on a paper by M.C. Cheng
- New criteria for the simplex algorithm
- OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations
- Redundancy in mathematical programming. A state-of-the-art survey
- Redundante Ungleichungen bei linearen Ungleichungssystemen
- Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
Cited in
(6)- Determining basic variables of optimal solutions in Karmarkar's new LP algorithm
- Eliminating columns in the simplex method for linear programming
- scientific article; zbMATH DE number 7264173 (Why is no real title available?)
- Computational efficiency and interactive MOLP algorithms: An implementation of the SIMOLP procedure
- scientific article; zbMATH DE number 1971074 (Why is no real title available?)
- Admission control strategies for tandem Markovian loss systems
This page was built for publication: Generalized theorems for permanent basic and nonbasic variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5187070)
