-
MSK_IINF_ANA_PRO_NUM_CON
Number of constraints in the problem.
This value is set by MSK_analyzeproblem.
-
MSK_IINF_ANA_PRO_NUM_CON_EQ
Number of equality constraints.
This value is set by MSK_analyzeproblem.
-
MSK_IINF_ANA_PRO_NUM_CON_FR
Number of unbounded constraints.
This value is set by MSK_analyzeproblem.
-
MSK_IINF_ANA_PRO_NUM_CON_LO
Number of constraints with a lower bound and an infinite upper bound.
This value is set by MSK_analyzeproblem.
-
MSK_IINF_ANA_PRO_NUM_CON_RA
Number of constraints with finite lower and upper bounds.
This value is set by MSK_analyzeproblem.
-
MSK_IINF_ANA_PRO_NUM_CON_UP
Number of constraints with an upper bound and an infinite lower bound.
This value is set by MSK_analyzeproblem.
-
MSK_IINF_ANA_PRO_NUM_VAR
Number of variables in the problem.
This value is set by MSK_analyzeproblem.
-
MSK_IINF_ANA_PRO_NUM_VAR_BIN
Number of binary (0-1) variables.
This value is set by MSK_analyzeproblem.
-
MSK_IINF_ANA_PRO_NUM_VAR_CONT
Number of continuous variables.
This value is set by MSK_analyzeproblem.
-
MSK_IINF_ANA_PRO_NUM_VAR_EQ
Number of fixed variables.
This value is set by MSK_analyzeproblem.
-
MSK_IINF_ANA_PRO_NUM_VAR_FR
Number of free variables.
This value is set by MSK_analyzeproblem.
-
MSK_IINF_ANA_PRO_NUM_VAR_INT
Number of general integer variables.
This value is set by MSK_analyzeproblem.
-
MSK_IINF_ANA_PRO_NUM_VAR_LO
Number of variables with a lower bound and an infinite upper bound.
This value is set by MSK_analyzeproblem.
-
MSK_IINF_ANA_PRO_NUM_VAR_RA
Number of variables with finite lower and upper bounds.
This value is set by MSK_analyzeproblem.
-
MSK_IINF_ANA_PRO_NUM_VAR_UP
Number of variables with an upper bound and an infinite lower bound. This value is set by
This value is set by MSK_analyzeproblem.
- MSK_IINF_CACHE_SIZE_L1
L1 cache size used.
- MSK_IINF_CACHE_SIZE_L2
L2 cache size used.
- MSK_IINF_CONCURRENT_FASTEST_OPTIMIZER
The type of the optimizer that finished first in a concurrent optimization.
- MSK_IINF_CPU_TYPE
The type of cpu detected.
- MSK_IINF_INTPNT_FACTOR_NUM_OFFCOL
Number of columns in the constraint matrix (or Jacobian) that has an offending structure.
- MSK_IINF_INTPNT_ITER
Number of interior-point iterations since invoking the interior-point optimizer.
- MSK_IINF_INTPNT_NUM_THREADS
Number of threads that the interior-point optimizer is using.
- MSK_IINF_INTPNT_SOLVE_DUAL
Non-zero if the interior-point optimizer is solving the dual problem.
- MSK_IINF_MIO_CONSTRUCT_SOLUTION
If this item has the value 0, then MOSEK did not try to construct an initial integer feasible solution. If the item has a positive value, then MOSEK successfully constructed an initial integer feasible solution.
- MSK_IINF_MIO_INITIAL_SOLUTION
Is non-zero if an initial integer solution is specified.
- MSK_IINF_MIO_NUM_ACTIVE_NODES
Number of active nodes in the branch and bound tree.
- MSK_IINF_MIO_NUM_BRANCH
Number of branches performed during the optimization.
- MSK_IINF_MIO_NUM_CUTS
Number of cuts generated by the mixed-integer optimizer.
- MSK_IINF_MIO_NUM_INT_SOLUTIONS
Number of integer feasible solutions that has been found.
- MSK_IINF_MIO_NUM_RELAX
Number of relaxations solved during the optimization.
- MSK_IINF_MIO_NUMCON
Number of constraints in the problem solved be the mixed-integer optimizer.
- MSK_IINF_MIO_NUMINT
Number of integer variables in the problem solved be the mixed-integer optimizer.
- MSK_IINF_MIO_NUMVAR
Number of variables in the problem solved be the mixed-integer optimizer.
- MSK_IINF_MIO_TOTAL_NUM_BASIS_CUTS
Number of basis cuts.
- MSK_IINF_MIO_TOTAL_NUM_BRANCH
Number of branches performed during the optimization.
- MSK_IINF_MIO_TOTAL_NUM_CARDGUB_CUTS
Number of cardgub cuts.
- MSK_IINF_MIO_TOTAL_NUM_CLIQUE_CUTS
Number of clique cuts.
- MSK_IINF_MIO_TOTAL_NUM_COEF_REDC_CUTS
Number of coef. redc. cuts.
- MSK_IINF_MIO_TOTAL_NUM_CONTRA_CUTS
Number of contra cuts.
- MSK_IINF_MIO_TOTAL_NUM_CUTS
Total number of cuts generated by the mixed-integer optimizer.
- MSK_IINF_MIO_TOTAL_NUM_DISAGG_CUTS
Number of diasagg cuts.
- MSK_IINF_MIO_TOTAL_NUM_FLOW_COVER_CUTS
Number of flow cover cuts.
- MSK_IINF_MIO_TOTAL_NUM_GCD_CUTS
Number of gcd cuts.
- MSK_IINF_MIO_TOTAL_NUM_GOMORY_CUTS
Number of Gomory cuts.
- MSK_IINF_MIO_TOTAL_NUM_GUB_COVER_CUTS
Number of GUB cover cuts.
- MSK_IINF_MIO_TOTAL_NUM_KNAPSUR_COVER_CUTS
Number of knapsack cover cuts.
- MSK_IINF_MIO_TOTAL_NUM_LATTICE_CUTS
Number of lattice cuts.
- MSK_IINF_MIO_TOTAL_NUM_LIFT_CUTS
Number of lift cuts.
- MSK_IINF_MIO_TOTAL_NUM_OBJ_CUTS
Number of obj cuts.
- MSK_IINF_MIO_TOTAL_NUM_PLAN_LOC_CUTS
Number of loc cuts.
- MSK_IINF_MIO_TOTAL_NUM_RELAX
Number of relaxations solved during the optimization.
- MSK_IINF_MIO_USER_OBJ_CUT
If it is non-zero, then the objective cut is used.
- MSK_IINF_OPT_NUMCON
Number of constraints in the problem solved when the optimizer is called.
- MSK_IINF_OPT_NUMVAR
Number of variables in the problem solved when the optimizer is called
- MSK_IINF_OPTIMIZE_RESPONSE
The reponse code returned by optimize.
- MSK_IINF_RD_NUMCON
Number of constraints read.
- MSK_IINF_RD_NUMCONE
Number of conic constraints read.
- MSK_IINF_RD_NUMINTVAR
Number of integer-constrained variables read.
- MSK_IINF_RD_NUMQ
Number of nonempty Q matrices read.
- MSK_IINF_RD_NUMVAR
Number of variables read.
- MSK_IINF_RD_PROTYPE
Problem type.
- MSK_IINF_SIM_DUAL_DEG_ITER
The number of dual degenerate iterations.
- MSK_IINF_SIM_DUAL_HOTSTART
If 1 then the dual simplex algorithm is solving from an advanced basis.
- MSK_IINF_SIM_DUAL_HOTSTART_LU
If 1 then a valid basis factorization of full rank was located and used by the dual simplex algorithm.
- MSK_IINF_SIM_DUAL_INF_ITER
The number of iterations taken with dual infeasibility.
- MSK_IINF_SIM_DUAL_ITER
Number of dual simplex iterations during the last optimization.
- MSK_IINF_SIM_NETWORK_DUAL_DEG_ITER
The number of dual network degenerate iterations.
- MSK_IINF_SIM_NETWORK_DUAL_HOTSTART
If 1 then the dual network simplex algorithm is solving from an advanced basis.
- MSK_IINF_SIM_NETWORK_DUAL_HOTSTART_LU
If 1 then a valid basis factorization of full rank was located and used by the dual network simplex algorithm.
- MSK_IINF_SIM_NETWORK_DUAL_INF_ITER
The number of iterations taken with dual infeasibility in the network optimizer.
- MSK_IINF_SIM_NETWORK_DUAL_ITER
Number of dual network simplex iterations during the last optimization.
- MSK_IINF_SIM_NETWORK_PRIMAL_DEG_ITER
The number of primal network degenerate iterations.
- MSK_IINF_SIM_NETWORK_PRIMAL_HOTSTART
If 1 then the primal network simplex algorithm is solving from an advanced basis.
- MSK_IINF_SIM_NETWORK_PRIMAL_HOTSTART_LU
If 1 then a valid basis factorization of full rank was located and used by the primal network simplex algorithm.
- MSK_IINF_SIM_NETWORK_PRIMAL_INF_ITER
The number of iterations taken with primal infeasibility in the network optimizer.
- MSK_IINF_SIM_NETWORK_PRIMAL_ITER
Number of primal network simplex iterations during the last optimization.
- MSK_IINF_SIM_NUMCON
Number of constraints in the problem solved by the simplex optimizer.
- MSK_IINF_SIM_NUMVAR
Number of variables in the problem solved by the simplex optimizer.
- MSK_IINF_SIM_PRIMAL_DEG_ITER
The number of primal degenerate iterations.
- MSK_IINF_SIM_PRIMAL_DUAL_DEG_ITER
The number of degenerate major iterations taken by the primal dual simplex algorithm.
- MSK_IINF_SIM_PRIMAL_DUAL_HOTSTART
If 1 then the primal dual simplex algorithm is solving from an advanced basis.
- MSK_IINF_SIM_PRIMAL_DUAL_HOTSTART_LU
If 1 then a valid basis factorization of full rank was located and used by the primal dual simplex algorithm.
- MSK_IINF_SIM_PRIMAL_DUAL_INF_ITER
The number of master iterations with dual infeasibility taken by the primal dual simplex algorithm.
- MSK_IINF_SIM_PRIMAL_DUAL_ITER
Number of primal dual simplex iterations during the last optimization.
- MSK_IINF_SIM_PRIMAL_HOTSTART
If 1 then the primal simplex algorithm is solving from an advanced basis.
- MSK_IINF_SIM_PRIMAL_HOTSTART_LU
If 1 then a valid basis factorization of full rank was located and used by the primal simplex algorithm.
- MSK_IINF_SIM_PRIMAL_INF_ITER
The number of iterations taken with primal infeasibility.
- MSK_IINF_SIM_PRIMAL_ITER
Number of primal simplex iterations during the last optimization.
- MSK_IINF_SIM_SOLVE_DUAL
Is non-zero if dual problem is solved.
- MSK_IINF_SOL_BAS_PROSTA
Problem status of the basic solution. Updated after each optimization.
- MSK_IINF_SOL_BAS_SOLSTA
Solution status of the basic solution. Updated after each optimization.
- MSK_IINF_SOL_INT_PROSTA
Problem status of the integer solution. Updated after each optimization.
- MSK_IINF_SOL_INT_SOLSTA
Solution status of the integer solution. Updated after each optimization.
- MSK_IINF_SOL_ITR_PROSTA
Problem status of the interior-point solution. Updated after each optimization.
- MSK_IINF_SOL_ITR_SOLSTA
Solution status of the interior-point solution. Updated after each optimization.
- MSK_IINF_STO_NUM_A_CACHE_FLUSHES
Number of times the cache of A elements is flushed. A large number implies that maxnumanz is too small as well as an inefficient usage of MOSEK.
- MSK_IINF_STO_NUM_A_REALLOC
Number of times the storage for storing A has been changed. A large value may indicates that memory fragmentation may occur.
- MSK_IINF_STO_NUM_A_TRANSPOSES
Number of times the A matrix is transposed. A large number implies that maxnumanz is too small or an inefficient usage of MOSEK. This will occur in particular if the code alternate between accessing rows and columns of A.