Struct mosek::Dparam

#[non_exhaustive]
pub struct Dparam;

Double parameters

Implementations

impl Dparam

pub const ANA_SOL_INFEAS_TOL: i32 = 0i32

If a constraint violates its bound with an amount larger than this value, the constraint name, index and violation will be printed by the solution analyzer.

pub const BASIS_REL_TOL_S: i32 = 1i32

Maximum relative dual bound violation allowed in an optimal basic solution.

pub const BASIS_TOL_S: i32 = 2i32

Maximum absolute dual bound violation in an optimal basic solution.

pub const BASIS_TOL_X: i32 = 3i32

Maximum absolute primal bound violation allowed in an optimal basic solution.

pub const CHECK_CONVEXITY_REL_TOL: i32 = 4i32

Not in use.

pub const DATA_SYM_MAT_TOL: i32 = 5i32

Zero tolerance threshold for symmetric matrices.

pub const DATA_SYM_MAT_TOL_HUGE: i32 = 6i32

Data tolerance threshold.

pub const DATA_SYM_MAT_TOL_LARGE: i32 = 7i32

Data tolerance threshold.

pub const DATA_TOL_AIJ_HUGE: i32 = 8i32

Data tolerance threshold.

pub const DATA_TOL_AIJ_LARGE: i32 = 9i32

Data tolerance threshold.

pub const DATA_TOL_BOUND_INF: i32 = 10i32

Data tolerance threshold.

pub const DATA_TOL_BOUND_WRN: i32 = 11i32

Data tolerance threshold.

pub const DATA_TOL_C_HUGE: i32 = 12i32

Data tolerance threshold.

pub const DATA_TOL_CJ_LARGE: i32 = 13i32

Data tolerance threshold.

pub const DATA_TOL_QIJ: i32 = 14i32

Data tolerance threshold.

pub const DATA_TOL_X: i32 = 15i32

Data tolerance threshold.

pub const INTPNT_CO_TOL_DFEAS: i32 = 16i32

Dual feasibility tolerance used by the interior-point optimizer for conic problems.

pub const INTPNT_CO_TOL_INFEAS: i32 = 17i32

Infeasibility tolerance used by the interior-point optimizer for conic problems.

pub const INTPNT_CO_TOL_MU_RED: i32 = 18i32

Relative complementarity gap tolerance used by the interior-point optimizer for conic problems.

pub const INTPNT_CO_TOL_NEAR_REL: i32 = 19i32

Optimality tolerance used by the interior-point optimizer for conic problems.

pub const INTPNT_CO_TOL_PFEAS: i32 = 20i32

Primal feasibility tolerance used by the interior-point optimizer for conic problems.

pub const INTPNT_CO_TOL_REL_GAP: i32 = 21i32

Relative gap termination tolerance used by the interior-point optimizer for conic problems.

pub const INTPNT_QO_TOL_DFEAS: i32 = 22i32

Dual feasibility tolerance used by the interior-point optimizer for quadratic problems.

pub const INTPNT_QO_TOL_INFEAS: i32 = 23i32

Infeasibility tolerance used by the interior-point optimizer for quadratic problems.

pub const INTPNT_QO_TOL_MU_RED: i32 = 24i32

Relative complementarity gap tolerance used by the interior-point optimizer for quadratic problems.

pub const INTPNT_QO_TOL_NEAR_REL: i32 = 25i32

Optimality tolerance used by the interior-point optimizer for quadratic problems.

pub const INTPNT_QO_TOL_PFEAS: i32 = 26i32

Primal feasibility tolerance used by the interior-point optimizer for quadratic problems.

pub const INTPNT_QO_TOL_REL_GAP: i32 = 27i32

Relative gap termination tolerance used by the interior-point optimizer for quadratic problems.

pub const INTPNT_TOL_DFEAS: i32 = 28i32

Dual feasibility tolerance used by the interior-point optimizer for linear problems.

pub const INTPNT_TOL_DSAFE: i32 = 29i32

Controls the interior-point dual starting point.

pub const INTPNT_TOL_INFEAS: i32 = 30i32

Infeasibility tolerance used by the interior-point optimizer for linear problems.

pub const INTPNT_TOL_MU_RED: i32 = 31i32

Relative complementarity gap tolerance used by the interior-point optimizer for linear problems.

pub const INTPNT_TOL_PATH: i32 = 32i32

Interior-point centering aggressiveness.

pub const INTPNT_TOL_PFEAS: i32 = 33i32

Primal feasibility tolerance used by the interior-point optimizer for linear problems.

pub const INTPNT_TOL_PSAFE: i32 = 34i32

Controls the interior-point primal starting point.

pub const INTPNT_TOL_REL_GAP: i32 = 35i32

Relative gap termination tolerance used by the interior-point optimizer for linear problems.

pub const INTPNT_TOL_REL_STEP: i32 = 36i32

Relative step size to the boundary for linear and quadratic optimization problems.

pub const INTPNT_TOL_STEP_SIZE: i32 = 37i32

Minimal step size tolerance for the interior-point optimizer.

pub const LOWER_OBJ_CUT: i32 = 38i32

Objective bound.

pub const LOWER_OBJ_CUT_FINITE_TRH: i32 = 39i32

Objective bound.

pub const MIO_DJC_MAX_BIGM: i32 = 40i32

Maximum allowed big-M value when reformulating disjunctive constraints to linear constraints.

pub const MIO_MAX_TIME: i32 = 41i32

Time limit for the mixed-integer optimizer.

pub const MIO_REL_GAP_CONST: i32 = 42i32

This value is used to compute the relative gap for the solution to an integer optimization problem.

pub const MIO_TOL_ABS_GAP: i32 = 43i32

Absolute optimality tolerance employed by the mixed-integer optimizer.

pub const MIO_TOL_ABS_RELAX_INT: i32 = 44i32

Integer feasibility tolerance.

pub const MIO_TOL_FEAS: i32 = 45i32

Feasibility tolerance for mixed integer solver.

pub const MIO_TOL_REL_DUAL_BOUND_IMPROVEMENT: i32 = 46i32

Controls cut generation for mixed-integer optimizer.

pub const MIO_TOL_REL_GAP: i32 = 47i32

Relative optimality tolerance employed by the mixed-integer optimizer.

pub const OPTIMIZER_MAX_TICKS: i32 = 48i32

Solver ticks limit.

pub const OPTIMIZER_MAX_TIME: i32 = 49i32

Solver time limit.

pub const PRESOLVE_TOL_ABS_LINDEP: i32 = 50i32

Absolute tolerance employed by the linear dependency checker.

pub const PRESOLVE_TOL_AIJ: i32 = 51i32

Absolute zero tolerance employed for constraint coefficients in the presolve.

pub const PRESOLVE_TOL_PRIMAL_INFEAS_PERTURBATION: i32 = 52i32

The presolve is allowed to perturb a bound on a constraint or variable by this amount if it removes an infeasibility.

pub const PRESOLVE_TOL_REL_LINDEP: i32 = 53i32

Relative tolerance employed by the linear dependency checker.

pub const PRESOLVE_TOL_S: i32 = 54i32

Absolute zero tolerance employed for slack variables in the presolve.

pub const PRESOLVE_TOL_X: i32 = 55i32

Absolute zero tolerance employed for variables in the presolve.

pub const QCQO_REFORMULATE_REL_DROP_TOL: i32 = 56i32

This parameter determines when columns are dropped in incomplete Cholesky factorization during reformulation of quadratic problems.

pub const SEMIDEFINITE_TOL_APPROX: i32 = 57i32

Tolerance to define a matrix to be positive semidefinite.

pub const SIM_LU_TOL_REL_PIV: i32 = 58i32

Relative pivot tolerance employed when computing the LU factorization of the basis matrix.

pub const SIMPLEX_ABS_TOL_PIV: i32 = 59i32

Absolute pivot tolerance employed by the simplex optimizers.

pub const UPPER_OBJ_CUT: i32 = 60i32

Objective bound.

pub const UPPER_OBJ_CUT_FINITE_TRH: i32 = 61i32

Objective bound.