Ronald van der Velden
-
Gurobi Staff
- 合計アクティビティ 244
- 前回のアクティビティ
- メンバー登録日
- フォロー 0ユーザー
- フォロワー 0ユーザー
- 投票 1
- サブスクリプション 119
コメント
Ronald van der Veldenによる最近のアクティビティ-
Hi Carlos, What if you would introduce a variable to represent the magnitude of the reset \(r_t\) ; then you constraint becomes \(p_t=p_{t-1} + w_t * C - r_t\). You could then add indicator constr...
-
Hi Summer, You could try \(Y \leq M \cdot X\), where \(M\) is a number that is at least as large as the upperbound of \(Y\). Ideally you keep \(M\) as tight as possible to avoid running into numeri...
-
Hi Alexandra, We optimize highest priority first, so that's why Z3 is solved first in your case. When you iterate over range(3) to retrieve the objective values, you'll always get the same objecti...
-
Hi Carl, Unfortunately I can't help you debug this step-by-step. I don't believe the error you see is optimization-specific: you should be able to add breakpoints to your code and inspect variable ...
-
The inner quicksum seems incorrect - you reference d which is not defined anywhere. Then you take the max over just a single quicksum. You need multiple things to take the maximum; I guess you wil...
-
Please have a look at (the end of) this question about the same problem.
-
Ah, sorry about that - I should have tested your exact scenario in full and had ignored the fact that calling relax() returns a new model where you cannot query attributes based on constraints from...
-
I would consider using addConstrs() for each of the constraint sets. It gives you back a dictionary, e.g. a mapping of i/j/d indices to constraints. Then you can pass that result to getAttr() and y...
-
Have you tried it step-by-step and where did you get stuck exactly? I would start creating a variable containing the value of the inner sum. Then try to create the max and finally the outer sum.
-
For completeness: I believe if you stayed with your existing approach, you would need to model the second constraint as y(p, t) * e(L1) <= t to make it work. Whenever y(p,t)=0 the constraint become...