LP-solution
-----------

CPLEX> opt

Primal - Optimal:  Objective =    4.7859375000e+04
Solution time =    0.00 sec.  Iterations = 0 (0)

CPLEX> dis sol var -
Variable Name           Solution Value
x1                           14.062500
x3                           15.937500
All other variables in the range 1-3 are zero.
CPLEX> dis sol dua -
Constraint Name             Dual Price
c1                            0.059375
c2                          110.937500
All other dual prices in the range 1-3 are zero.


IP-solution
-----------

CPLEX> opt
Tried aggregator 1 time.
No MIP presolve or aggregator reductions.
Presolve time =    0.00 sec.
Pseudo-cost variable selection.
Objective is integral.

Using root rounding heuristic, 3 variables fixed:

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

*     0+    0    47800.0000     0    47800.0000                      3

Done with root rounding heuristic.

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

      0     0    47859.3750     2    47800.0000    47859.3750        3

Integer optimal solution:  Objective =    4.7800000000e+04
Solution time =    0.00 sec.  Iterations = 3  Nodes = 0

CPLEX> dis sol var -
Variable Name           Solution Value
x1                           14.000000
x3                           16.000000
All other variables in the range 1-3 are zero.