Struct mosek::Dinfitem

#[non_exhaustive]
pub struct Dinfitem;

Double information items

Implementations

impl Dinfitem

pub const ANA_PRO_SCALARIZED_CONSTRAINT_MATRIX_DENSITY: i32 = 0i32

Density percentage of the scalarized constraint matrix.

pub const BI_CLEAN_DUAL_TIME: i32 = 1i32

Time spent within the dual clean-up optimizer of the basis identification procedure since its invocation.

pub const BI_CLEAN_PRIMAL_TIME: i32 = 2i32

Time spent within the primal clean-up optimizer of the basis identification procedure since its invocation.

pub const BI_CLEAN_TIME: i32 = 3i32

Time spent within the clean-up phase of the basis identification procedure since its invocation.

pub const BI_DUAL_TIME: i32 = 4i32

Time spent within the dual phase basis identification procedure since its invocation.

pub const BI_PRIMAL_TIME: i32 = 5i32

Time spent within the primal phase of the basis identification procedure since its invocation.

pub const BI_TIME: i32 = 6i32

Time spent within the basis identification procedure since its invocation.

pub const INTPNT_DUAL_FEAS: i32 = 7i32

Dual feasibility measure reported by the interior-point optimizer.

pub const INTPNT_DUAL_OBJ: i32 = 8i32

Dual objective value reported by the interior-point optimizer.

pub const INTPNT_FACTOR_NUM_FLOPS: i32 = 9i32

An estimate of the number of flops used in the factorization.

pub const INTPNT_OPT_STATUS: i32 = 10i32

A measure of optimality of the solution.

pub const INTPNT_ORDER_TIME: i32 = 11i32

Order time (in seconds).

pub const INTPNT_PRIMAL_FEAS: i32 = 12i32

Primal feasibility measure reported by the interior-point optimizer.

pub const INTPNT_PRIMAL_OBJ: i32 = 13i32

Primal objective value reported by the interior-point optimizer.

pub const INTPNT_TIME: i32 = 14i32

Time spent within the interior-point optimizer since its invocation.

pub const MIO_CLIQUE_SELECTION_TIME: i32 = 15i32

Selection time for clique cuts.

pub const MIO_CLIQUE_SEPARATION_TIME: i32 = 16i32

Separation time for clique cuts.

pub const MIO_CMIR_SELECTION_TIME: i32 = 17i32

Selection time for CMIR cuts.

pub const MIO_CMIR_SEPARATION_TIME: i32 = 18i32

Separation time for CMIR cuts.

pub const MIO_CONSTRUCT_SOLUTION_OBJ: i32 = 19i32

Optimal objective value corresponding to the feasible solution.

pub const MIO_DUAL_BOUND_AFTER_PRESOLVE: i32 = 20i32

Value of the dual bound after presolve but before cut generation.

pub const MIO_GMI_SELECTION_TIME: i32 = 21i32

Selection time for GMI cuts.

pub const MIO_GMI_SEPARATION_TIME: i32 = 22i32

Separation time for GMI cuts.

pub const MIO_IMPLIED_BOUND_SELECTION_TIME: i32 = 23i32

Selection time for implied bound cuts.

pub const MIO_IMPLIED_BOUND_SEPARATION_TIME: i32 = 24i32

Separation time for implied bound cuts.

pub const MIO_INITIAL_FEASIBLE_SOLUTION_OBJ: i32 = 25i32

Optimal objective value corresponding to the user provided initial solution.

pub const MIO_KNAPSACK_COVER_SELECTION_TIME: i32 = 26i32

Selection time for knapsack cover.

pub const MIO_KNAPSACK_COVER_SEPARATION_TIME: i32 = 27i32

Separation time for knapsack cover.

pub const MIO_LIPRO_SELECTION_TIME: i32 = 28i32

Selection time for lift-and-project cuts.

pub const MIO_LIPRO_SEPARATION_TIME: i32 = 29i32

Separation time for lift-and-project cuts.

pub const MIO_OBJ_ABS_GAP: i32 = 30i32

If the mixed-integer optimizer has computed a feasible solution and a bound, this contains the absolute gap.

pub const MIO_OBJ_BOUND: i32 = 31i32

The best bound on the objective value known.

pub const MIO_OBJ_INT: i32 = 32i32

The primal objective value corresponding to the best integer feasible solution.

pub const MIO_OBJ_REL_GAP: i32 = 33i32

If the mixed-integer optimizer has computed a feasible solution and a bound, this contains the relative gap.

pub const MIO_PROBING_TIME: i32 = 34i32

Total time for probing.

pub const MIO_ROOT_CUT_SELECTION_TIME: i32 = 35i32

Total time for cut selection.

pub const MIO_ROOT_CUT_SEPARATION_TIME: i32 = 36i32

Total time for cut separation.

pub const MIO_ROOT_OPTIMIZER_TIME: i32 = 37i32

Time spent in the contiuous optimizer while processing the root node relaxation.

pub const MIO_ROOT_PRESOLVE_TIME: i32 = 38i32

Time spent presolving the problem at the root node.

pub const MIO_ROOT_TIME: i32 = 39i32

Time spent processing the root node.

pub const MIO_SYMMETRY_DETECTION_TIME: i32 = 40i32

Total time for symmetry detection.

pub const MIO_SYMMETRY_FACTOR: i32 = 41i32

Degree to which the problem is affected by detected symmetry.

pub const MIO_TIME: i32 = 42i32

Time spent in the mixed-integer optimizer.

pub const MIO_USER_OBJ_CUT: i32 = 43i32

If the objective cut is used, then this information item has the value of the cut.

pub const OPTIMIZER_TICKS: i32 = 44i32

Total number of ticks spent in the optimizer since it was invoked. It is strictly negative if it is not available.

pub const OPTIMIZER_TIME: i32 = 45i32

Total time spent in the optimizer since it was invoked.

pub const PRESOLVE_ELI_TIME: i32 = 46i32

Total time spent in the eliminator since the presolve was invoked.

pub const PRESOLVE_LINDEP_TIME: i32 = 47i32

Total time spent in the linear dependency checker since the presolve was invoked.

pub const PRESOLVE_TIME: i32 = 48i32

Total time (in seconds) spent in the presolve since it was invoked.

pub const PRESOLVE_TOTAL_PRIMAL_PERTURBATION: i32 = 49i32

Total perturbation of the bounds of the primal problem.

pub const PRIMAL_REPAIR_PENALTY_OBJ: i32 = 50i32

The optimal objective value of the penalty function.

pub const QCQO_REFORMULATE_MAX_PERTURBATION: i32 = 51i32

Maximum absolute diagonal perturbation occurring during the QCQO reformulation.

pub const QCQO_REFORMULATE_TIME: i32 = 52i32

Time spent with conic quadratic reformulation.

pub const QCQO_REFORMULATE_WORST_CHOLESKY_COLUMN_SCALING: i32 = 53i32

Worst Cholesky column scaling.

pub const QCQO_REFORMULATE_WORST_CHOLESKY_DIAG_SCALING: i32 = 54i32

Worst Cholesky diagonal scaling.

pub const READ_DATA_TIME: i32 = 55i32

Time spent reading the data file.

pub const REMOTE_TIME: i32 = 56i32

The total real time in seconds spent when optimizing on a server by the process performing the optimization on the server

pub const SIM_DUAL_TIME: i32 = 57i32

Time spent in the dual simplex optimizer since invoking it.

pub const SIM_FEAS: i32 = 58i32

Feasibility measure reported by the simplex optimizer.

pub const SIM_OBJ: i32 = 59i32

Objective value reported by the simplex optimizer.

pub const SIM_PRIMAL_TIME: i32 = 60i32

Time spent in the primal simplex optimizer since invoking it.

pub const SIM_TIME: i32 = 61i32

Time spent in the simplex optimizer since invoking it.

pub const SOL_BAS_DUAL_OBJ: i32 = 62i32

Dual objective value of the basic solution. Updated by the function updatesolutioninfo.

pub const SOL_BAS_DVIOLCON: i32 = 63i32

Maximal dual bound violation for xx in the basic solution. Updated by the function updatesolutioninfo.

pub const SOL_BAS_DVIOLVAR: i32 = 64i32

Maximal dual bound violation for xx in the basic solution. Updated by the function updatesolutioninfo.

pub const SOL_BAS_NRM_BARX: i32 = 65i32

Infinity norm of barx in the basic solution.

pub const SOL_BAS_NRM_SLC: i32 = 66i32

Infinity norm of slc in the basic solution.

pub const SOL_BAS_NRM_SLX: i32 = 67i32

Infinity norm of slx in the basic solution.

pub const SOL_BAS_NRM_SUC: i32 = 68i32

Infinity norm of suc in the basic solution.

pub const SOL_BAS_NRM_SUX: i32 = 69i32

Infinity norm of sux in the basic solution.

pub const SOL_BAS_NRM_XC: i32 = 70i32

Infinity norm of xc in the basic solution.

pub const SOL_BAS_NRM_XX: i32 = 71i32

Infinity norm of xx in the basic solution.

pub const SOL_BAS_NRM_Y: i32 = 72i32

Infinity norm of Y in the basic solution.

pub const SOL_BAS_PRIMAL_OBJ: i32 = 73i32

Primal objective value of the basic solution. Updated by the function updatesolutioninfo.

pub const SOL_BAS_PVIOLCON: i32 = 74i32

Maximal primal bound violation for xc in the basic solution. Updated by the function updatesolutioninfo.

pub const SOL_BAS_PVIOLVAR: i32 = 75i32

Maximal primal bound violation for xx in the basic solution. Updated by the function updatesolutioninfo.

pub const SOL_ITG_NRM_BARX: i32 = 76i32

Infinity norm of barx in the integer solution.

pub const SOL_ITG_NRM_XC: i32 = 77i32

Infinity norm of xc in the integer solution.

pub const SOL_ITG_NRM_XX: i32 = 78i32

Infinity norm of xx in the integer solution.

pub const SOL_ITG_PRIMAL_OBJ: i32 = 79i32

Primal objective value of the integer solution. Updated by the function updatesolutioninfo.

pub const SOL_ITG_PVIOLACC: i32 = 80i32

Maximal primal violation for affine conic constraints in the integer solution. Updated by the function updatesolutioninfo.

pub const SOL_ITG_PVIOLBARVAR: i32 = 81i32

Maximal primal bound violation for barx in the integer solution. Updated by the function updatesolutioninfo.

pub const SOL_ITG_PVIOLCON: i32 = 82i32

Maximal primal bound violation for xc in the integer solution. Updated by the function updatesolutioninfo.

pub const SOL_ITG_PVIOLCONES: i32 = 83i32

Maximal primal violation for primal conic constraints in the integer solution. Updated by the function updatesolutioninfo.

pub const SOL_ITG_PVIOLDJC: i32 = 84i32

Maximal primal violation for disjunctive constraints in the integer solution. Updated by the function updatesolutioninfo.

pub const SOL_ITG_PVIOLITG: i32 = 85i32

Maximal violation for the integer constraints in the integer solution. Updated by the function updatesolutioninfo.

pub const SOL_ITG_PVIOLVAR: i32 = 86i32

Maximal primal bound violation for xx in the integer solution. Updated by the function updatesolutioninfo.

pub const SOL_ITR_DUAL_OBJ: i32 = 87i32

Dual objective value of the interior-point solution. Updated by the function updatesolutioninfo.

pub const SOL_ITR_DVIOLACC: i32 = 88i32

Maximal dual violation for affine conic constraints in the interior-point solution. Updated by the function updatesolutioninfo.

pub const SOL_ITR_DVIOLBARVAR: i32 = 89i32

Maximal dual bound violation for barx in the interior-point solution. Updated by the function updatesolutioninfo.

pub const SOL_ITR_DVIOLCON: i32 = 90i32

Maximal dual bound violation for xc in the interior-point solution. Updated by the function updatesolutioninfo.

pub const SOL_ITR_DVIOLCONES: i32 = 91i32

Maximal dual violation for conic constraints in the interior-point solution. Updated by the function updatesolutioninfo.

pub const SOL_ITR_DVIOLVAR: i32 = 92i32

Maximal dual bound violation for xx in the interior-point solution. Updated by the function updatesolutioninfo.

pub const SOL_ITR_NRM_BARS: i32 = 93i32

Infinity norm of bars in the interior-point solution.

pub const SOL_ITR_NRM_BARX: i32 = 94i32

Infinity norm of barx in the interior-point solution.

pub const SOL_ITR_NRM_SLC: i32 = 95i32

Infinity norm of slc in the interior-point solution.

pub const SOL_ITR_NRM_SLX: i32 = 96i32

Infinity norm of slx in the interior-point solution.

pub const SOL_ITR_NRM_SNX: i32 = 97i32

Infinity norm of snx in the interior-point solution.

pub const SOL_ITR_NRM_SUC: i32 = 98i32

Infinity norm of suc in the interior-point solution.

pub const SOL_ITR_NRM_SUX: i32 = 99i32

Infinity norm of sux in the interior-point solution.

pub const SOL_ITR_NRM_XC: i32 = 100i32

Infinity norm of xc in the interior-point solution.

pub const SOL_ITR_NRM_XX: i32 = 101i32

Infinity norm of xx in the interior-point solution.

pub const SOL_ITR_NRM_Y: i32 = 102i32

Infinity norm of Y in the interior-point solution.

pub const SOL_ITR_PRIMAL_OBJ: i32 = 103i32

Primal objective value of the interior-point solution.

pub const SOL_ITR_PVIOLACC: i32 = 104i32

Maximal primal violation for affine conic constraints in the interior-point solution. Updated by the function updatesolutioninfo.

pub const SOL_ITR_PVIOLBARVAR: i32 = 105i32

Maximal primal bound violation for barx in the interior-point solution. Updated by the function updatesolutioninfo.

pub const SOL_ITR_PVIOLCON: i32 = 106i32

Maximal primal bound violation for xc in the interior-point solution. Updated by the function updatesolutioninfo.

pub const SOL_ITR_PVIOLCONES: i32 = 107i32

Maximal primal violation for conic constraints in the interior-point solution. Updated by the function updatesolutioninfo.

pub const SOL_ITR_PVIOLVAR: i32 = 108i32

Maximal primal bound violation for xx in the interior-point solution. Updated by the function updatesolutioninfo.

pub const TO_CONIC_TIME: i32 = 109i32

Time spent in the last to conic reformulation.

pub const WRITE_DATA_TIME: i32 = 110i32

Time spent writing the data file.

pub const END: i32 = 110i32