Skip to main content

Logarithmic Transformation

Answered

Comments

1 comment

  • David Torres Sanchez
    Gurobi Staff Gurobi Staff

    Hi Florencia,

    I just ran your code, if I compute the IIS and write this to a file:

    m.computeIIS()
    m.write("avocado.ilp")

    I get the following:

    Maximize

    Subject To
     R0: x[Great_Lakes] + x[Midsouth] + x[Northeast] + x[Northern_New_England]
       + x[SouthCentral] + x[Southeast] + x[West] + x[Plains] = 35
    Bounds
     -infinity <= x[Great_Lakes] <= 2.091217523087725
     -infinity <= x[Midsouth] <= 1.969706417191851
     -infinity <= x[Northeast] <= 2.286090422809815
     -infinity <= x[Northern_New_England] <= 0.6512746083344716
     -infinity <= x[SouthCentral] <= 2.426851474271583
     -infinity <= x[Southeast] <= 2.175941311368734
     -infinity <= x[West] <= 2.507544234367833
     -infinity <= x[Plains] <= 1.520715809714555
    End

    So your supply constraint can no longer be met \(\texttt{B}=35\).

    You can change this constraint to \(\leq\) or recompute a valid supply value (of course, this must be lower than the sum of the upper bounds of the \(\texttt{x}\) variables).

    Cheers, 
    David

    0

Please sign in to leave a comment.