Maliheh Aramon
- Total activity 327
- Last activity
- Member since
- Following 0 users
- Followed by 0 users
- Votes 0
- Subscriptions 137
Comments
Recent activity by Maliheh Aramon-
Hi Charitha, Given it is possible to process tasks in parallel in your model, one idea is to use a time-indexed formulation where the time is discretized and the binary decision variable \(x_{it}\)...
-
Hi Qianna, You can define the \(\texttt{x}\) variables as a tupledict by calling Model.addVars() and then call the method sum(). See the script below for an example of how to implement the first ei...
-
Hi Harun, Of course, you can use the log files in the \(\texttt{grblogtools}\) repo. You need to have a copy of the log files on your machine. If you are familiar with git, you can clone the rep...
-
Hi Joël, There is also a third approach that is much neater. You can simply query the attribute \(\texttt{X}\) on the MVar object \(\texttt{x}\) and this will give you a numpy array. # Approach 3x...
-
Hi Harun, You first need to install the grblogtools package as explained in the Installation section of the grblogtools github. You then need to run your models and save the results in log files ...
-
Hi Yiqi, You can first read the model files into Model() objects using the Global function read(). I am not sure what you exactly want to do. However, you might find the following methods relevant...
-
Hi Joël, Assuming \(\texttt{x}\) represents the matrix variables, you can use one of the approaches below to print the values of the MVar object in the current solution. x = m.addMVar(shape=(6,...
-
Hi Saina, The answer to your second question is yes, you can. Please see an implementation of your example using Python Matrix API below. Please check the documentations of MLinExpr() and MQuadExp...
-
Hi Saina, I don't see any change in the result with what I have given the algorithm. I am not sure what you are referring to? I do not see that you have provided the Gurobi Optimizer with any st...
-
Hi Alex, You cannot query the LP relaxation model solved at each node. However, given your explanation, I think you can do the following: Optimize your original MIP problem Get the continuous fixe...