New criteria for the simplex algorithm

DOI10.1007/BF01581644MaRDI QIDQ3885511zbMATH OpenOpenAlexFDO

Authors

Publication date 1980

Published in Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

basic feasible solutionbasic solutionbasic variablecriteriafinite optimum valuenon- degenerate basic feasible solutionnon-basic variablesimplex algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cited in

(5)

• Eliminating columns in the simplex method for linear programming
• Degeneracy graphs: Theory and applications. An updated survey
• Admission control strategies for tandem Markovian loss systems
• Comment on a paper by M.C. Cheng
• Generalized theorems for permanent basic and nonbasic variables

This page was built for publication: New criteria for the simplex algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3885511)