- 19 Downloads
(1) Procedures that modify the constraints of a linear-programming problem so that all basic feasible solutions will be nondegenerate, thus removing the possibility of cycling in the simplex method. The modification can be either explicitly done by adding small quantities to the right-hand sides or implicitly by using lexicographic procedures. Cycling; Degeneracy; Lexicographic ordering.(2) Perturbation analysis; Score functions.