What Is Optimization Toolbox?

Specifying the OptionsThe following Relative line search bound options are available for themedium-scale algorithm with the fgoalattain, fmincon, fminimax, andfseminf solvers:• Use Bounds to define a relative bound on the line search step length. Thisvalue is a real nonnegative scalar value that controls the magnitude ofdisplacements in x when the solver takes large steps.• Use Number of iterations to use bound to specify the number ofiterations for which the bound specified in Bounds should be active.Set Line search type to quadratic/cubic or cubic to specify the line searchalgorithm choice.Set Merit function to multiobjective to use the goal attainment/minimaxmerit function or single objective to use the fmincon solver merit function.Specify Node search strategy to determine how the bintprog solverexplores the search tree. Choices are best node or depth first.Select the Branch strategy for the bintprog solver to choose the strategythe algorithm uses to select the branch variable in the search tree—see thesection on Branching. The choices are:• maximum integer infeasibility —Choosethevariablewhosevalueisclosest to 0.5 (the default).• minimum integer infeasibility —Choosethevariablewhosevalueisclosest to 0 or 1 but not equal to 0 or 1.Set X integer tolerance for the bintprog solver to specify the tolerancewithinwhichthevalueofavariableisconsideredtobeintegeral.5-35