Upper bound and Lower bound for Benders decomposition in callback version
ユーザーの入力を待っています。The upper bound comes to a wrong value while using the callback feature of the algorithm. The same formula works for non-callback version. What is the criteria for checking the convergence of the bounds in callback version.
0
-
正式なコメント
This post is more than three years old. Some information may not be up to date. For current information, please check the Gurobi Documentation or Knowledge Base. If you need more help, please create a new post in the community forum, or try Gurobot, our chatbot interface offering instant, expert-level support. -
Hi Soumya,
Can you please be a bit more specific?
What do you mean with callback- and non-callback version?
What exactly are you doing in the callback?
What do you mean with wrong upper bound value?Best regards,
Mario0
投稿コメントは受け付けていません。
コメント
2件のコメント