Problem: transp Rows: 6 Columns: 6 Non-zeros: 18 Status: OPTIMAL Explanation: This file presents amounts by which objective coefficients, constraint bounds, and variable bounds may be changed in the original problem while the optimal basis remains the same. Note that the optimal solution and objective value may change even though the basis remains the same. These bounds assume that all parameters remain fixed except the one in question. If more than one parameter is changed, it is possible for the optimal basis to change even though each parameter stays within its bounds. For more details, consult a text on linear programming. Objective Coefficient Analysis No. Column name St Value Max increase Max decrease ------ ------------ -- ------------- ------------- ------------- 1 x[Seattle,New-York] B 0.225 0.036 0.009 2 x[Seattle,Chicago] B 0.153 0.009 0.153 3 x[Seattle,Topeka] NL 0.162 infinity 0.036 4 x[San-Diego,New-York] B 0.225 0.009 0.036 5 x[San-Diego,Chicago] NL 0.162 infinity 0.009 6 x[San-Diego,Topeka] B 0.126 0.036 0.126 Constraint Bounds Analysis No. Row name St Value Max increase Max decrease ------ ------------ -- ------------- ------------- ------------- 1 cost B 2 supply[Seattle] B UPPER 350 infinity 50 3 supply[San-Diego] NU UPPER 600 0 50 4 demand[New-York] NL LOWER 325 50 0 5 demand[Chicago] NL LOWER 300 50 300 6 demand[Topeka] NL LOWER 275 50 0 Variable Bounds Analysis No. Column name St Value Max increase Max decrease ------ ------------ -- ------------- ------------- ------------- 1 x[Seattle,New-York] B LOWER 0 0 infinity 2 x[Seattle,Chicago] B LOWER 0 300 infinity 3 x[Seattle,Topeka] NL LOWER 0 0 325 4 x[San-Diego,New-York] B LOWER 0 325 infinity 5 x[San-Diego,Chicago] NL LOWER 0 300 0 6 x[San-Diego,Topeka] B LOWER 0 275 infinity End of output