\begin{verbatim} 
  MAX     3 X1 + 2 X2 + X3
  SUBJECT TO
         2)   4 X1 + 3 X2 + X3 <=   24
         3)   X1 + X2 + X3 <=   12
  END
 
 LP OPTIMUM FOUND AT STEP      2

        OBJECTIVE FUNCTION VALUE

        1)      20.00000    

  VARIABLE        VALUE          REDUCED COST
        X1         4.000000           .000000
        X2          .000000           .333333
        X3         8.000000           .000000


       ROW   SLACK OR SURPLUS     DUAL PRICES
        2)          .000000           .666667
        3)          .000000           .333333

 NO. ITERATIONS=       2

 RANGES IN WHICH THE BASIS IS UNCHANGED:
 
                           OBJ COEFFICIENT RANGES
 VARIABLE         CURRENT        ALLOWABLE        ALLOWABLE
                   COEF          INCREASE         DECREASE
       X1        3.000000         1.000000          .500000
       X2        2.000000          .333333         INFINITY 
       X3        1.000000         2.000000          .250000
 
                           RIGHTHAND SIDE RANGES
      ROW         CURRENT        ALLOWABLE        ALLOWABLE
                    RHS          INCREASE         DECREASE
        2       24.000000        24.000000        12.000000
        3       12.000000        12.000000         6.000000
 
\end{verbatim}
