New criteria for the simplex algorithm

DOI10.1007/BF01581644zbMath0442.90053OpenAlexW2050016759MaRDI QIDQ3885511

No author found.

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

simplex algorithmcriteriabasic feasible solutionbasic variablebasic solutionfinite optimum valuenon- degenerate basic feasible solutionnon-basic variable

Mathematics Subject Classification ID

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

Related Items (5)

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

Cites Work

• Unnamed Item

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