
Welcome to CPLEX Interactive Optimizer 8.0.0
  with Simplex, Mixed Integer & Barrier Optimizers
Copyright (c) ILOG 1997-2002
CPLEX is a registered trademark of ILOG

Type 'help' for a list of available commands.
Type 'help' followed by a command name for more
information on commands.

CPLEX> Problem './tmp.solver.lp' read.
Read time =    0.00 sec.
CPLEX> Tried aggregator 1 time.
MIP Presolve eliminated 1 rows and 1 columns.
Reduced MIP has 2 rows, 2 columns, and 4 nonzeros.
Presolve time =    0.00 sec.
MIP emphasis: balance optimality and feasibility
Root relaxation solution time =    0.00 sec.

        Nodes                                         Cuts/
   Node  Left     Objective  IInf  Best Integer     Best Node    ItCnt     Gap

      0     0       60.0000     1                     60.0000        2         
*     0+    0                   0       58.0000       60.0000        2    3.45%
                 infeasible             58.0000      Cuts:  2        2    0.00%

Mixed integer rounding cuts applied:  1

Integer optimal solution:  Objective =    5.8000000000e+01
Solution time =    0.00 sec.  Iterations = 2  Nodes = 0

CPLEX> Constraint Name                  Slack Value
slack c2                            3.000000
slack c3                           12.000000
All other slacks in the range 1-3 are zero.
CPLEX> Variable Name           Solution Value
x1                            3.000000
x2                            5.000000
obj                           4.000000
CPLEX> 

