ABSTRACT
For a particular linear programming problem, sensitivity analysis can obviously provide answers to questions of immense practical importance. This chapter discusses mathematical methods by which each of the questions (i)-(v) can be answered solely by reference to the original problem and to its optimal solution tableau. The problem formulation is as in; some combination of seventeen foods is to fulfill twelve dietary requirements at least cost. In order to demonstrate the methods appropriate to dealing with a non-basis variable, reconsider the revised housebuilder problem where the coefficient of X2 in the first constraint has altered by some amount Δ13. Reconsider the formulation of the original housebuilder problem – and of the revised house-builder problem. In the revised problem, an additional activity has been incorporated. Possible greater speed in obtaining the optimal solution to a particular linear programming problem represents just one reason as to why the dual is of interest.
