Hi,
I am trying to solve the attached linear program using Gurobi.
Gurobi tells me it is unbounded while the problem should be (I think) infeasible.
I am using the C++ interface, but I get the same results with the command line tool.
Note that the first 4 lines of the .lp file are :
*************
Minimize
epigraph
Subject To
extra: epigraph >= -10000
************************************
Clearly the problem cannot be unbounded, either it is infeasible or it has an optimal value larger or equal to -10000.
(I only have this constraint there for debugging purposes, I suspect the model without this constraint is still infeasible and not unbounded.)
The way I run it from the command line is:
$ gurobi.sh
gurobi> m=read('withextra.lp')
gurobi> setParam('DualReductions',0)
gurobi> m.optimize()
I obtain the output:
Optimize a model with 85 rows, 13 columns and 305 nonzeros
Coefficient statistics:
Matrix range [5e-01, 4e+05]
Objective range [1e+00, 1e+00]
Bounds range [0e+00, 0e+00]
RHS range [2e-01, 4e+05]
Presolve time: 0.00s
Presolved: 13 rows, 85 columns, 305 nonzeros
Iteration Objective Primal Inf. Dual Inf. Time
0 -1.0000000e+03 0.000000e+00 3.798884e+06 0s
Solved in 6 iterations and 0.00 seconds
Unbounded model
Any help is appreciated.
Many Thanks,
Angelos