Xuan Lin
- Total activity 34
- Last activity
- Member since
- Following 0 users
- Followed by 0 users
- Votes 3
- Subscriptions 6
Posts
Recent activity by Xuan Lin-
An empty callback function makes the solver unable to find any feasible solution
Awaiting user inputHi, I am trying to implement the Branch and Benders Cut algorithm using callback functions. My simplified code setup has: // master.cpp file// Initialize the master problem classMaster::Master(){ ...
-
Nodes in MIP logging
AnsweredHi, I have a question regarding the explored nodes after reading the MIP Logging. I will start with my understanding of Branch and Bound: Initialize an empty list of relaxed problems L=[]. Put root...
-
Problem with enlarging the model
AnsweredHi, I am solving MILP models and trying to scale them up. When I try a smaller model like below, Gurobi quickly goes to the branch and bound procedure which solves the model very fast. I record one...
-
Retrieve dual optimizers?
AnsweredHi, When I solve QP, is there a function to get the dual optimizers for the problem, that is, the optimal x for at slide 3 here http://www.seas.ucla.edu/~vandenbe/ee236b/lectures/duality.pdf? Note...
-
Fast constraint rhs modification
AnsweredHi, I am using gurobipy to repeatedly solve a model with changing constraints' right-hand side. Right now, I am doing: for i in range(number_of_constraints): model.getConstrByName(constraint_nam...
-
Convex combination of constraints that makes the problem infeasible
AnsweredHi,I am trying to solve a quadratic programming problem: min x^{T} Q xs.t.G_{1}(x) <= 0G_{2}(x) <= 0...G_{n}(x) <= 0 Specifically, if the problem is infeasible, I want to get a convex combination o...