Xpress Knitro Control Parameters
This chapter provides a full list of the controls accepted by Xpress for setting Knitro parameters. Knitro has a great number and variety of user option settings and although it tries to choose the best settings by default, often significant performance improvements can be realized by choosing some non-default option settings.
| XKTR_PARAM_ALGORITHM | 
     Indicates which algorithm to use to solve the problem
     | 
| XKTR_PARAM_BAR_DIRECTINTERVAL | 
     Controls the maximum number of consecutive conjugate gradient (CG) steps before Knitro will try to enforce that a step is taken using direct linear algebra.
     | 
| XKTR_PARAM_BAR_FEASIBLE | 
     Specifies whether special emphasis is placed on getting and staying feasible in the interior-point algorithms.
     | 
| XKTR_PARAM_BAR_FEASMODETOL | 
     Specifies the tolerance in equation that determines whether Knitro will force subsequent iterates to remain feasible.
     | 
| XKTR_PARAM_BAR_INITMU | 
     Specifies the initial value for the barrier parameter : used with the barrier algorithms. This option has no effect on the Active Set algorithm.
     | 
| XKTR_PARAM_BAR_INITPT | 
     Indicates whether an initial point strategy is used with barrier algorithms.
     | 
| XKTR_PARAM_BAR_MAXBACKTRACK | 
     Indicates the maximum allowable number of backtracks during the linesearch of the Interior/Direct algorithm before reverting to a CG step.
     | 
| XKTR_PARAM_BAR_MAXCROSSIT | 
     Specifies the maximum number of crossover iterations before termination.
     | 
| XKTR_PARAM_BAR_MAXREFACTOR | 
     Indicates the maximum number of refactorizations of the KKT system per iteration of the Interior/Direct algorithm before reverting to a CG step.
     | 
| XKTR_PARAM_BAR_MURULE | 
     Indicates which strategy to use for modifying the barrier parameter mu in the barrier algorithms.
     | 
| XKTR_PARAM_BAR_PENCONS | 
     Indicates whether a penalty approach is applied to the constraints.
     | 
| XKTR_PARAM_BAR_PENRULE | 
     Indicates which penalty parameter strategy to use for determining whether or not to accept a trial iterate.
     | 
| XKTR_PARAM_BAR_SWITCHRULE | 
     Indicates whether or not the barrier algorithms will allow switching from an optimality phase to a pure feasibility phase.
     | 
| XKTR_PARAM_DELTA | 
     Specifies the initial trust region radius scaling factor used to determine the initial trust region size.
     | 
| XKTR_PARAM_FEASTOL | 
     Specifies the final relative stopping tolerance for the feasibility error.
     | 
| XKTR_PARAM_FEASTOLABS | 
     Specifies the final absolute stopping tolerance for the feasibility error.
     | 
| XKTR_PARAM_GRADOPT | 
     Specifies how to compute the gradients of the objective and constraint functions.
     | 
| XKTR_PARAM_HESSOPT | 
     Specifies how to compute the (approximate) Hessian of the Lagrangian.
     | 
| XKTR_PARAM_HONORBNDS | 
     Indicates whether or not to enforce satisfaction of simple variable bounds throughout the optimization.
     | 
| XKTR_PARAM_INFEASTOL | 
     Specifies the (relative) tolerance used for declaring infeasibility of a model.
     | 
| XKTR_PARAM_LMSIZE | 
     Specifies the number of limited memory pairs stored when approximating the Hessian using the limited-memory quasi-Newton BFGS option.
     | 
| XKTR_PARAM_MAXCGIT | 
     Specifies the number of limited memory pairs stored when approximating the Hessian using the limited-memory quasi-Newton BFGS option.
     | 
| XKTR_PARAM_MAXIT | 
     Specifies the maximum number of iterations before termination.
     | 
| XKTR_PARAM_MIP_BRANCHRULE | 
     Specifies which branching rule to use for MIP branch and bound procedure.
     | 
| XKTR_PARAM_MIP_GUB_BRANCH | 
     Specifies whether or not to branch on generalized upper bounds (GUBs).
     | 
| XKTR_PARAM_MIP_HEURISTIC | 
     Specifies which MIP heuristic search approach to apply to try to find an initial integer feasible point.
     | 
| XKTR_PARAM_MIP_HEURISTIC_MAXIT | 
     Specifies the maximum number of iterations to allow for MIP heuristic, if one is enabled.
     | 
| XKTR_PARAM_MIP_IMPLICATNS | 
     Specifies whether or not to add constraints to the MIP derived from logical implications.
     | 
| XKTR_PARAM_MIP_INTEGERTOL | 
     This value specifies the threshold for deciding whether or not a variable is determined to be an integer.
     | 
| XKTR_PARAM_MIP_INTGAPABS | 
     The absolute integrality gap stop tolerance for MIP.
     | 
| XKTR_PARAM_MIP_INTGAPREL | 
     The relative integrality gap stop tolerance for MIP.
     | 
| XKTR_PARAM_MIP_KNAPSACK | 
     Specifies rules for adding MIP knapsack cuts.
     | 
| XKTR_PARAM_MIP_LPALG | 
     Specifies which algorithm to use for any linear programming (LP) subproblem solves that may occur in the MIP branch and bound procedure.
     | 
| XKTR_PARAM_MIP_MAXNODES | 
     Specifies the maximum number of nodes explored.
     | 
| XKTR_PARAM_MIP_MAXSOLVES | 
     Specifies the maximum number of subproblem solves allowed (0 means no limit).
     | 
| XKTR_PARAM_MIP_METHOD | 
     Specifies which MIP method to use.
     | 
| XKTR_PARAM_MIP_OUTINTERVAL | 
     Specifies node printing interval for XKTR_PARAM_MIP_OUTLEVEL when XKTR_PARAM_MIP_OUTLEVEL > 0.
     | 
| XKTR_PARAM_MIP_OUTLEVEL | 
     Specifies how much MIP information to print.
     | 
| XKTR_PARAM_MIP_PSEUDOINIT | 
     Specifies the method used to initialize pseudo-costs corresponding to variables that have not yet been branched on in the MIP method.
     | 
| XKTR_PARAM_MIP_ROOTALG | 
     Specifies which algorithm to use for the root node solve in MIP (same options as XKTR_PARAM_ALGORITHM user option).
     | 
| XKTR_PARAM_MIP_ROUNDING | 
     Specifies the MIP rounding rule to apply.
     | 
| XKTR_PARAM_MIP_SELECTRULE | 
     Specifies the MIP select rule for choosing the next node in the branch and bound tree.
     | 
| XKTR_PARAM_MIP_STRONG_CANDLIM | 
     Specifies the maximum number of candidates to explore for MIP strong branching.
     | 
| XKTR_PARAM_MIP_STRONG_LEVEL | 
     Specifies the maximum number of tree levels on which to perform MIP strong branching.
     | 
| XKTR_PARAM_MIP_STRONG_MAXIT | 
     Specifies the maximum number of iterations to allow for MIP strong branching solves.
     | 
| XKTR_PARAM_MIP_TERMINATE | 
     Specifies conditions for terminating the MIP algorithm.
     | 
| XKTR_PARAM_OBJRANGE | 
     Specifies the extreme limits of the objective function for purposes of determining unboundedness.
     | 
| XKTR_PARAM_OPTTOL | 
     Specifies the final relative stopping tolerance for the KKT (optimality) error.
     | 
| XKTR_PARAM_OPTTOLABS | 
     Specifies the final absolute stopping tolerance for the KKT (optimality) error.
     | 
| XKTR_PARAM_OUTLEV | 
     Controls the level of output produced by Knitro.
     | 
| XKTR_PARAM_PRESOLVE | 
     Determine whether or not to use the Knitro presolver to try to simplify the model by removing variables or constraints. Specifies conditions for terminating the MIP algorithm.
     | 
| XKTR_PARAM_PRESOLVE_TOL | 
     Determines the tolerance used by the Knitro presolver to remove variables and constraints from the model.
     | 
| XKTR_PARAM_SCALE | 
     Performs a scaling of the objective and constraint functions based on their values at the initial point.
     | 
| XKTR_PARAM_SOC | 
     Specifies whether or not to try second order corrections (SOC).
     | 
| XKTR_PARAM_XTOL | 
     The optimization process will terminate if the relative change in all components of the solution point estimate is less than xtol.
     | 
 
