Stability of the Solution to a Linear Programming Problem

Much effort has been devoted to finding the solution to the linear programming problem, although it is often the case in practice that some of the parameters are not known exactly. In this paper it is shown how, starting from the Simplex tableau, quantitative descriptions can be obtained without much further calculation of the way in which the elements aij (i = 1, 2,..., m; j = s) may vary without affecting the choice of optimal basis.