lpx_read_cpxlp: 123 rows, 17 columns, 261 non-zeros lpx_read_cpxlp: 147 lines were read lpx_interior: original LP problem has 123 rows and 17 columns lpx_interior: transformed LP problem has 140 rows and 157 columns lpx_interior: A has 418 non-zeros lpx_interior: S has 2170 non-zeros (upper triangle) lpx_interior: minimal degree ordering... lpx_interior: computing Cholesky factorization... lpx_interior: U has 5794 non-zeros lpx_interior: guessing initial point... Optimization begins... 0: obj = -1.731631825e+00; rpi = 7.9e+00; rdi = 4.9e-01; gap = 6.3e-01 1: obj = -5.196580854e-01; rpi = 1.0e+00; rdi = 4.9e-02; gap = 1.0e+00 2: obj = -5.227116817e-01; rpi = 2.1e-01; rdi = 2.5e-02; gap = 6.1e-01 3: obj = -6.436771531e-01; rpi = 1.0e-01; rdi = 1.2e-02; gap = 4.2e-01 4: obj = -7.601544184e-01; rpi = 2.5e-02; rdi = 4.4e-03; gap = 2.1e-01 5: obj = -8.501360191e-01; rpi = 8.6e-03; rdi = 1.5e-03; gap = 9.8e-02 6: obj = -9.355881835e-01; rpi = 2.1e-03; rdi = 1.6e-04; gap = 2.4e-02 7: obj = -9.627362019e-01; rpi = 2.6e-04; rdi = 1.7e-05; gap = 2.8e-03 8: obj = -9.660661130e-01; rpi = 2.6e-05; rdi = 1.7e-06; gap = 2.8e-04 9: obj = -9.664003600e-01; rpi = 2.6e-06; rdi = 1.7e-07; gap = 2.8e-05 10: obj = -9.664337860e-01; rpi = 2.6e-07; rdi = 1.7e-08; gap = 2.8e-06 11: obj = -9.664371286e-01; rpi = 2.6e-08; rdi = 1.7e-09; gap = 2.8e-07 12: obj = -9.664374629e-01; rpi = 2.6e-09; rdi = 1.7e-10; gap = 2.8e-08 13: obj = -9.664374963e-01; rpi = 2.6e-10; rdi = 1.7e-11; gap = 2.8e-09 OPTIMAL SOLUTION FOUND prim_ipt_x1= 0.500000 prim_ipt_x2= 0.500000 prim_ipt_x3= 0.500000 prim_ipt_x4= 0.500000 prim_ipt_x5= 0.500000 prim_ipt_x6= 0.500000 prim_ipt_x7= 0.500000 prim_ipt_x8= 0.500000 prim_ipt_x9= 0.500000 prim_ipt_x10= 0.500000 prim_ipt_x11= 0.500000 prim_ipt_x12= 0.500000 prim_ipt_x13= 0.500000 prim_ipt_x14= 0.500000 prim_ipt_x15= 0.500000 prim_ipt_x16= 0.500000 prim_ipt_x17= 0.500000 The max. rel= 0.891965 with a bandwidth= 68.499999(prim) 0.000000(dual) Press Enter to continue!