Example description

 H02BBF Example Program Results
 
 *** IP solver
 
 Parameters
 ----------
 
 Linear constraints......         3        First integer solution..       OFF
 Variables...............         2        Max depth of the tree...         4
 
 Feasibility tolerance...  1.05E-08        Print level.............        10
 Infinite bound size.....  1.00E+20        EPS (machine precision).  1.11E-16
 
 Integer feasibility tol.  1.00E-05        Iteration limit.........        50
 Max number of nodes.....      NONE
 
 ** Workspace provided with MAXDPT =     4: LRWORK =    84  LIWORK =   137
 ** Workspace required with MAXDPT =     4: LRWORK =    84  LIWORK =   137
 
 
   *** Optimum LP solution ***   -17.50000
 
 
 Varbl State     Value     Lower Bound   Upper Bound    Lagr Mult   Residual
 
 V  1    FR    3.92857       0.00000         None        0.000       3.929
 V  2    FR    1.42857       0.00000         None        0.000       1.429
 
 
 L Con State     Value     Lower Bound   Upper Bound    Lagr Mult   Residual
 
 L  1    UL    15.0000         None        15.0000      -1.000       0.000
 L  2    UL    5.00000         None        5.00000     -0.5000     -8.8818E-16
 L  3    FR    14.6429       5.00000         None        0.000       9.643
 
 
   *** Start of tree search ***
 
 
  Node  Parent   Obj       Varbl  Value      Lower      Upper      Value   Depth
   No    Node   Value      Chosen Before     Bound      Bound      After
    2     1   No Feas Soln    1    3.93       4.00       None       4.00       1
    3     1    -16.2          1    3.93       0.00       3.00       3.00       1
    4     3    -15.5          2    1.80       2.00       None       2.00       2
    5     3    -13.0          2    1.80       0.00       1.00       1.00       2
      *** Integer solution ***
 
 
  Node  Parent   Obj       Varbl  Value      Lower      Upper      Value   Depth
   No    Node   Value      Chosen Before     Bound      Bound      After
    6     4   No Feas Soln    1    2.50       3.00       3.00       3.00       3
    7     4    -14.8          1    2.50       0.00       2.00       2.00       3
    8     7    -12.0     CO   2    2.20       3.00       None       3.00       4
    9     7    -14.0          2    2.20       2.00       2.00       2.00       4
      *** Integer solution ***
 
     *** End of tree search ***
 
 
 Total of     9 nodes investigated.
 
 Exit IP solver - Optimum IP solution found.
 
 Final IP objective value =   -14.00000
 
 
 
 Varbl State     Value     Lower Bound   Upper Bound    Lagr Mult   Residual
 
 V  1    UL    2.00000       0.00000       2.00000      -3.000       0.000
 V  2    EQ    2.00000       2.00000       2.00000      -4.000       0.000
 
 
 L Con State     Value     Lower Bound   Upper Bound    Lagr Mult   Residual
 
 L  1    FR    14.0000         None        15.0000       0.000       1.000
 L  2    FR    0.00000         None        5.00000       0.000       5.000
 L  3    FR    10.0000       5.00000         None        0.000       5.000