CPLEX> mipopt Tried aggregator 1 time. MIP Presolve eliminated 16 rows and 0 columns. Reduced MIP has 51 rows, 861 columns, and 3751 nonzeros. Presolve time = 0.03 sec. Dual steepest-edge pricing selected. Maximum infeasibility variable selection. Objective is integral. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt 0 0 698.6000 19 698.6000 226 * 1 0 699.0000 0 699.0000 228 Integer optimal solution: Objective = 6.9900000000e+02 Solution time = 0.08 sec. Iterations = 228 Nodes = 1 CPLEX> di so va - Variable Name Solution Value x_2_1 1.000000 x_42_1 1.000000 x_3_2 1.000000 x_4_3 1.000000 x_5_4 1.000000 x_6_5 1.000000 x_7_6 1.000000 x_8_7 1.000000 x_9_8 1.000000 x_10_9 1.000000 x_11_10 1.000000 x_12_11 1.000000 x_13_12 1.000000 x_14_13 1.000000 x_15_14 1.000000 x_16_15 1.000000 x_17_16 1.000000 x_18_17 1.000000 x_19_18 1.000000 x_20_19 1.000000 x_21_20 1.000000 x_22_21 1.000000 x_23_22 1.000000 x_24_23 1.000000 x_25_24 1.000000 x_26_25 1.000000 x_27_26 1.000000 x_28_27 1.000000 x_29_28 1.000000 x_30_29 1.000000 x_31_30 1.000000 x_32_31 1.000000 x_33_32 1.000000 x_34_33 1.000000 x_35_34 1.000000 x_36_35 1.000000 x_37_36 1.000000 x_38_37 1.000000 x_39_38 1.000000 x_40_39 1.000000 x_41_40 1.000000 x_42_41 1.000000 All other variables in the range 1-861 are zero.