A note on the continuity of solutions of parametric linear programs
The article deals with a linear one-parametric programming problem with one parameter only on the right-hand side of the constraints. The authors show that the set of all optimal solutions of this problem (if it contains more than one optimal point) represents a continuous point-to- set mapping. Further an algorithm is introduced to solve this problem, which is based on the dual simplex method with Bland's anticycling condition. The results of this article are known since long.
scientific article; zbMATH DE number 4156225