The MOSEK Python optimizer API manual Version 7.0 (Revision 141)

396 APPENDIX B. PARAMETERS
• dparam.mio rel add cut limited. Controls cut generation for mixed-integer optimizer.
• dparam.mio rel gap const. This value is used to compute the relative gap for the solution
to an integer optimization problem.
• iparam.mio root optimizer. Controls which optimizer is employed at the root node in
the mixed-integer optimizer.
• iparam.mio strong branch. The depth from the root in which strong branching is employed.
• dparam.mio tol abs gap.
optimizer.
Absolute optimality tolerance employed by the mixed-integer
• dparam.mio tol abs relax int. Integer constraint tolerance.
• dparam.mio tol feas. Feasibility tolerance for mixed integer solver. Any solution with
maximum infeasibility below this value will be considered feasible.
• dparam.mio tol rel dual bound improvement. Controls cut generation for mixed-integer
optimizer.
• dparam.mio tol rel gap.
optimizer.
Relative optimality tolerance employed by the mixed-integer
• dparam.mio tol rel relax int. Integer constraint tolerance.
• dparam.mio tol x. Absolute solution tolerance used in mixed-integer optimizer.
• iparam.mio use multithreaded optimizer. Controls wheter the new multithreaded optimizer
should be used for Mixed integer problems.
Network simplex optimizer parameters.
Parameters defining the behavior of the network simplex optimizer for linear problems.
• iparam.log sim network freq. Controls the network simplex logging frequency.
• iparam.sim refactor freq. Controls the basis refactoring frequency.
Non-convex solver parameters.
• iparam.log nonconvex. Controls amount of output printed by the nonconvex optimizer.
• iparam.nonconvex max iterations. Maximum number of iterations that can be used by
the nonconvex optimizer.
• dparam.nonconvex tol feas. Feasibility tolerance used by the nonconvex optimizer.
• dparam.nonconvex tol opt. Optimality tolerance used by the nonconvex optimizer.
Nonlinear convex method parameters.
Parameters defining the behavior of the interior-point method for nonlinear convex problems.
• dparam.intpnt nl merit bal. Controls if the complementarity and infeasibility is converging
to zero at about equal rates.
• dparam.intpnt nl tol dfeas. Dual feasibility tolerance used when a nonlinear model is
solved.