As I said without immersing into your model, problem, and data (which I don't have the time to do) there is nothing I can do. You are best suited to solve this problem. Good luck.
-Michael
Search found 1042 matches
- 4 years ago
- Forum: Modeling
- Topic: VAR operands relational or boolean
- Replies: 11
- Views: 6683
- 4 years ago
- Forum: Modeling
- Topic: Summing differing elements of a binary variable
- Replies: 2
- Views: 1986
Re: Summing differing elements of a binary variable
You probably need another binary variable just indexed by j, say z(j) and you need to force z(j) to go to one if a y(i,j,k,l) goes to one, e.g. e1(i,k,l).. z(j) =g= y(i,j,k,l); Now you just limit the z's by e2.. sum(j, z(j)) =l= 2;
-Michael
-Michael
- 4 years ago
- Forum: Modeling
- Topic: ABORTED, NO INTEGER SOLUTION
- Replies: 1
- Views: 1661
Re: ABORTED, NO INTEGER SOLUTION
The log before this line probably gives you some idea why Cplex aborted your run. Perhaps you/Cplex ran out of memory?
-Michael
-Michael
- 4 years ago
- Forum: Modeling
- Topic: Resource-contrained CPM
- Replies: 3
- Views: 2239
Re: Resource-contrained CPM
There are a couple and compilation errors and equation op makes no sense whatsoever because it does not contain any variable. Try to make a better case.
-Michael
-Michael
- 4 years ago
- Forum: Modeling
- Topic: VAR operands relational or boolean
- Replies: 11
- Views: 6683
Re: VAR operands relational or boolean
Dealing with infeasibilities is not easy but requires insight into the details of your model and the data, so without diving into your model I/we can only provide you help to help yourself: The McCarl newletter vol. 40 gives good recommendations on how to deal with infeasible models (see section 3 o...
- 4 years ago
- Forum: Syntax
- Topic: Simulation
- Replies: 3
- Views: 2328
- 4 years ago
- Forum: Modeling
- Topic: OPTIMALITY GAP VALUE
- Replies: 1
- Views: 1672
Re: OPTIMALITY GAP VALUE
The solver log shows the gap. Depending on the solver you find this in different places but I don't know of a MIP solver that doesn't show the gap. Here is the Cplex log: Nodes Cuts/ Node Left Objective IInf Best Integer Best Bound ItCnt Gap * 0+ 0 180825.6000 180157.6059 0.37% Found incumbent of va...
- 4 years ago
- Forum: Syntax
- Topic: Simulation
- Replies: 3
- Views: 2328
Re: Simulation
In order to exercise/execute an equation (to calculate total ) you need to solve a model with a solve statement. So an equation is not like an F9 button, i.e as soon as you change the values it recalculated other values. You need to trigger this action by a solve of a model. I suggest you study the ...
- 4 years ago
- Forum: Modeling
- Topic: Defining a SOS1-Variable as binary, where not all Sets must contain a non-Zero Value
- Replies: 4
- Views: 2950
Re: Defining a SOS1-Variable as binary, where not all Sets must contain a non-Zero Value
You could reduce the number of binaries and do SOS1 Variable x(i,l) SOS1-Variable consisting of 10 sets whith 50 elements each; Binary Variable y(i); Equation defx(i), defy; defx(i).. sum(l, x(i,l)) =e= 0 + y(i) ; defy.. sum(i, y(i)) =e= 5; You can even mimic binary variables with SOS1 constraints i...
- 4 years ago
- Forum: Modeling
- Topic: VAR operands relational or boolean
- Replies: 11
- Views: 6683
Re: VAR operands relational or boolean
I don't think that you logic is correct also you if logic looks flawed, but I guess you mean if(DU(t)-(DIP(t)- DIN(t))-CU(t))>=0, DD(t)=DU(t)-(DIP(t)- DIN(t))-CU(t); else DD(t)=0; ) or easier DD(T) = max(0,DU(t)-(DIP(t)- DIN(t))-CU(t)). I would do it like this: set s /slack1, slack2/; SOS1 variable ...