Either infeasible or unbounded (GUROBI-GUROBI)

[Longxi Li]

Hi, everyone

There is something wrong about my code. I donot understand why the bounds range is [1e+00, 1e+00].  

Whether the reason of "Either infeasible or unbounded (GUROBI-GUROBI)" is the "Bounds range    [1e+00, 1e+00]"?

Is it mean that the constraints have a problem? 

Optimize a model with 56074 rows, 13885 columns and 119940 nonzeros

Coefficient statistics:

  Matrix range    [1e-05, 3e+04]

  Objective range [6e-03, 6e+05]

  Bounds range    [1e+00, 1e+00]

  RHS range       [1e-05, 2e+04]

Presolve removed 52699 rows and 11345 columns

Presolve time: 0.47s

Presolved: 3375 rows, 2540 columns, 10710 nonzeros

Variable types: 2220 continuous, 320 integer (165 binary)

Root relaxation: infeasible, 167 iterations, 0.03 seconds

    Nodes    |    Current Node    |     Objective Bounds      |     Work

 Expl Unexpl |  Obj  Depth IntInf | Incumbent    BestBd   Gap | It/Node Time

     0     0 infeasible    0               - infeasible      -     -    0s

Explored 0 nodes (167 simplex iterations) in 0.75 seconds

Thread count was 4 (of 4 available processors)

Model is infeasible or unbounded

Best objective -, best bound -, gap -

Hmm, something went wrong!

ans =

Either infeasible or unbounded (GUROBI-GUROBI)

ans =

Either infeasible or unbounded 

Elapsed time is 238.936039 seconds.

[Johan Löfberg]

First you should figure out if it is infeasible or unbounded. Solve the problem without an objective to see this