×

zbMATH — the first resource for mathematics

A note on the generality of the self-dual algorithm with various starting points. (English) Zbl 0561.90063
We show how the selection of various starting points for the self-dual simplex method for linear programming can reproduce seemingly different algorithms, sometimes referred to as ”variable dimension” or ”constraint- by-constraint” methods and their hybrids.

MSC:
90C05 Linear programming
65K05 Numerical mathematical programming methods
PDF BibTeX XML Cite