Jaromił Najman
- Total activity1967
- Last activity
- Member since
- Following0 users
- Followed by0 users
- Votes5
- Subscriptions729
Activity overview
Latest activity by Jaromił Najman-
Jaromił Najmancommented,
It seems like you implemented only constraints (1) and (2) from In an integer program, how I can force a binary vairable to equal 1 if some condition holds. Note that you also need constraints (3)...
-
Jaromił Najmancommented,
Could you elaborate what exactly is wrong with this constraint? The code you wrote adds the constraint MaxInvest: StockWeight[0] + StockWeight[1] = MaxInvest
-
Jaromił Najmancommented,
知识库文章怎么用MIP开始? answers your question. Note that MIP starts also work for (non)convex (MI)QCQPs. Best regards, Jaromił
-
Jaromił Najmancommented,
Posting the whole code does not help in analyzing the issue. It is always best to provide a minimal working example and use one of Gurobi's native APIs instead of 3rd party software such as CVXPY. ...
-
Jaromił Najmancommented,
I created a Support Request out of you Community Post. We will discuss your setup in the ticket. Best regards, Jaromił
-
Jaromił Najmancommented,
mip.R is a good example to start with. The two inequalities would be constructed via model$A <- matrix(c(1,-1,-M,-1,1,M), nrow=2, ncol=3, byrow=T)model$rhs <- c(0.5,M+0.5)model$sense <- c(...
-
Jaromił Najmancommented,
You are using two quicksums in line 3. This line should either read 2*quicksum(quicksum(uvar[jbatch,kaisle] for jbatch in Batch) for kaisle in G) or 2*quicksum(uvar[jbatch,kaisle] for jbatch in Bat...
-
Jaromił Najmancommented,
What you observe is currently intended behavior. After adding additional objectives, the data structure gets manipulated in a way that it cannot reuse a previously computed solution. This is circum...
-
Jaromił Najmancommented,
The error about not iterable object occurs because the \(\texttt{i* ui[i] }\) is a LinExpr object which is not an iterable object such as a list for example. If you want to sum over all indices \(\...
-
Jaromił Najmancommented,
You could try the No Relaxation heuristic to find a feasible point before the root node relaxation. Turning off Cuts and Heuristics makes sense to get through the root node quicker. You could try ...