Struct mosek::Iinfitem

#[non_exhaustive]
pub struct Iinfitem;

Integer information items.

Implementations

impl Iinfitem

pub const ANA_PRO_NUM_CON: i32 = 0i32

Number of constraints in the problem.

pub const ANA_PRO_NUM_CON_EQ: i32 = 1i32

Number of equality constraints.

pub const ANA_PRO_NUM_CON_FR: i32 = 2i32

Number of unbounded constraints.

pub const ANA_PRO_NUM_CON_LO: i32 = 3i32

Number of constraints with a lower bound and an infinite upper bound.

pub const ANA_PRO_NUM_CON_RA: i32 = 4i32

Number of constraints with finite lower and upper bounds.

pub const ANA_PRO_NUM_CON_UP: i32 = 5i32

Number of constraints with an upper bound and an infinite lower bound.

pub const ANA_PRO_NUM_VAR: i32 = 6i32

Number of variables in the problem.

pub const ANA_PRO_NUM_VAR_BIN: i32 = 7i32

Number of binary variables.

pub const ANA_PRO_NUM_VAR_CONT: i32 = 8i32

Number of continuous variables.

pub const ANA_PRO_NUM_VAR_EQ: i32 = 9i32

Number of fixed variables.

pub const ANA_PRO_NUM_VAR_FR: i32 = 10i32

Number of unbounded constraints.

pub const ANA_PRO_NUM_VAR_INT: i32 = 11i32

Number of general integer variables.

pub const ANA_PRO_NUM_VAR_LO: i32 = 12i32

Number of variables with a lower bound and an infinite upper bound.

pub const ANA_PRO_NUM_VAR_RA: i32 = 13i32

Number of variables with finite lower and upper bounds.

pub const ANA_PRO_NUM_VAR_UP: i32 = 14i32

Number of variables with an upper bound and an infinite lower bound.

pub const INTPNT_FACTOR_DIM_DENSE: i32 = 15i32

Dimension of the dense sub system in factorization.

pub const INTPNT_ITER: i32 = 16i32

Number of interior-point iterations since invoking the interior-point optimizer.

pub const INTPNT_NUM_THREADS: i32 = 17i32

Number of threads that the interior-point optimizer is using.

pub const INTPNT_SOLVE_DUAL: i32 = 18i32

Non-zero if the interior-point optimizer is solving the dual problem.

pub const MIO_ABSGAP_SATISFIED: i32 = 19i32

Non-zero if absolute gap is within tolerances.

pub const MIO_CLIQUE_TABLE_SIZE: i32 = 20i32

Size of the clique table.

pub const MIO_CONSTRUCT_SOLUTION: i32 = 21i32

Informs if MOSEK successfully constructed an initial integer feasible solution.

pub const MIO_INITIAL_FEASIBLE_SOLUTION: i32 = 22i32

Informs if MOSEK found the solution provided by the user to be feasible

pub const MIO_NODE_DEPTH: i32 = 23i32

Depth of the last node solved.

pub const MIO_NUM_ACTIVE_NODES: i32 = 24i32

Number of active branch and bound nodes.

pub const MIO_NUM_ACTIVE_ROOT_CUTS: i32 = 25i32

Number of active cuts in the final relaxation after the mixed-integer optimizer’s root cut generation.

pub const MIO_NUM_BRANCH: i32 = 26i32

Number of branches performed during the optimization.

pub const MIO_NUM_INT_SOLUTIONS: i32 = 27i32

Number of integer feasible solutions that have been found.

pub const MIO_NUM_RELAX: i32 = 28i32

Number of relaxations solved during the optimization.

pub const MIO_NUM_REPEATED_PRESOLVE: i32 = 29i32

Number of times presolve was repeated at root.

pub const MIO_NUM_RESTARTS: i32 = 30i32

Number of restarts performed during the optimization.

pub const MIO_NUM_ROOT_CUT_ROUNDS: i32 = 31i32

Number of cut separation rounds at the root node of the mixed-integer optimizer.

pub const MIO_NUM_SELECTED_CLIQUE_CUTS: i32 = 32i32

Number of clique cuts selected to be included in the relaxation.

pub const MIO_NUM_SELECTED_CMIR_CUTS: i32 = 33i32

Number of Complemented Mixed Integer Rounding (CMIR) cuts selected to be included in the relaxation.

pub const MIO_NUM_SELECTED_GOMORY_CUTS: i32 = 34i32

Number of Gomory cuts selected to be included in the relaxation.

pub const MIO_NUM_SELECTED_IMPLIED_BOUND_CUTS: i32 = 35i32

Number of implied bound cuts selected to be included in the relaxation.

pub const MIO_NUM_SELECTED_KNAPSACK_COVER_CUTS: i32 = 36i32

Number of clique cuts selected to be included in the relaxation.

pub const MIO_NUM_SELECTED_LIPRO_CUTS: i32 = 37i32

Number of lift-and-project cuts selected to be included in the relaxation.

pub const MIO_NUM_SEPARATED_CLIQUE_CUTS: i32 = 38i32

Number of separated clique cuts.

pub const MIO_NUM_SEPARATED_CMIR_CUTS: i32 = 39i32

Number of separated Complemented Mixed Integer Rounding (CMIR) cuts.

pub const MIO_NUM_SEPARATED_GOMORY_CUTS: i32 = 40i32

Number of separated Gomory cuts.

pub const MIO_NUM_SEPARATED_IMPLIED_BOUND_CUTS: i32 = 41i32

Number of separated implied bound cuts.

pub const MIO_NUM_SEPARATED_KNAPSACK_COVER_CUTS: i32 = 42i32

Number of separated clique cuts.

pub const MIO_NUM_SEPARATED_LIPRO_CUTS: i32 = 43i32

Number of separated lift-and-project cuts.

pub const MIO_NUM_SOLVED_NODES: i32 = 44i32

Number of branch and bounds nodes solved in the main branch and bound tree.

pub const MIO_NUMBIN: i32 = 45i32

Number of binary variables in the problem to be solved by the mixed-integer optimizer.

pub const MIO_NUMBINCONEVAR: i32 = 46i32

Number of binary cone variables in the problem to be solved by the mixed-integer optimizer.

pub const MIO_NUMCON: i32 = 47i32

Number of constraints in the problem to be solved by the mixed-integer optimizer.

pub const MIO_NUMCONE: i32 = 48i32

Number of cones in the problem to be solved by the mixed-integer optimizer.

pub const MIO_NUMCONEVAR: i32 = 49i32

Number of cone variables in the problem to be solved by the mixed-integer optimizer.

pub const MIO_NUMCONT: i32 = 50i32

Number of continuous variables in the problem to be solved by the mixed-integer optimizer.

pub const MIO_NUMCONTCONEVAR: i32 = 51i32

Number of continuous cone variables in the problem to be solved by the mixed-integer optimizer.

pub const MIO_NUMDEXPCONES: i32 = 52i32

Number of dual exponential cones in the problem to be solved by the mixed-integer optimizer.

pub const MIO_NUMDJC: i32 = 53i32

Number of disjunctive constraints in the problem to be solved by the mixed-integer optimizer.

pub const MIO_NUMDPOWCONES: i32 = 54i32

Number of dual power cones in the problem to be solved by the mixed-integer optimizer.

pub const MIO_NUMINT: i32 = 55i32

Number of integer variables in the problem to be solved by the mixed-integer optimizer.

pub const MIO_NUMINTCONEVAR: i32 = 56i32

Number of integer cone variables in the problem to be solved by the mixed-integer optimizer.

pub const MIO_NUMPEXPCONES: i32 = 57i32

Number of primal exponential cones in the problem to be solved by the mixed-integer optimizer.

pub const MIO_NUMPPOWCONES: i32 = 58i32

Number of primal power cones in the problem to be solved by the mixed-integer optimizer.

pub const MIO_NUMQCONES: i32 = 59i32

Number of quadratic cones in the problem to be solved by the mixed-integer optimizer.

pub const MIO_NUMRQCONES: i32 = 60i32

Number of rotated quadratic cones in the problem to be solved by the mixed-integer optimizer.

pub const MIO_NUMVAR: i32 = 61i32

Number of variables in the problem to be solved by the mixed-integer optimizer.

pub const MIO_OBJ_BOUND_DEFINED: i32 = 62i32

Non-zero if a valid objective bound has been found, otherwise zero.

pub const MIO_PRESOLVED_NUMBIN: i32 = 63i32

Number of binary variables in the problem after the mixed-integer optimizer’s presolve.

pub const MIO_PRESOLVED_NUMBINCONEVAR: i32 = 64i32

Number of binary cone variables in the problem after the mixed-integer optimizer’s presolve.

pub const MIO_PRESOLVED_NUMCON: i32 = 65i32

Number of constraints in the problem after the mixed-integer optimizer’s presolve.

pub const MIO_PRESOLVED_NUMCONE: i32 = 66i32

Number of cones in the problem after the mixed-integer optimizer’s presolve.

pub const MIO_PRESOLVED_NUMCONEVAR: i32 = 67i32

Number of cone variables in the problem after the mixed-integer optimizer’s presolve.

pub const MIO_PRESOLVED_NUMCONT: i32 = 68i32

Number of continuous variables in the problem after the mixed-integer optimizer’s presolve.

pub const MIO_PRESOLVED_NUMCONTCONEVAR: i32 = 69i32

Number of continuous cone variables in the problem after the mixed-integer optimizer’s presolve.

pub const MIO_PRESOLVED_NUMDEXPCONES: i32 = 70i32

Number of dual exponential cones in the problem after the mixed-integer optimizer’s presolve.

pub const MIO_PRESOLVED_NUMDJC: i32 = 71i32

Number of disjunctive constraints in the problem after the mixed-integer optimizer’s presolve.

pub const MIO_PRESOLVED_NUMDPOWCONES: i32 = 72i32

Number of dual power cones in the problem after the mixed-integer optimizer’s presolve.

pub const MIO_PRESOLVED_NUMINT: i32 = 73i32

Number of integer variables in the problem after the mixed-integer optimizer’s presolve.

pub const MIO_PRESOLVED_NUMINTCONEVAR: i32 = 74i32

Number of integer cone variables in the problem after the mixed-integer optimizer’s presolve.

pub const MIO_PRESOLVED_NUMPEXPCONES: i32 = 75i32

Number of primal exponential cones in the problem after the mixed-integer optimizer’s presolve.

pub const MIO_PRESOLVED_NUMPPOWCONES: i32 = 76i32

Number of primal power cones in the problem after the mixed-integer optimizer’s presolve.

pub const MIO_PRESOLVED_NUMQCONES: i32 = 77i32

Number of quadratic cones in the problem after the mixed-integer optimizer’s presolve.

pub const MIO_PRESOLVED_NUMRQCONES: i32 = 78i32

Number of rotated quadratic cones in the problem after the mixed-integer optimizer’s presolve.

pub const MIO_PRESOLVED_NUMVAR: i32 = 79i32

Number of variables in the problem after the mixed-integer optimizer’s presolve.

pub const MIO_RELGAP_SATISFIED: i32 = 80i32

Non-zero if relative gap is within tolerances.

pub const MIO_TOTAL_NUM_SELECTED_CUTS: i32 = 81i32

Total number of cuts selected to be included in the relaxation by the mixed-integer optimizer.

pub const MIO_TOTAL_NUM_SEPARATED_CUTS: i32 = 82i32

Total number of cuts separated by the mixed-integer optimizer.

pub const MIO_USER_OBJ_CUT: i32 = 83i32

If it is non-zero, then the objective cut is used.

pub const OPT_NUMCON: i32 = 84i32

Number of constraints in the problem solved when the optimizer is called.

pub const OPT_NUMVAR: i32 = 85i32

Number of variables in the problem solved when the optimizer is called

pub const OPTIMIZE_RESPONSE: i32 = 86i32

The response code returned by optimize.

pub const PRESOLVE_NUM_PRIMAL_PERTURBATIONS: i32 = 87i32

Number perturbations to thhe bounds of the primal problem.

pub const PURIFY_DUAL_SUCCESS: i32 = 88i32

Is nonzero if the dual solution is purified.

pub const PURIFY_PRIMAL_SUCCESS: i32 = 89i32

Is nonzero if the primal solution is purified.

pub const RD_NUMBARVAR: i32 = 90i32

Number of symmetric variables read.

pub const RD_NUMCON: i32 = 91i32

Number of constraints read.

pub const RD_NUMCONE: i32 = 92i32

Number of conic constraints read.

pub const RD_NUMINTVAR: i32 = 93i32

Number of integer-constrained variables read.

pub const RD_NUMQ: i32 = 94i32

Number of nonempty Q matrices read.

pub const RD_NUMVAR: i32 = 95i32

Number of variables read.

pub const RD_PROTYPE: i32 = 96i32

Problem type.

pub const SIM_DUAL_DEG_ITER: i32 = 97i32

The number of dual degenerate iterations.

pub const SIM_DUAL_HOTSTART: i32 = 98i32

If 1 then the dual simplex algorithm is solving from an advanced basis.

pub const SIM_DUAL_HOTSTART_LU: i32 = 99i32

If 1 then a valid basis factorization of full rank was located and used by the dual simplex algorithm.

pub const SIM_DUAL_INF_ITER: i32 = 100i32

The number of iterations taken with dual infeasibility.

pub const SIM_DUAL_ITER: i32 = 101i32

Number of dual simplex iterations during the last optimization.

pub const SIM_NUMCON: i32 = 102i32

Number of constraints in the problem solved by the simplex optimizer.

pub const SIM_NUMVAR: i32 = 103i32

Number of variables in the problem solved by the simplex optimizer.

pub const SIM_PRIMAL_DEG_ITER: i32 = 104i32

The number of primal degenerate iterations.

pub const SIM_PRIMAL_HOTSTART: i32 = 105i32

If 1 then the primal simplex algorithm is solving from an advanced basis.

pub const SIM_PRIMAL_HOTSTART_LU: i32 = 106i32

If 1 then a valid basis factorization of full rank was located and used by the primal simplex algorithm.

pub const SIM_PRIMAL_INF_ITER: i32 = 107i32

The number of iterations taken with primal infeasibility.

pub const SIM_PRIMAL_ITER: i32 = 108i32

Number of primal simplex iterations during the last optimization.

pub const SIM_SOLVE_DUAL: i32 = 109i32

Is non-zero if dual problem is solved.

pub const SOL_BAS_PROSTA: i32 = 110i32

Problem status of the basic solution. Updated after each optimization.

pub const SOL_BAS_SOLSTA: i32 = 111i32

Solution status of the basic solution. Updated after each optimization.

pub const SOL_ITG_PROSTA: i32 = 112i32

Problem status of the integer solution. Updated after each optimization.

pub const SOL_ITG_SOLSTA: i32 = 113i32

Solution status of the integer solution. Updated after each optimization.

pub const SOL_ITR_PROSTA: i32 = 114i32

Problem status of the interior-point solution. Updated after each optimization.

pub const SOL_ITR_SOLSTA: i32 = 115i32

Solution status of the interior-point solution. Updated after each optimization.

pub const STO_NUM_A_REALLOC: i32 = 116i32

Number of times the storage for storing the linear coefficient matrix has been changed.

pub const END: i32 = 116i32