MAX     X46 + X56
  SUBJECT TO
         2)   X01 <=   3
         3)   X02 <=   2
         4)   X03 <=   4
         5)   X12 <=   1
         6)   X14 <=   4
         7)   X25 <=   1
         8)   X35 <=   4
         9)   X46 <=   4
        10)   X56 <=   5
        11)   X01 - X12 - X14 =    0
        12)   X02 + X12 - X25 =    0
        13)   X03 - X35 =    0
        14) - X46 + X14 =    0
        15) - X56 + X25 + X35 =    0
  END

 LP OPTIMUM FOUND AT STEP      4

        OBJECTIVE FUNCTION VALUE

        1)      8.000000

  VARIABLE        VALUE          REDUCED COST
       X46         3.000000          0.000000
       X56         5.000000          0.000000
       X01         3.000000          0.000000
       X02         1.000000          0.000000
       X03         4.000000          0.000000
       X12         0.000000          1.000000  //increase X12 by 1 decreases Z by 1
       X14         3.000000          0.000000    (1 less unit can go from 1 to 4)
       X25         1.000000          0.000000
       X35         4.000000          0.000000


       ROW   SLACK OR SURPLUS     DUAL PRICES
        2)         0.000000          1.000000  //increase X01 by 1 adds 1 to Z
        3)         1.000000          0.000000
        4)         0.000000          0.000000
        5)         1.000000          0.000000
        6)         1.000000          0.000000
        7)         0.000000          0.000000
        8)         0.000000          0.000000
        9)         1.000000          0.000000
       10)         0.000000          1.000000  //increase upper bound on X56 increases Z  
       11)         0.000000         -1.000000  //increase rhs decreases X14
       12)         0.000000          0.000000
       13)         0.000000          0.000000
       14)         0.000000         -1.000000  //increase rhs decreases X46
       15)         0.000000          0.000000

 NO. ITERATIONS=       4