Xuan Lin
- 合計アクティビティ 42
- 前回のアクティビティ
- メンバー登録日
- フォロー 0ユーザー
- フォロワー 0ユーザー
- 投票 4
- サブスクリプション 8
アクティビティの概要
Xuan Linさんの最近のアクティビティ-
Xuan Linさんがコメントを作成しました:
Hi,Thanks! I have another baseline model that is equivalent, but with looser convex relaxations and about 2x more constraints. The solving speed is usually slower. For this case, I got memory usage...
-
Xuan Linさんがコメントを作成しました:
Hi Riley,Yes, running gurobi_cl point_mass_04_lnf.mps works ok and generate the logfile correctly.I figured that if I run:psrecord "gurobi_cl point_mass_04_lnf.mps" --include-children --log activit...
-
Xuan Linさんがコメントを作成しました:
Hi,Thanks for the reply! I tried to run either:psrecord "gurobi_cl point_mass_04_lnf.mps" --log activity.txt --plot memory_usage.png --interval 1or:psrecord "python3 run_model.py" --log activity.tx...
-
Xuan Linさんが投稿を作成しました:
Comparing memory usage between different model formulations
回答済みHi,I have two equivalent optimization models with different formulations that result in different numbers of variables and constraints. I want to compare their memory usage to demonstrate that one ...
-
Xuan Linさんが投稿を作成しました:
Help with installing gurobipy 12.0.2
回答済みHi,I'm trying to use Gurobi 12.0.2 with gurobipy, but I have encounter some conflicting information. When I try to install with:~/Desktop/gurobi1200/linux64$ pip install -e.I got error:Obtaining fi...
-
Xuan Linさんがコメントを作成しました:
Hi Jaromił, Thank you for the explanation! I have a follow-up question regarding this issue. Are the techniques disabled by activating LazyConstraints inherently incompatible with lazy constraints,...
-
Xuan Linさんが投稿を作成しました:
An empty callback function makes the solver unable to find any feasible solution
ユーザーの入力を待っています。Hi, 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(){ ...
-
Xuan Linさんがコメントを作成しました:
Hi Riley, Thanks for the answer! I personally haven't used any GPU-based QP solver. I have heard about some research to accelerate QP solvers using GPUs, for example, this one. I think ADMM is know...
-
Xuan Linさんがコメントを作成しました:
Hi Jaromił, Thanks for the answer! I actually didn't know that QPs can be solved with simplex. May I ask a minor question: does the column "unexplored nodes" always goes to 0 as the algorithm termi...
-
Xuan Linさんがコメントを作成しました:
Hi Jaromił, Thanks for the answer! The column It/Node shows the average number of Simplex iterations performed per node, i.e., the average number of Simplex iteration to solve a problem A to opt...