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

Cutoff and optimal solution

回答済み

コメント

4件のコメント

  • 正式なコメント
    Juan Orozco
    • Gurobi Staff

    As explained in the section MIP Logging of our reference manual, The sub-section Current Node of the Branch-and-Cut (B&C) Tree Search provides information on the specific node that was explored at that point in the B&C tree. Specifically, the tag cutoff indicates that the associated node was fathomed, since the objective value of its relaxation is worse than the objective value of the incumbent solution. Similarly, the tag infeasible indicates that the associated node was deemed as infeasible (note that this does not imply that the whole model is infeasible).

  • 正式なコメント
    Simranjit Kaur
    • Gurobi Staff
    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 why not try our AI Gurobot?.
  • Alexia Payan
    • Gurobi-versary
    • First Comment
    • Curious

    Hello Juan,

    Thank you for your reply. Regarding both the "cutoff" case and the "infeasible" case, can I still trust the "optimal" solution that is being provided by the optimizer?

    Also, does this mean that the entire B&C tree has been explored when either case occur?

    Thanks.

    0
  • Juan Orozco
    • Gurobi Staff

    As long as  you model doesn't have numerical issues, you can definitely trust the optimal solution reported by our Solver

    0

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