メインコンテンツへスキップ

Retrieve dual multipliers for each leaf node in a MIP problem

回答済み

コメント

2件のコメント

  • 正式なコメント
    Simranjit Kaur
    • Gurobi Staff
    This post is more than two 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.
  • Mario Ruthmair
    • Gurobi Staff

    Hi,

    Gurobi's branch-and-bound algorithm is based on node relaxations (relaxing integrality), and involves a lot of other strategies that deviate from classical textbook branch-and-bound algorithms.
    Your figure shows a combinatorial enumeration tree which is different to what is implemented in Gurobi's solver engine. Additionally, you cannot retrieve branching decisions (e.g., binary variable fixings) in some node of Gurobi's branch-and-bound tree.

    So, if you want to have detailed access to all branch-and-bound node information, you might need to implement your own branch-and-bound algorithm, and for example use Gurobi as a solver for your nodes' problems.
    Then, provided the node problem is a linear program (without integer variables), you can access duals via constraint attribute Pi, or if infeasible via attribute FarkasDual. In the latter case you need to set parameter InfUnbdInfo=1.

    Best regards,
    Mario

    0

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