Decision Optimization

Decision Optimization

Delivers prescriptive analytics capabilities and decision intelligence to improve decision-making.

 View Only

how to compute strong branching score for infeasible node

  • 1.  how to compute strong branching score for infeasible node

    Posted 02/26/19 11:43 PM

    Originally posted by: srvh


    At the given node, when one of the right or left branch is infeasible how to compute strong branching score? for example, strong branching score is 2*max{(q-)=200,(q+)=infeasible} +min{(q-)=200,(q+)=infeasible}. At this formula what is min between 200 and infeasible and what is max between 200 and infeasible?At the given node, when one of the right or left branch is infeasible how to compute strong branching score? for example, strong branching score is 2*max{(q-)=200,(q+)=infeasible} +min{(q-)=200,(q+)=infeasible}. At this formula what is min between 200 and infeasible and what is max between 200 and infeasible?

    Thanks.

    Serveh


    #CPLEXOptimizers
    #DecisionOptimization