What Is Optimization Toolbox?

intprogNodeSearchStrategyStrategy the algorithm uses to select thenext node to search in the search tree — see“Branching” on page 8-7. The choices are• 'df' — Depth first search strategy. Ateach node in the search tree, if there ischild node one level down in the treethat has not already been explored,the algorithm chooses one such child tosearch. Otherwise, the algorithm movesto the node one level up in the tree andchooses a child node one level down fromthat node.TolFunTolXIntegerTolRLPFun• 'bn' — Best node search strategy, whichchooses the node with lowest bound onthe objective function.Termination tolerance on the function valueTolerance within which the value of avariable is considered to be integralTermination tolerance on the function valueof a linear programming relaxation problemAlgorithmbintprog uses a linear programming (LP)-based branch-and-boundalgorithm to solve binary integer programming problems. The algorithmsearches for an optimal solution to the binary integer programmingproblem by solving a series of LP-relaxation problems, in which thebinary integer requirement on the variables is replaced by the weakerconstraint .Thealgorithm• Searches for a binary integer feasible solution• Updates the best binary integer feasible point found so far as thesearch tree grows8-6