Implementing Feasibility Cuts in Benders Decomposition

回答済み

Miguel Peinado-Guerrero

2022年03月23日 22:00

• 
• 

I am attempting to implement feasibility cuts using with gurobi/C# within the canonical benders decomposition framework. I am solving the primal of the master and the primal of the sub. As such, when formulating optimality cuts, I can use GRB.attr.pi to attain the required information from the dual of the sub. In the case infeasibility in the primal of the sub problem, I need to get the direction of unboundness for the sub's dual and use this information in the feasibility cut. Is this what GRB.attr.FarkasDual provides? Do I need to do any other processing on it?

0

• 正式なコメント

  

  Simranjit Kaur

  • Gurobi Staff

  2025年11月16日 23:41

  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.
• 

  Jaromił Najman

  • Gurobi Staff

  2022年03月24日 08:35

  FarkasDual and FarkasProof provide a certificate of infeasibility and not the direction of unboundness. To get an unbounded ray, you have to query the UnbdRay attribute, which is only available if parameter InfUnbdInfo has been set.

  0

投稿コメントは受け付けていません。