FICO Xpress-Optimizer 64-bit v29.01.10 (Hyper capacity)
(c) Copyright Fair Isaac Corporation 1983-2016. All rights reserved
Using Xpress-Optimizer [/Users/dkrishna/opt/xpressmp/lib/libxprs.dylib]
Reading Problem /tmpgRr1VC.pyomo
Problem Statistics
106 ( 0 spare) rows
87 ( 0 spare) structural columns
239 ( 0 spare) non-zero elements
Global Statistics
5 entities 0 sets 0 set members
Minimizing MILP /tmpgRr1VC.pyomo
Original problem has:
106 rows 87 cols 239 elements 5 globals
Presolved problem has:
16 rows 31 cols 61 elements 5 globals
Will try to keep branch and bound tree memory usage below 5.5Gb
Starting concurrent solve with dual
Concurrent-Solve, 0s
Dual
objective dual inf
D 20013.800 .0000000
------- optimal --------
Concurrent statistics:
Dual: 13 simplex iterations, 0.00s
Optimal solution found
Its Obj Value S Ninf Nneg Sum Dual Inf Time
13 20013.80036 D 0 0 .000000 0
Dual solved problem
13 simplex iterations in 0s
Final objective : 2.001380036213346e+04
Max primal violation (abs / rel) : 2.274e-13 / 2.274e-13
Max dual violation (abs / rel) : 0.0 / 0.0
Max complementarity viol. (abs / rel) : 0.0 / 0.0
All values within tolerances
Starting root cutting & heuristics
Its Type BestSoln BestBound Sols Add Del Gap GInf Time
k 22255.36973 20013.80036 1 10.07% 0 0
*** Search completed *** Time: 0 Nodes: 1
Number of integer feasible solutions found is 1
Best integer solution found is 22255.36973
Best bound is 22255.36973
Uncrunching matrix