Skip to main content

Very Long Processing Time for Gurobi Simulation

Answered

Comments

4 comments

  • David Torres Sanchez
    Gurobi Staff Gurobi Staff

    Can you try using Gurobi 11.0.0 (the latest release)?

    Cheers, 
    David

    1
  • Muhammad Haris
    Gurobi-versary
    First Question
    First Comment

    Thank you David, I just pulled the update and new license! 

    Here's the result I got, (I added feasibility tolerance to bare minimum as well) : 

    Set parameter TimeLimit to value 1000
    Set parameter FeasibilityTol to value 0.01
    Set parameter NonConvex to value 2
    Gurobi Optimizer version 11.0.0 build v11.0.0rc2 (win64 - Windows 10.0 (19045.2))

    CPU model: 11th Gen Intel(R) Core(TM) i5-1135G7 @ 2.40GHz, instruction set [SSE2|AVX|AVX2|AVX512]
    Thread count: 4 physical cores, 8 logical processors, using up to 8 threads

    Optimize a model with 57226 rows, 2095090 columns and 84051 nonzeros
    Model fingerprint: 0xd7cbbdd9
    Model has 1922 quadratic objective terms
    Model has 8908 quadratic constraints
    Model has 31 general constraints
    Variable types: 2095090 continuous, 0 integer (0 binary)
    Coefficient statistics:
      Matrix range     [2e-02, 6e+01]
      QMatrix range    [3e-04, 1e+02]
      QLMatrix range   [1e+00, 1e+00]
      Objective range  [1e+00, 1e+09]
      QObjective range [4e-02, 4e-01]
      Bounds range     [1e+03, 5e+03]
      RHS range        [3e-03, 1e+03]
      QRHS range       [1e+00, 1e+00]
    Presolve removed 48316 rows and 2074701 columns
    Presolve time: 0.20s
    Presolved: 68802 rows, 28974 columns, 166303 nonzeros
    Presolved model has 1770 quadratic objective terms
    Presolved model has 13534 bilinear constraint(s)
    Warning: Model contains variables with very large bounds participating
             in product terms.
             Presolve was not able to compute smaller bounds for these variables.
             Consider bounding these variables or reformulating the model.


    Solving non-convex MIQCP

    Variable types: 28974 continuous, 0 integer (0 binary)

    Root simplex log...

    Iteration    Objective       Primal Inf.    Dual Inf.      Time
       16143    6.5447843e+03   9.490257e+01   0.000000e+00      5s
       32185    1.5302265e+05   5.807236e+01   0.000000e+00     10s
       45563    4.9409851e+03   0.000000e+00   1.322601e+01     15s
       53269    4.9410334e+03   0.000000e+00   0.000000e+00     18s

    Root relaxation: objective 4.941033e+03, 53269 iterations, 13.98 seconds (10.62 work units)

        Nodes    |    Current Node    |     Objective Bounds      |     Work    
     Expl Unexpl |  Obj  Depth IntInf | Incumbent    BestBd   Gap | It/Node Time

         0     0 4941.03340    0 3388          - 4941.03340      -     -   17s
         0     0 4941.03340    0 3332          - 4941.03340      -     -   18s
         0     0 4941.03340    0 3280          - 4941.03340      -     -   20s
         0     0 4941.03340    0 3280          - 4941.03340      -     -   20s
         0     0 4941.03340    0 3280          - 4941.03340      -     -   20s
         0     0 4941.03340    0 3280          - 4941.03340      -     -   20s
         0     0 4941.03340    0 3280          - 4941.03340      -     -   21s
         0     2 4941.03340    0 3280          - 4941.03340      -     -  559s
         1     5 4941.03340    1 3280          - 4941.03340      -   6.0  605s
         3     8 4941.03340    2 3280          - 4941.03340      -  35.7  805s
         7    12 4941.03340    3 3280          - 4941.03340      - 18820  857s
        11    16 4941.03340    4 3279          - 4941.03340      - 12421  897s
        15    20 4941.03340    4 3279          - 4941.03340      -  9120  916s
        19    24 4941.03340    5 3276          - 4941.03340      -  7207  945s
        23    28 4941.03340    5 3278          - 4941.03340      -  5967  965s
        27    32 4941.03340    6 3277          - 4941.03340      -  5089  985s
        31    36 4941.03340    6 3276          - 4941.03340      -  4443 1000s

    Cutting planes:
      RLT: 2090

    Explored 35 nodes (197142 simplex iterations) in 1000.06 seconds (501.66 work units)
    Thread count was 8 (of 8 available processors)

    Solution count 0

    Time limit reached
    Best objective -, best bound 4.941033396743e+03, gap -
    0
  • Muhammad Haris
    Gurobi-versary
    First Question
    First Comment

    Please let me know what do you suggest further?

    0
  • David Torres Sanchez
    Gurobi Staff Gurobi Staff

    Looks like a tough model!
    You can also try some of our heuristics, such as:

    They might help obtain feasible solutions.
    If none of these help you might want to try:

    Cheers, 
    David

    1

Please sign in to leave a comment.