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

Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek

25.11.2015 Views

416 APPENDIX B. PARAMETERS Possible Values: Any number between 0.0 and 1.0. Default value: 1.0e-6 B.1.39 dparam.lower obj cut Corresponding constant: dparam.lower obj cut Description: If either a primal or dual feasible solution is found proving that the optimal objective value is outside, the interval [dparam.lower obj cut, dparam.upper obj cut], then MOSEK is terminated. Possible Values: Any number between -inf and +inf. Default value: -1.0e30 See also: • dparam.lower obj cut finite trh Objective bound. B.1.40 dparam.lower obj cut finite trh Corresponding constant: dparam.lower obj cut finite trh Description: If the lower objective cut is less than the value of this parameter value, then the lower objective cut i.e. dparam.lower obj cut is treated as −∞. Possible Values: Any number between -inf and +inf. Default value: -0.5e30

B.1. DPARAM: DOUBLE PARAMETERS 417 B.1.41 dparam.mio disable term time Corresponding constant: dparam.mio disable term time Description: The termination criteria governed by • iparam.mio max num relaxs • iparam.mio max num branches • dparam.mio near tol abs gap • dparam.mio near tol rel gap is disabled the first n seconds. This parameter specifies the number n. A negative value is identical to infinity i.e. the termination criteria are never checked. Possible Values: Any number between -inf and +inf. Default value: -1.0 See also: • iparam.mio max num relaxs Maximum number of relaxations in branch and bound search. • iparam.mio max num branches Maximum number of branches allowed during the branch and bound search. • dparam.mio near tol abs gap Relaxed absolute optimality tolerance employed by the mixedinteger optimizer. • dparam.mio near tol rel gap The mixed-integer optimizer is terminated when this tolerance is satisfied. B.1.42 dparam.mio heuristic time Corresponding constant: dparam.mio heuristic time Description: Minimum amount of time to be used in the heuristic search for a good feasible integer solution. A negative values implies that the optimizer decides the amount of time to be spent in the heuristic. Possible Values: Any number between -inf and +inf. Default value: -1.0

416 APPENDIX B. PARAMETERS<br />

Possible Values:<br />

Any number between 0.0 and 1.0.<br />

Default value:<br />

1.0e-6<br />

B.1.39<br />

dparam.lower obj cut<br />

Corresponding constant:<br />

dparam.lower obj cut<br />

Description:<br />

If either a primal or dual feasible solution is found proving that the optimal objective value is<br />

outside, the interval [dparam.lower obj cut, dparam.upper obj cut], then <strong>MOSEK</strong> is terminated.<br />

Possible Values:<br />

Any number between -inf and +inf.<br />

Default value:<br />

-1.0e30<br />

See also:<br />

• dparam.lower obj cut finite trh Objective bound.<br />

B.1.40<br />

dparam.lower obj cut finite trh<br />

Corresponding constant:<br />

dparam.lower obj cut finite trh<br />

Description:<br />

If the lower objective cut is less than the value of this parameter value, then the lower objective<br />

cut i.e. dparam.lower obj cut is treated as −∞.<br />

Possible Values:<br />

Any number between -inf and +inf.<br />

Default value:<br />

-0.5e30

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!