I. Symbolic constants reference


I.1. Constraint or variable access modes

0 MSK_ACC_VAR
  Access data by columns (variable orinted)
1 MSK_ACC_CON
  Access data by rows (constraint oriented)

I.2. Function opcode

1 MSK_ADOP_SUB
  Subtract two operands.
4 MSK_ADOP_POW
  First operand to the power the second operand.
7 MSK_ADOP_RET
  Return one operand.
0 MSK_ADOP_ADD
  Add two operands.
5 MSK_ADOP_EXP
  Exponential function of one oparand.
2 MSK_ADOP_MUL
  Multiply two operands.
3 MSK_ADOP_DIV
  Divide two operands.
6 MSK_ADOP_LOG
  Logarithm function of one operand.

I.3. Function operand type

2 MSK_ADOPTYPE_VARIABLE
  Operand refers to a variable.
0 MSK_ADOPTYPE_NONE
  Operand not used.
1 MSK_ADOPTYPE_CONSTANT
  Operand refers to a constant.
3 MSK_ADOPTYPE_REFERENCE
  Operand refers to the result of another operation.

I.4. Basis identification

1 MSK_BI_ALWAYS
  Basis identification is always performed even if the interior-point optimizer terminates abnormally.
2 MSK_BI_NO_ERROR
  Basis identification is performed if the interior-point optimizer terminates without an error.
0 MSK_BI_NEVER
  Never do basis identification.
3 MSK_BI_IF_FEASIBLE
  Basis identification is not performed if the interior-point optimizer terminates with a problem status saying that the problem is primal or dual infeasible.
4 MSK_BI_OTHER
  Try another BI method.

I.5. Bound keys

2 MSK_BK_FX
  The constraint or variable is fixed.
0 MSK_BK_LO
  The constraint or variable has a finite lower bound and an infinite upper bound.
3 MSK_BK_FR
  The constraint or variable is free.
1 MSK_BK_UP
  The constraint or variable has an infinite lower bound and an finite upper bound.
4 MSK_BK_RA
  The constraint or variable is ranged.

I.6. Specifies the branching direction.

2 MSK_BRANCH_DIR_DOWN
  The mixed-integer optimizer always chooses the down branch first.
1 MSK_BRANCH_DIR_UP
  The mixed-integer optimizer always chooses the up branch first.
0 MSK_BRANCH_DIR_FREE
  The mixed-integer optimizer decides which branch to choose.

I.7. Progress call-back codes

44 MSK_CALLBACK_END_INTPNT
  The call-back function is called when the interior-point optimizer is terminated.
21 MSK_CALLBACK_BEGIN_PRIMAL_DUAL_SIMPLEX_BI
  The call-back function is called from within the basis identification procedure when the primal-dual simplex clean-up phase is started.
48 MSK_CALLBACK_END_NETWORK_PRIMAL_SIMPLEX
  The call-back function is called when the primal network simplex optimizer is terminated.
99 MSK_CALLBACK_READ_ADD_CONS
  A chunk of constraints has been read from a problem file.
115 MSK_CALLBACK_UPDATE_PRIMAL_SIMPLEX_BI
  The call-back function is called from within the basis identification procedure at an intermediate point in the primal simplex clean-up phase. The frequency of the call-backs is controlled by the MSK_IPAR_LOG_SIM_FREQ parameter.
46 MSK_CALLBACK_END_MIO
  The call-back function is called when the mixed-integer optimizer is terminated.
13 MSK_CALLBACK_BEGIN_NETWORK_DUAL_SIMPLEX
  The call-back function is called when the dual network simplex optimizer is started.
35 MSK_CALLBACK_END_CONCURRENT
  Concurrent optimizer is terminated.
93 MSK_CALLBACK_NEW_INT_MIO
  The call-back function is called after a new integer solution has been located by the mixed-integer optimizer.
88 MSK_CALLBACK_IM_PRIMAL_SIMPLEX
  The call-back function is called at an intermediate point in the primal simplex optimizer.
64 MSK_CALLBACK_END_SIMPLEX_NETWORK_DETECT
  The call-back function is called when the network detection procedure is terminated.
47 MSK_CALLBACK_END_NETWORK_DUAL_SIMPLEX
  The call-back function is called when the dual network simplex optimizer is terminated.
72 MSK_CALLBACK_IM_INTPNT
  The call-back function is called at an intermediate stage within the interior-point optimizer where the information database has not been updated.
68 MSK_CALLBACK_IM_DUAL_BI
  The call-back function is called from within the basis identification procedure at an intermediate point in the dual phase.
8 MSK_CALLBACK_BEGIN_FULL_CONVEXITY_CHECK
  Begin full convexity check.
3 MSK_CALLBACK_BEGIN_DUAL_BI
  The call-back function is called from within the basis identification procedure when the dual phase is started.
4 MSK_CALLBACK_BEGIN_DUAL_SENSITIVITY
  Dual sensitivity analysis is started.
79 MSK_CALLBACK_IM_MIO_PRIMAL_SIMPLEX
  The call-back function is called at an intermediate point in the mixed-integer optimizer while running the primal simplex optimizer.
19 MSK_CALLBACK_BEGIN_PRIMAL_BI
  The call-back function is called from within the basis identification procedure when the primal phase is started.
100 MSK_CALLBACK_READ_ADD_QNZ
  A chunk of Q non-zeos has been read from a problem file.
1 MSK_CALLBACK_BEGIN_CONCURRENT
  Concurrent optimizer is started.
104 MSK_CALLBACK_UPDATE_DUAL_BI
  The call-back function is called from within the basis identification procedure at an intermediate point in the dual phase.
70 MSK_CALLBACK_IM_DUAL_SIMPLEX
  The call-back function is called at an intermediate point in the dual simplex optimizer.
11 MSK_CALLBACK_BEGIN_LICENSE_WAIT
  Begin waiting for license.
81 MSK_CALLBACK_IM_NETWORK_PRIMAL_SIMPLEX
  The call-back function is called at an intermediate point in the primal network simplex optimizer.
49 MSK_CALLBACK_END_NETWORK_SIMPLEX
  The call-back function is called when the simplex network optimizer is terminated.
32 MSK_CALLBACK_CONIC
  The call-back function is called from within the conic optimizer after the information database has been updated.
89 MSK_CALLBACK_IM_QO_REFORMULATE
  The call-back function is called at an intermediate stage of the QP to SOCP reformulation.
2 MSK_CALLBACK_BEGIN_CONIC
  The call-back function is called when the conic optimizer is started.
106 MSK_CALLBACK_UPDATE_DUAL_SIMPLEX_BI
  The call-back function is called from within the basis identification procedure at an intermediate point in the dual simplex clean-up phase. The frequency of the call-backs is controlled by the MSK_IPAR_LOG_SIM_FREQ parameter.
51 MSK_CALLBACK_END_OPTIMIZER
  The call-back function is called when the optimizer is terminated.
110 MSK_CALLBACK_UPDATE_PRESOLVE
  The call-back function is called from within the presolve procedure.
90 MSK_CALLBACK_IM_SIMPLEX
  The call-back function is called from within the simplex optimizer at an intermediate point.
102 MSK_CALLBACK_READ_OPF
  The call-back function is called from the OPF reader.
73 MSK_CALLBACK_IM_LICENSE_WAIT
  MOSEK is waiting for a license.
15 MSK_CALLBACK_BEGIN_NETWORK_SIMPLEX
  The call-back function is called when the simplex network optimizer is started.
36 MSK_CALLBACK_END_CONIC
  The call-back function is called when the conic optimizer is terminated.
107 MSK_CALLBACK_UPDATE_NETWORK_DUAL_SIMPLEX
  The call-back function is called in the dual network simplex optimizer.
26 MSK_CALLBACK_BEGIN_QCQO_REFORMULATE
  Begin QCQO reformulation.
38 MSK_CALLBACK_END_DUAL_SENSITIVITY
  Dual sensitivity analysis is terminated.
59 MSK_CALLBACK_END_PRIMAL_SIMPLEX_BI
  The call-back function is called from within the basis identification procedure when the primal clean-up phase is terminated.
101 MSK_CALLBACK_READ_ADD_VARS
  A chunk of variables has been read from a problem file.
103 MSK_CALLBACK_READ_OPF_SECTION
  A chunk of Q non-zeos has been read from a problem file.
74 MSK_CALLBACK_IM_LU
  The call-back function is called from within the LU factorization procedure at an intermediate point.
41 MSK_CALLBACK_END_DUAL_SIMPLEX_BI
  The call-back function is called from within the basis identification procedure when the dual clean-up phase is terminated.
45 MSK_CALLBACK_END_LICENSE_WAIT
  End waiting for license.
84 MSK_CALLBACK_IM_PRESOLVE
  The call-back function is called from within the presolve procedure at an intermediate stage.
5 MSK_CALLBACK_BEGIN_DUAL_SETUP_BI
  The call-back function is called when the dual BI phase is started.
43 MSK_CALLBACK_END_INFEAS_ANA
  The call-back function is called when the infeasibility analyzer is terminated.
92 MSK_CALLBACK_INTPNT
  The call-back function is called from within the interior-point optimizer after the information database has been updated.
111 MSK_CALLBACK_UPDATE_PRIMAL_BI
  The call-back function is called from within the basis identification procedure at an intermediate point in the primal phase.
94 MSK_CALLBACK_NONCOVEX
  The call-back function is called from within the nonconvex optimizer after the information database has been updated.
113 MSK_CALLBACK_UPDATE_PRIMAL_DUAL_SIMPLEX_BI
  The call-back function is called from within the basis identification procedure at an intermediate point in the primal-dual simplex clean-up phase. The frequency of the call-backs is controlled by the MSK_IPAR_LOG_SIM_FREQ parameter.
109 MSK_CALLBACK_UPDATE_NONCONVEX
  The call-back function is called at an intermediate stage within the nonconvex optimizer where the information database has been updated.
37 MSK_CALLBACK_END_DUAL_BI
  The call-back function is called from within the basis identification procedure when the dual phase is terminated.
61 MSK_CALLBACK_END_READ
  MOSEK has finished reading a problem file.
98 MSK_CALLBACK_READ_ADD_CONES
  A chunk of cones has been read from a problem file.
25 MSK_CALLBACK_BEGIN_PRIMAL_SIMPLEX_BI
  The call-back function is called from within the basis identification procedure when the primal simplex clean-up phase is started.
30 MSK_CALLBACK_BEGIN_SIMPLEX_NETWORK_DETECT
  The call-back function is called when the network detection procedure is started.
97 MSK_CALLBACK_READ_ADD_ANZ
  A chunk of A non-zeos has been read from a problem file.
86 MSK_CALLBACK_IM_PRIMAL_DUAL_SIMPLEX
  The call-back function is called at an intermediate point in the primal-dual simplex optimizer.
114 MSK_CALLBACK_UPDATE_PRIMAL_SIMPLEX
  The call-back function is called in the primal simplex optimizer.
33 MSK_CALLBACK_DUAL_SIMPLEX
  The call-back function is called from within the dual simplex optimizer.
71 MSK_CALLBACK_IM_FULL_CONVEXITY_CHECK
  The call-back function is called at an intermediate stage of the full convexity check.
95 MSK_CALLBACK_PRIMAL_SIMPLEX
  The call-back function is called from within the primal simplex optimizer.
16 MSK_CALLBACK_BEGIN_NONCONVEX
  The call-back function is called when the nonconvex optimizer is started.
91 MSK_CALLBACK_IM_SIMPLEX_BI
  The call-back function is called from within the basis identification procedure at an intermediate point in the simplex clean-up phase. The frequency of the call-backs is controlled by the MSK_IPAR_LOG_SIM_FREQ parameter.
6 MSK_CALLBACK_BEGIN_DUAL_SIMPLEX
  The call-back function is called when the dual simplex optimizer started.
24 MSK_CALLBACK_BEGIN_PRIMAL_SIMPLEX
  The call-back function is called when the primal simplex optimizer is started.
50 MSK_CALLBACK_END_NONCONVEX
  The call-back function is called when the nonconvex optimizer is terminated.
23 MSK_CALLBACK_BEGIN_PRIMAL_SETUP_BI
  The call-back function is called when the primal BI setup is started.
17 MSK_CALLBACK_BEGIN_OPTIMIZER
  The call-back function is called when the optimizer is started.
27 MSK_CALLBACK_BEGIN_READ
  MOSEK has started reading a problem file.
82 MSK_CALLBACK_IM_NONCONVEX
  The call-back function is called at an intermediate stage within the nonconvex optimizer where the information database has not been updated.
58 MSK_CALLBACK_END_PRIMAL_SIMPLEX
  The call-back function is called when the primal simplex optimizer is terminated.
55 MSK_CALLBACK_END_PRIMAL_DUAL_SIMPLEX_BI
  The call-back function is called from within the basis identification procedure when the primal-dual clean-up phase is terminated.
66 MSK_CALLBACK_IM_BI
  The call-back function is called from within the basis identification procedure at an intermediate point.
80 MSK_CALLBACK_IM_NETWORK_DUAL_SIMPLEX
  The call-back function is called at an intermediate point in the dual network simplex optimizer.
39 MSK_CALLBACK_END_DUAL_SETUP_BI
  The call-back function is called when the dual BI phase is terminated.
34 MSK_CALLBACK_END_BI
  The call-back function is called when the basis identification procedure is terminated.
57 MSK_CALLBACK_END_PRIMAL_SETUP_BI
  The call-back function is called when the primal BI setup is terminated.
31 MSK_CALLBACK_BEGIN_WRITE
  MOSEK has started writing a problem file.
63 MSK_CALLBACK_END_SIMPLEX_BI
  The call-back function is called from within the basis identification procedure when the simplex clean-up phase is terminated.
56 MSK_CALLBACK_END_PRIMAL_SENSITIVITY
  Primal sensitivity analysis is terminated.
28 MSK_CALLBACK_BEGIN_SIMPLEX
  The call-back function is called when the simplex optimizer is started.
52 MSK_CALLBACK_END_PRESOLVE
  The call-back function is called when the presolve is completed.
96 MSK_CALLBACK_QCONE
  The call-back function is called from within the Qcone optimizer.
9 MSK_CALLBACK_BEGIN_INFEAS_ANA
  The call-back function is called when the infeasibility analyzer is started.
20 MSK_CALLBACK_BEGIN_PRIMAL_DUAL_SIMPLEX
  The call-back function is called when the primal-dual simplex optimizer is started.
22 MSK_CALLBACK_BEGIN_PRIMAL_SENSITIVITY
  Primal sensitivity analysis is started.
7 MSK_CALLBACK_BEGIN_DUAL_SIMPLEX_BI
  The call-back function is called from within the basis identification procedure when the dual simplex clean-up phase is started.
60 MSK_CALLBACK_END_QCQO_REFORMULATE
  End QCQO reformulation.
87 MSK_CALLBACK_IM_PRIMAL_SENSIVITY
  The call-back function is called at an intermediate stage of the primal sensitivity analysis.
65 MSK_CALLBACK_END_WRITE
  MOSEK has finished writing a problem file.
40 MSK_CALLBACK_END_DUAL_SIMPLEX
  The call-back function is called when the dual simplex optimizer is terminated.
112 MSK_CALLBACK_UPDATE_PRIMAL_DUAL_SIMPLEX
  The call-back function is called in the primal-dual simplex optimizer.
29 MSK_CALLBACK_BEGIN_SIMPLEX_BI
  The call-back function is called from within the basis identification procedure when the simplex clean-up phase is started.
10 MSK_CALLBACK_BEGIN_INTPNT
  The call-back function is called when the interior-point optimizer is started.
69 MSK_CALLBACK_IM_DUAL_SENSIVITY
  The call-back function is called at an intermediate stage of the dual sensitivity analysis.
62 MSK_CALLBACK_END_SIMPLEX
  The call-back function is called when the simplex optimizer is terminated.
53 MSK_CALLBACK_END_PRIMAL_BI
  The call-back function is called from within the basis identification procedure when the primal phase is terminated.
75 MSK_CALLBACK_IM_MIO
  The call-back function is called at an intermediate point in the mixed-integer optimizer.
105 MSK_CALLBACK_UPDATE_DUAL_SIMPLEX
  The call-back function is called in the dual simplex optimizer.
77 MSK_CALLBACK_IM_MIO_INTPNT
  The call-back function is called at an intermediate point in the mixed-integer optimizer while running the interior-point optimizer.
54 MSK_CALLBACK_END_PRIMAL_DUAL_SIMPLEX
  The call-back function is called when the primal-dual simplex optimizer is terminated.
67 MSK_CALLBACK_IM_CONIC
  The call-back function is called at an intermediate stage within the conic optimizer where the information database has not been updated.
78 MSK_CALLBACK_IM_MIO_PRESOLVE
  The call-back function is called at an intermediate point in the mixed-integer optimizer while running the presolve.
0 MSK_CALLBACK_BEGIN_BI
  The basis identification procedure has been started.
76 MSK_CALLBACK_IM_MIO_DUAL_SIMPLEX
  The call-back function is called at an intermediate point in the mixed-integer optimizer while running the dual simplex optimizer.
116 MSK_CALLBACK_WRITE_OPF
  The call-back function is called from the OPF writer.
108 MSK_CALLBACK_UPDATE_NETWORK_PRIMAL_SIMPLEX
  The call-back function is called in the primal network simplex optimizer.
42 MSK_CALLBACK_END_FULL_CONVEXITY_CHECK
  End full convexity check.
83 MSK_CALLBACK_IM_ORDER
  The call-back function is called from within the matrix ordering procedure at an intermediate point.
85 MSK_CALLBACK_IM_PRIMAL_BI
  The call-back function is called from within the basis identification procedure at an intermediate point in the primal phase.
18 MSK_CALLBACK_BEGIN_PRESOLVE
  The call-back function is called when the presolve is started.
12 MSK_CALLBACK_BEGIN_MIO
  The call-back function is called when the mixed-integer optimizer is started.
14 MSK_CALLBACK_BEGIN_NETWORK_PRIMAL_SIMPLEX
  The call-back function is called when the primal network simplex optimizer is started.

I.8. Types of convexity checks.

1 MSK_CHECK_CONVEXITY_SIMPLE
  Perform simple and fast convexity check.
0 MSK_CHECK_CONVEXITY_NONE
  No convexity check.
2 MSK_CHECK_CONVEXITY_FULL
  Perform a full convexity check.

I.9. Compression types

2 MSK_COMPRESS_GZIP
  The type of compression used is gzip compatible.
0 MSK_COMPRESS_NONE
  No compression is used.
1 MSK_COMPRESS_FREE
  The type of compression used is chosen automatically.

I.10. Cone types

0 MSK_CT_QUAD
  The cone is a quadratic cone.
1 MSK_CT_RQUAD
  The cone is a rotated quadratic cone.

I.11. CPU type

8 MSK_CPU_POWERPC_G5
  A G5 PowerPC CPU.
9 MSK_CPU_INTEL_PM
  An Intel PM cpu.
1 MSK_CPU_GENERIC
  An generic CPU type for the platform
0 MSK_CPU_UNKNOWN
  An unknown CPU.
7 MSK_CPU_AMD_OPTERON
  An AMD Opteron (64 bit).
6 MSK_CPU_INTEL_ITANIUM2
  An Intel Itanium2.
4 MSK_CPU_AMD_ATHLON
  An AMD Athlon.
5 MSK_CPU_HP_PARISC20
  An HP PA RISC version 2.0 CPU.
3 MSK_CPU_INTEL_P4
  An Intel Pentium P4 or Intel Xeon.
2 MSK_CPU_INTEL_P3
  An Intel Pentium P3.
10 MSK_CPU_INTEL_CORE2
  An Intel CORE2 cpu.

I.12. Data format types

5 MSK_DATA_FORMAT_XML
  The data file is an XML formatted file.
6 MSK_DATA_FORMAT_FREE_MPS
  The data data a free MPS formatted file.
0 MSK_DATA_FORMAT_EXTENSION
  The file extension is used to determine the data file format.
1 MSK_DATA_FORMAT_MPS
  The data file is MPS formatted.
2 MSK_DATA_FORMAT_LP
  The data file is LP formatted.
3 MSK_DATA_FORMAT_MBT
  The data file is a MOSEK binary task file.
4 MSK_DATA_FORMAT_OP
  The data file is an optimization problem formatted file.

I.13. Double information items

13 MSK_DINF_INTPNT_PRIMAL_FEAS
  Primal feasibility measure reported by the interior-point or Qcone optimizers. (For the interior-point optimizer this measure does not directly related to the original problem because a homogeneous model is employed).
58 MSK_DINF_SOL_ITR_MAX_PCNI
  Maximal primal cone infeasibility in the interior-point solution. Updated at the end of the optimization.
32 MSK_DINF_RD_TIME
  Time spent reading the data file.
28 MSK_DINF_PRESOLVE_ELI_TIME
  Total time spent in the eliminator since the presolve was invoked.
22 MSK_DINF_MIO_OPTIMIZER_TIME
  Time spent in the optimizer while solving the relaxtions.
10 MSK_DINF_INTPNT_FACTOR_NUM_FLOPS
  An estimate of the number of flops used in the factorization.
25 MSK_DINF_MIO_TIME
  Time spent in the mixed-integer optimizer.
4 MSK_DINF_BI_DUAL_TIME
  Time spent within the dual phase basis identification procedure since its invocation.
37 MSK_DINF_SIM_NETWORK_TIME
  Time spent in the network simplex optimizer since invoking it.
30 MSK_DINF_PRESOLVE_TIME
  Total time (in seconds) spent in the presolve since it was invoked.
29 MSK_DINF_PRESOLVE_LINDEP_TIME
  Total time spent in the linear dependency checker since the presolve was invoked.
33 MSK_DINF_SIM_DUAL_TIME
  Time spent in the dual simplex optimizer since invoking it.
60 MSK_DINF_SOL_ITR_MAX_PINTI
  Maximal primal integer infeasibility in the interior-point solution. Updated at the end of the optimization.
38 MSK_DINF_SIM_OBJ
  Objective value reported by the simplex optimizer.
21 MSK_DINF_MIO_OBJ_REL_GAP
  Given that the mixed-integer optimizer has computed a feasible solution and a bound on the optimal objective value, then this item contains the relative gap defined by
\begin{displaymath}\nonumber{}\frac{|\mbox{(objective value of feasible solution)}-\mbox{(objective bound)}|}{\max (\delta ,|\mbox{(objective value of feasible solution)}|)}.\end{displaymath}
where [[MathCmd 339]] is given by the paramater MSK_DPAR_MIO_REL_GAP_CONST. Otherwise it has the value -1.0.
48 MSK_DINF_SOL_BAS_PRIMAL_OBJ
  Primal objective value of the basic solution. Updated at the end of the optimization.
17 MSK_DINF_MIO_HEURISTIC_TIME
  Time spent in the optimizer while solving the relaxtions.
57 MSK_DINF_SOL_ITR_MAX_PBI
  Maximal primal bound infeasibility in the interior-point solution. Updated at the end of the optimization.
45 MSK_DINF_SOL_BAS_MAX_PBI
  Maximal primal bound infeasibility in the basic solution. Updated at the end of the optimization.
27 MSK_DINF_OPTIMIZER_TIME
  Total time spent in the optimizer since it was invoked.
55 MSK_DINF_SOL_ITR_MAX_DCNI
  Maximal dual cone infeasibility in the interior-point solution. Updated at the end of the optimization.
24 MSK_DINF_MIO_ROOT_PRESOLVE_TIME
  Time spent in while presolveing the root relaxation.
9 MSK_DINF_INTPNT_DUAL_OBJ
  Dual objective value reported by the interior-point or Qcone optimizer.
15 MSK_DINF_INTPNT_TIME
  Time spent within the interior-point optimizer since its invocation.
16 MSK_DINF_MIO_CONSTRUCT_SOLUTION_OBJ
  If MOSEK has successfully constructed an integer feasible solution, then this item contains the optimal objective value corresponding to the feasible solution.
34 MSK_DINF_SIM_FEAS
  Feasibility measure reported by the simplex optimizer.
56 MSK_DINF_SOL_ITR_MAX_DEQI
  Maximal dual equality infeasibility in the interior-point solution. Updated at the end of the optimization.
40 MSK_DINF_SIM_PRIMAL_TIME
  Time spent in the primal simplex optimizer since invoking it.
41 MSK_DINF_SIM_TIME
  Time spent in the simplex optimizer since invoking it.
36 MSK_DINF_SIM_NETWORK_PRIMAL_TIME
  Time spent in the primal network simplex optimizer since invoking it.
47 MSK_DINF_SOL_BAS_MAX_PINTI
  Maximal primal integer infeasibility in the basic solution. Updated at the end of the optimization.
51 MSK_DINF_SOL_INT_MAX_PINTI
  Maximal primal integer infeasibility in the integer solution. Updated at the end of the optimization.
3 MSK_DINF_BI_CLEAN_TIME
  Time spent within the clean-up phase of the basis identification procedure since its invocation.
31 MSK_DINF_QCQO_REFORMULATE_TIME
  Time spent with QP reformulation.
53 MSK_DINF_SOL_ITR_DUAL_OBJ
  Dual objective value of the interior-point solution. Updated at the end of the optimization.
49 MSK_DINF_SOL_INT_MAX_PBI
  Maximal primal bound infeasibility in the integer solution. Updated at the end of the optimization.
8 MSK_DINF_INTPNT_DUAL_FEAS
  Dual feasibility measure reported by the interior-point and Qcone optimizer. (For the interior-point optimizer this measure does not directly related to the original problem because a homogeneous model is employed.)
7 MSK_DINF_CONCURRENT_TIME
  Time spent within the concurrent optimizer since its invocation.
11 MSK_DINF_INTPNT_KAP_DIV_TAU
  This measure should converge to zero if the problem has a primal-dual optimal solution or to infinity if problem is (strictly) primal or dual infeasible. In case the measure is converging towards a positive but bounded constant the problem is usually ill-posed.
50 MSK_DINF_SOL_INT_MAX_PEQI
  Maximal primal equality infeasibility in the basic solution. Updated at the end of the optimization.
61 MSK_DINF_SOL_ITR_PRIMAL_OBJ
  Primal objective value of the interior-point solution. Updated at the end of the optimization.
35 MSK_DINF_SIM_NETWORK_DUAL_TIME
  Time spent in the dual network simplex optimizer since invoking it.
20 MSK_DINF_MIO_OBJ_INT
  The primal objective value corresponding to the best integer feasible solution. Please note that at least one integer feasible solution must have located i.e. check MSK_IINF_MIO_NUM_INT_SOLUTIONS.
26 MSK_DINF_MIO_USER_OBJ_CUT
  If the objective cut is used, then this information item has the value of the cut.
43 MSK_DINF_SOL_BAS_MAX_DBI
  Maximal dual bound infeasibility in the basic solution. Updated at the end of the optimization.
46 MSK_DINF_SOL_BAS_MAX_PEQI
  Maximal primal equality infeasibility in the basic solution. Updated at the end of the optimization.
19 MSK_DINF_MIO_OBJ_BOUND
  The best known bound on the objective function. This value is undefined until at least one relaxation has been solved: To see if this is the case check that MSK_IINF_MIO_NUM_RELAX is stricly positive.
0 MSK_DINF_BI_CLEAN_DUAL_TIME
  Time spent within the dual clean-up optimizer of the basis identification procedure since its invocation.
6 MSK_DINF_BI_TIME
  Time spent within the basis identification procedure since its invocation.
42 MSK_DINF_SOL_BAS_DUAL_OBJ
  Dual objective value of the basic solution. Updated at the end of the optimization.
1 MSK_DINF_BI_CLEAN_PRIMAL_DUAL_TIME
  Time spent within the primal-dual clean-up optimizer of the basis identification procedure since its invocation.
14 MSK_DINF_INTPNT_PRIMAL_OBJ
  Primal objective value reported by the interior-point or Qcone optimizer.
12 MSK_DINF_INTPNT_ORDER_TIME
  Order time (in seconds).
52 MSK_DINF_SOL_INT_PRIMAL_OBJ
  Primal objective value of the integer solution. Updated at the end of the optimization.
5 MSK_DINF_BI_PRIMAL_TIME
  Time spent within the primal phase of the basis identification procedure since its invocation.
18 MSK_DINF_MIO_OBJ_ABS_GAP
  Given the mixed-integer optimizer has computed a feasible solution and a bound on the optimal objective value, then this item contains the absolute gap defined by
\begin{displaymath}\nonumber{}|\mbox{(objective value of feasible solution)}-\mbox{(objective bound)}|.\end{displaymath}
Otherwise it has the value -1.0.
44 MSK_DINF_SOL_BAS_MAX_DEQI
  Maximal dual equality infeasibility in the basic solution. Updated at the end of the optimization.
59 MSK_DINF_SOL_ITR_MAX_PEQI
  Maximal primal equality infeasibility in the interior-point solution. Updated at the end of the optimization.
39 MSK_DINF_SIM_PRIMAL_DUAL_TIME
  Time spent in the primal-dual simplex optimizer optimizer since invoking it.
2 MSK_DINF_BI_CLEAN_PRIMAL_TIME
  Time spent within the primal clean-up optimizer of the basis identification procedure since its invocation.
54 MSK_DINF_SOL_ITR_MAX_DBI
  Maximal dual bound infeasibility in the interior-point solution. Updated at the end of the optimization.
23 MSK_DINF_MIO_ROOT_OPTIMIZER_TIME
  Time spent in the optimizer while solving the root relaxation.

I.14. Double parameters

40 MSK_DPAR_LOWER_OBJ_CUT_FINITE_TRH
  If the lower objective cut is less than the value of this parameter value, then the lower objective cut i.e. MSK_DPAR_LOWER_OBJ_CUT is treated as -.
43 MSK_DPAR_MIO_MAX_TIME
  This parameter limits the maximum time spent by the mixed-integer optimizer. A negative number means infinity.
2 MSK_DPAR_BASIS_TOL_S
  Maximum absolute dual bound violation in an optimal basic solution.
60 MSK_DPAR_PRESOLVE_TOL_S
  Absolute zero tolerance employed for [[MathCmd 667]] in the presolve.
65 MSK_DPAR_UPPER_OBJ_CUT
  If either a primal or dual feasible solution is found proving that the optimal objective value is outside, [MSK_DPAR_LOWER_OBJ_CUT, MSK_DPAR_UPPER_OBJ_CUT], then MOSEK is terminated.
16 MSK_DPAR_INTPNT_CO_TOL_DFEAS
  Dual feasibility tolerance used by the conic interior-point optimizer.
8 MSK_DPAR_DATA_TOL_AIJ_LARGE
  An element in A which is larger than this value in absolute size causes a warning message to be printed.
49 MSK_DPAR_MIO_TOL_ABS_GAP
  Absolute optimality tolerance employed by the mixed-integer optimizer.
66 MSK_DPAR_UPPER_OBJ_CUT_FINITE_TRH
  If the upper objective cut is greater than the value of this value parameter, then the the upper objective cut MSK_DPAR_UPPER_OBJ_CUT is treated as .
50 MSK_DPAR_MIO_TOL_ABS_RELAX_INT
  Absolute relaxation tolerance of the integer constraints. I.e. [[MathCmd 664]] is less than the tolerance then the integer restrictions assumed to be satisfied.
56 MSK_DPAR_NONCONVEX_TOL_OPT
  Optimality tolerance used by the nonconvex optimizer.
55 MSK_DPAR_NONCONVEX_TOL_FEAS
  Feasibility tolerance used by the nonconvex optimizer.
64 MSK_DPAR_SIMPLEX_ABS_TOL_PIV
  Absolute pivot tolerance employed by the simplex optimizers.
42 MSK_DPAR_MIO_HEURISTIC_TIME
  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.
5 MSK_DPAR_CHECK_CONVEXITY_REL_TOL
  This parameter controls when the full convexity check declares a problem to be non-convex. Increasing this tolerance relaxes the criteria for declaring the problem non-convex.A problem is declared non-convex if negative (positive) pivot elements are detected in the cholesky factor of a matrix which is required to be PSD (NSD). This parameter controles how much this non-negativity requirement may be violated.If [[MathCmd 659]] is the pivot element for column i, then the matrix Q is considered to not be PSD if:
\begin{displaymath}\nonumber{}d_{i}\leq{}-|Q_{{ii}}|*\mathtt{check\_convexity\_rel\_tol}\end{displaymath}
61 MSK_DPAR_PRESOLVE_TOL_X
  Absolute zero tolerance employed for [[MathCmd 199]] in the presolve.
24 MSK_DPAR_INTPNT_NL_TOL_MU_RED
  Relative complementarity gap tolerance.
46 MSK_DPAR_MIO_NEAR_TOL_REL_GAP
  The mixed-integer optimizer is terminated when this tolerance is satisfied. This termination criteria is delayed. See MSK_DPAR_MIO_DISABLE_TERM_TIME for details.
6 MSK_DPAR_DATA_TOL_AIJ
  Absolute zero tolerance for elements in A. If any value [[MathCmd 661]] is smaller than this parameter in absolute terms MOSEK will treat the values as zero and generate a warning.
15 MSK_DPAR_FEASREPAIR_TOL
  Tolerance for constraint enforcing upper bound on sum of weighted violations in feasibility repair.
30 MSK_DPAR_INTPNT_TOL_DSAFE
  Controls the initial dual starting point used by the interior-point optimizer. If the interior-point optimizer converges slowly.
51 MSK_DPAR_MIO_TOL_FEAS
  Feasibility tolerance for mixed integer solver. Any solution with maximum infeasibility below this value will be considered feasible.
31 MSK_DPAR_INTPNT_TOL_INFEAS
  Controls when the optimizer declares the model primal or dual infeasible. A small number means the optimizer gets more conservative about declaring the model infeasible.
25 MSK_DPAR_INTPNT_NL_TOL_NEAR_REL
  If the MOSEK nonlinear interior-point optimizer cannot compute a solution that has the prescribed accuracy, then it will multiply the termination tolerances with value of this parameter. If the solution then satisfies the termination criteria, then the solution is denoted near optimal, near feasible and so forth.
57 MSK_DPAR_OPTIMIZER_MAX_TIME
  Maximum amount of time the optimizer is allowed to spent on the optimization. A negative number means infinity.
14 MSK_DPAR_DATA_TOL_X
  Zero tolerance for constraints and variables i.e. if the distance between the lower and upper bound is less than this value, then the lower and lower bound is considered identical.
0 MSK_DPAR_ANA_SOL_INFEAS_TOL
  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.
47 MSK_DPAR_MIO_REL_ADD_CUT_LIMITED
  Controls how many cuts the mixed-integer optimizer is allowed to add to the problem. Let [[MathCmd 662]] be the value of this parameter and m the number constraints, then mixed-integer optimizer is allowed to [[MathCmd 663]] cuts.
32 MSK_DPAR_INTPNT_TOL_MU_RED
  Relative complementarity gap tolerance.
18 MSK_DPAR_INTPNT_CO_TOL_MU_RED
  Relative complementarity gap tolerance feasibility tolerance used by the conic interior-point optimizer.
21 MSK_DPAR_INTPNT_CO_TOL_REL_GAP
  Relative gap termination tolerance used by the conic interior-point optimizer.
39 MSK_DPAR_LOWER_OBJ_CUT
  If either a primal or dual feasible solution is found proving that the optimal objective value is outside, the interval [MSK_DPAR_LOWER_OBJ_CUT, MSK_DPAR_UPPER_OBJ_CUT], then MOSEK is terminated.
41 MSK_DPAR_MIO_DISABLE_TERM_TIME
  The termination criteria governed by 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.
37 MSK_DPAR_INTPNT_TOL_REL_STEP
  Relative step size to the boundary for linear and quadratic optimization problems.
54 MSK_DPAR_MIO_TOL_X
  Absolute solution tolerance used in mixed-integer optimizer.
11 MSK_DPAR_DATA_TOL_C_HUGE
  An element in c which is larger than the value of this parameter in absolute terms is considered to be huge and generates an error.
59 MSK_DPAR_PRESOLVE_TOL_LIN_DEP
  Controls when a constraint is determined to be linearly dependent.
63 MSK_DPAR_SIM_LU_TOL_REL_PIV
  Relative pivot tolerance employed when computing the LU factorization of the basis in the simplex optimizers and in the basis identification procedure.A value closer to 1.0 generally improves numerical stability but typically also implies an increase in the computational work.
12 MSK_DPAR_DATA_TOL_CJ_LARGE
  An element in c which is larger than this value in absolute terms causes a warning message to be printed.
28 MSK_DPAR_INTPNT_NL_TOL_REL_STEP
  Relative step size to the boundary for general nonlinear optimization problems.
38 MSK_DPAR_INTPNT_TOL_STEP_SIZE
  If the step size falls below the value of this parameter, then the interior-point optimizer assumes that it is stalled. It it does not not make any progress.
34 MSK_DPAR_INTPNT_TOL_PFEAS
  Primal feasibility tolerance used for linear and quadratic optimization problems.
1 MSK_DPAR_BASIS_REL_TOL_S
  Maximum relative dual bound violation allowed in an optimal basic solution.
17 MSK_DPAR_INTPNT_CO_TOL_INFEAS
  Controls when the conic interior-point optimizer declares the model primal or dual infeasible. A small number means the optimizer gets more conservative about declaring the model infeasible.
48 MSK_DPAR_MIO_REL_GAP_CONST
  This value is used to compute the relative gap for the solution to an integer optimization problem.
58 MSK_DPAR_PRESOLVE_TOL_AIJ
  Absolute zero tolerance employed for [[MathCmd 569]] in the presolve.
44 MSK_DPAR_MIO_MAX_TIME_APRX_OPT
  Number of seconds spent by the mixed-integer optimizer before the MSK_DPAR_MIO_TOL_REL_RELAX_INT is applied.
33 MSK_DPAR_INTPNT_TOL_PATH
  Controls how close the interior-point optimizer follows the central path. A large value of this parameter means the central is followed very closely. On numerical unstable problems it may be worthwhile to increase this parameter.
22 MSK_DPAR_INTPNT_NL_MERIT_BAL
  Controls if the complementarity and infeasibility is converging to zero at about equal rates.
3 MSK_DPAR_BASIS_TOL_X
  Maximum absolute primal bound violation allowed in an optimal basic solution.
36 MSK_DPAR_INTPNT_TOL_REL_GAP
  Relative gap termination tolerance.
7 MSK_DPAR_DATA_TOL_AIJ_HUGE
  An element in A which is larger than this value in absolute size causes an error.
10 MSK_DPAR_DATA_TOL_BOUND_WRN
  If a bound value is larger than this value in absolute size, then a warning message is issued.
9 MSK_DPAR_DATA_TOL_BOUND_INF
  Any bound which in absolute value is greater than this parameter is considered infinite.
35 MSK_DPAR_INTPNT_TOL_PSAFE
  Controls the initial primal starting point used by the interior-point optimizer. If the interior-point optimizer converges slowly and/or the constraint or variable bounds are very large, then it may be worthwhile to increase this value.
19 MSK_DPAR_INTPNT_CO_TOL_NEAR_REL
  If MOSEK cannot compute a solution that has the prescribed accuracy, then it will multiply the termination tolerances with value of this parameter. If the solution then satisfies the termination criteria, then the solution is denoted near optimal, near feasible and so forth.
4 MSK_DPAR_CALLBACK_FREQ
  Controls the time between calls to the progress call-back function. Hence, if the value of this parameter is for example 10, then the call-back is called approximately each 10 seconds. A negative value is equivalent to infinity.In general frequent call-backs may hurt the performance.
26 MSK_DPAR_INTPNT_NL_TOL_PFEAS
  Primal feasibility tolerance used when a nonlinear model is solved.
23 MSK_DPAR_INTPNT_NL_TOL_DFEAS
  Dual feasibility tolerance used when a nonlinear model is solved.
52 MSK_DPAR_MIO_TOL_REL_GAP
  Relative optimality tolerance employed by the mixed-integer optimizer.
29 MSK_DPAR_INTPNT_TOL_DFEAS
  Dual feasibility tolerance used for linear and quadratic optimization problems.
45 MSK_DPAR_MIO_NEAR_TOL_ABS_GAP
  Relaxed absolute optimality tolerance employed by the mixed-integer optimizer. This termination criteria is delayed. See MSK_DPAR_MIO_DISABLE_TERM_TIME for details.
53 MSK_DPAR_MIO_TOL_REL_RELAX_INT
  Relative relaxation tolerance of the integer constraints. I.e [[MathCmd 665]] is less than the tolerance times |x| then the integer restrictions assumed to be satisfied.
62 MSK_DPAR_QCQO_REFORMULATE_REL_DROP_TOL
  This parameter determines when columns are dropped in incomplete cholesky factorization doing reformulation of quadratic problems.
13 MSK_DPAR_DATA_TOL_QIJ
  Absolute zero tolerance for elements in Q matrices.
27 MSK_DPAR_INTPNT_NL_TOL_REL_GAP
  Relative gap termination tolerance for nonlinear problems.
20 MSK_DPAR_INTPNT_CO_TOL_PFEAS
  Primal feasibility tolerance used by the conic interior-point optimizer.

I.15. Feasibility repair types

0 MSK_FEASREPAIR_OPTIMIZE_NONE
  Do not optimize the feasibility repair problem.
2 MSK_FEASREPAIR_OPTIMIZE_COMBINED
  Minimize with original objective subject to minimal weighted violation of bounds.
1 MSK_FEASREPAIR_OPTIMIZE_PENALTY
  Minimize weighted sum of violations.

I.16. License feature

2 MSK_FEATURE_PTOM
  Mixed-integer extension.
1 MSK_FEATURE_PTON
  Nonlinear extension.
0 MSK_FEATURE_PTS
  Base system.
3 MSK_FEATURE_PTOX
  Non-convex extension.

I.17. Integer information items.

57 MSK_IINF_RD_NUMINTVAR
  Number of integer-constrained variables read.
90 MSK_IINF_SOL_BAS_SOLSTA
  Solution status of the basic solution. Updated after each optimization.
97 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.
48 MSK_IINF_MIO_TOTAL_NUM_OBJ_CUTS
  Number of obj cuts.
88 MSK_IINF_SIM_SOLVE_DUAL
  Is non-zero if dual problem is solved.
30 MSK_IINF_MIO_NUMCON
  Number of constraints in the problem solved be the mixed-integer optimizer.
53 MSK_IINF_OPT_NUMVAR
  Number of variables in the problem solved when the optimizer is called
77 MSK_IINF_SIM_NUMVAR
  Number of variables in the problem solved by the simplex optimizer.
46 MSK_IINF_MIO_TOTAL_NUM_LATTICE_CUTS
  Number of lattice cuts.
71 MSK_IINF_SIM_NETWORK_PRIMAL_DEG_ITER
  The number of primal network degenerate iterations.
58 MSK_IINF_RD_NUMQ
  Number of nonempty Q matrices read.
0 MSK_IINF_ANA_PRO_NUM_CON
  Number of constraints in the problem.
19 MSK_IINF_INTPNT_FACTOR_NUM_OFFCOL
  Number of columns in the constraint matrix (or Jacobian) that has an offending structure.
11 MSK_IINF_ANA_PRO_NUM_VAR_INT
  Number of general integer variables.
69 MSK_IINF_SIM_NETWORK_DUAL_INF_ITER
  The number of iterations taken with dual infeasibility in the network optimizer.
8 MSK_IINF_ANA_PRO_NUM_VAR_CONT
  Number of continuous variables.
65 MSK_IINF_SIM_DUAL_ITER
  Number of dual simplex iterations during the last optimization.
61 MSK_IINF_SIM_DUAL_DEG_ITER
  The number of dual degenerate iterations.
20 MSK_IINF_INTPNT_ITER
  Number of interior-point iterations since invoking the interior-point optimizer.
45 MSK_IINF_MIO_TOTAL_NUM_KNAPSUR_COVER_CUTS
  Number of knapsack cover cuts.
33 MSK_IINF_MIO_TOTAL_NUM_BASIS_CUTS
  Number of basis cuts.
76 MSK_IINF_SIM_NUMCON
  Number of constraints in the problem solved by the simplex optimizer.
83 MSK_IINF_SIM_PRIMAL_DUAL_ITER
  Number of primal dual simplex iterations during the last optimization.
5 MSK_IINF_ANA_PRO_NUM_CON_UP
  Number of constraints with an upper bound and an infinite lower bound.
36 MSK_IINF_MIO_TOTAL_NUM_CLIQUE_CUTS
  Number of clique cuts.
80 MSK_IINF_SIM_PRIMAL_DUAL_HOTSTART
  If 1 then the primal dual simplex algorithm is solving from an advanced basis.
22 MSK_IINF_INTPNT_SOLVE_DUAL
  Non-zero if the interior-point optimizer is solving the dual problem.
67 MSK_IINF_SIM_NETWORK_DUAL_HOTSTART
  If 1 then the dual network simplex algorithm is solving from an advanced basis.
54 MSK_IINF_OPTIMIZE_RESPONSE
  The reponse code returned by optimize.
93 MSK_IINF_SOL_ITR_PROSTA
  Problem status of the interior-point solution. Updated after each optimization.
60 MSK_IINF_RD_PROTYPE
  Problem type.
94 MSK_IINF_SOL_ITR_SOLSTA
  Solution status of the interior-point solution. Updated after each optimization.
2 MSK_IINF_ANA_PRO_NUM_CON_FR
  Number of unbounded constraints.
81 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.
31 MSK_IINF_MIO_NUMINT
  Number of integer variables in the problem solved be the mixed-integer optimizer.
35 MSK_IINF_MIO_TOTAL_NUM_CARDGUB_CUTS
  Number of cardgub cuts.
38 MSK_IINF_MIO_TOTAL_NUM_CONTRA_CUTS
  Number of contra cuts.
49 MSK_IINF_MIO_TOTAL_NUM_PLAN_LOC_CUTS
  Number of loc cuts.
64 MSK_IINF_SIM_DUAL_INF_ITER
  The number of iterations taken with dual infeasibility.
32 MSK_IINF_MIO_NUMVAR
  Number of variables in the problem solved be the mixed-integer optimizer.
27 MSK_IINF_MIO_NUM_CUTS
  Number of cuts generated by the mixed-integer optimizer.
23 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.
6 MSK_IINF_ANA_PRO_NUM_VAR
  Number of variables in the problem.
95 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.
91 MSK_IINF_SOL_INT_PROSTA
  Problem status of the integer solution. Updated after each optimization.
66 MSK_IINF_SIM_NETWORK_DUAL_DEG_ITER
  The number of dual network degenerate iterations.
92 MSK_IINF_SOL_INT_SOLSTA
  Solution status of the integer solution. Updated after each optimization.
15 MSK_IINF_CACHE_SIZE_L1
  L1 cache size used.
16 MSK_IINF_CACHE_SIZE_L2
  L2 cache size used.
59 MSK_IINF_RD_NUMVAR
  Number of variables read.
79 MSK_IINF_SIM_PRIMAL_DUAL_DEG_ITER
  The number of degenerate major iterations taken by the primal dual simplex algorithm.
12 MSK_IINF_ANA_PRO_NUM_VAR_LO
  Number of variables with a lower bound and an infinite upper bound.
47 MSK_IINF_MIO_TOTAL_NUM_LIFT_CUTS
  Number of lift cuts.
89 MSK_IINF_SOL_BAS_PROSTA
  Problem status of the basic solution. Updated after each optimization.
75 MSK_IINF_SIM_NETWORK_PRIMAL_ITER
  Number of primal network simplex iterations during the last optimization.
3 MSK_IINF_ANA_PRO_NUM_CON_LO
  Number of constraints with a lower bound and an infinite upper bound.
44 MSK_IINF_MIO_TOTAL_NUM_GUB_COVER_CUTS
  Number of GUB cover cuts.
68 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.
74 MSK_IINF_SIM_NETWORK_PRIMAL_INF_ITER
  The number of iterations taken with primal infeasibility in the network optimizer.
84 MSK_IINF_SIM_PRIMAL_HOTSTART
  If 1 then the primal simplex algorithm is solving from an advanced basis.
26 MSK_IINF_MIO_NUM_BRANCH
  Number of branches performed during the optimization.
96 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.
29 MSK_IINF_MIO_NUM_RELAX
  Number of relaxations solved during the optimization.
34 MSK_IINF_MIO_TOTAL_NUM_BRANCH
  Number of branches performed during the optimization.
42 MSK_IINF_MIO_TOTAL_NUM_GCD_CUTS
  Number of gcd cuts.
41 MSK_IINF_MIO_TOTAL_NUM_FLOW_COVER_CUTS
  Number of flow cover cuts.
28 MSK_IINF_MIO_NUM_INT_SOLUTIONS
  Number of integer feasible solutions that has been found.
85 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.
18 MSK_IINF_CPU_TYPE
  The type of cpu detected.
1 MSK_IINF_ANA_PRO_NUM_CON_EQ
  Number of equality constraints.
13 MSK_IINF_ANA_PRO_NUM_VAR_RA
  Number of variables with finite lower and upper bounds.
86 MSK_IINF_SIM_PRIMAL_INF_ITER
  The number of iterations taken with primal infeasibility.
55 MSK_IINF_RD_NUMCON
  Number of constraints read.
56 MSK_IINF_RD_NUMCONE
  Number of conic constraints read.
10 MSK_IINF_ANA_PRO_NUM_VAR_FR
  Number of free variables.
25 MSK_IINF_MIO_NUM_ACTIVE_NODES
  Number of active nodes in the branch and bound tree.
50 MSK_IINF_MIO_TOTAL_NUM_RELAX
  Number of relaxations solved during the optimization.
7 MSK_IINF_ANA_PRO_NUM_VAR_BIN
  Number of binary (0-1) variables.
73 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.
87 MSK_IINF_SIM_PRIMAL_ITER
  Number of primal simplex iterations during the last optimization.
62 MSK_IINF_SIM_DUAL_HOTSTART
  If 1 then the dual simplex algorithm is solving from an advanced basis.
24 MSK_IINF_MIO_INITIAL_SOLUTION
  Is non-zero if an initial integer solution is specified.
21 MSK_IINF_INTPNT_NUM_THREADS
  Number of threads that the interior-point optimizer is using.
63 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.
14 MSK_IINF_ANA_PRO_NUM_VAR_UP
  Number of variables with an upper bound and an infinite lower bound. This value is set by
70 MSK_IINF_SIM_NETWORK_DUAL_ITER
  Number of dual network simplex iterations during the last optimization.
9 MSK_IINF_ANA_PRO_NUM_VAR_EQ
  Number of fixed variables.
17 MSK_IINF_CONCURRENT_FASTEST_OPTIMIZER
  The type of the optimizer that finished first in a concurrent optimization.
51 MSK_IINF_MIO_USER_OBJ_CUT
  If it is non-zero, then the objective cut is used.
43 MSK_IINF_MIO_TOTAL_NUM_GOMORY_CUTS
  Number of Gomory cuts.
72 MSK_IINF_SIM_NETWORK_PRIMAL_HOTSTART
  If 1 then the primal network simplex algorithm is solving from an advanced basis.
40 MSK_IINF_MIO_TOTAL_NUM_DISAGG_CUTS
  Number of diasagg cuts.
37 MSK_IINF_MIO_TOTAL_NUM_COEF_REDC_CUTS
  Number of coef. redc. cuts.
82 MSK_IINF_SIM_PRIMAL_DUAL_INF_ITER
  The number of master iterations with dual infeasibility taken by the primal dual simplex algorithm.
4 MSK_IINF_ANA_PRO_NUM_CON_RA
  Number of constraints with finite lower and upper bounds.
39 MSK_IINF_MIO_TOTAL_NUM_CUTS
  Total number of cuts generated by the mixed-integer optimizer.
52 MSK_IINF_OPT_NUMCON
  Number of constraints in the problem solved when the optimizer is called.
78 MSK_IINF_SIM_PRIMAL_DEG_ITER
  The number of primal degenerate iterations.

I.18. Information item types

0 MSK_INF_DOU_TYPE
  Is a double information type.
2 MSK_INF_LINT_TYPE
  Is a long integer.
1 MSK_INF_INT_TYPE
  Is an integer.

I.19. Input/output modes

0 MSK_IOMODE_READ
  The file is read-only.
1 MSK_IOMODE_WRITE
  The file is write-only. If the file exists then it is truncated when it is opened. Otherwise it is created when it is opened.
2 MSK_IOMODE_READWRITE
  The file is to read and written.

I.20. Integer parameters

175 MSK_IPAR_SIM_STABILITY_PRIORITY
  Controls how high priority the numerical stability should be given.
125 MSK_IPAR_READ_ADD_CONE
  Additional number of conic constraints that is made room for in the problem.
166 MSK_IPAR_SIM_PRIMAL_PHASEONE_METHOD
  An exprimental feature.
204 MSK_IPAR_WRITE_MPS_STRICT
  Controls whether the written MPS file satisfies the MPS format strictly or not.
25 MSK_IPAR_INFEAS_REPORT_AUTO
  Controls whether an infeasibility report is automatically produced after the optimization if the problem is primal or dual infeasible.
93 MSK_IPAR_MIO_NODE_OPTIMIZER
  Controls which optimizer is employed at the non-root nodes in the mixed-integer optimizer.
118 MSK_IPAR_PRESOLVE_LEVEL
  Currently not used.
127 MSK_IPAR_READ_ADD_VAR
  Additional number of variables that is made room for in the problem.
121 MSK_IPAR_PRESOLVE_USE
  Controls whether the presolve is applied to a problem before it is optimized.
70 MSK_IPAR_LOG_SENSITIVITY_OPT
  Controls the amount of logging from the optimizers employed during the sensitivity analysis. 0 means no logging information is produced.
109 MSK_IPAR_OPF_WRITE_SOL_ITG
  If MSK_IPAR_OPF_WRITE_SOLUTIONS is MSK_ON and an integer solution is defined, write the integer solution in OPF files.
186 MSK_IPAR_WRITE_BAS_HEAD
  Controls whether the header section is written to the basic solution file.
79 MSK_IPAR_MIO_BRANCH_PRIORITIES_USE
  Controls whether branching priorities are used by the mixed-integer optimizer.
83 MSK_IPAR_MIO_CUT_LEVEL_TREE
  Controls the cut level employed by the mixed-integer optimizer at the tree. See MSK_IPAR_MIO_CUT_LEVEL_ROOT for an explanation of the parameter values.
188 MSK_IPAR_WRITE_DATA_COMPRESSED
  Controls whether the data file is compressed while it is written. 0 means no compression while higher values mean more compression.
140 MSK_IPAR_READ_MPS_RELAX
  If this option is turned on, then mixed integer constraints are ignored when a problem is read.
106 MSK_IPAR_OPF_WRITE_PARAMETERS
  Write a parameter section in an OPF file.
129 MSK_IPAR_READ_CON
  Expected maximum number of constraints to be read. The option is only used by fast MPS and LP file readers.
196 MSK_IPAR_WRITE_INT_VARIABLES
  Controls whether the variables section is written to the integer solution file.
123 MSK_IPAR_READ_ADD_ANZ
  Additional number of non-zeros in A that is made room for in the problem.
36 MSK_IPAR_INTPNT_ORDER_METHOD
  Controls the ordering strategy used by the interior-point optimizer when factorizing the Newton equation system.
110 MSK_IPAR_OPF_WRITE_SOL_ITR
  If MSK_IPAR_OPF_WRITE_SOLUTIONS is MSK_ON and an interior solution is defined, write the interior solution in OPF files.
69 MSK_IPAR_LOG_SENSITIVITY
  Controls the amount of logging during the sensitivity analysis. 0: Means no logging information is produced. 1: Timing information is printed. 2: Sensitivity results are printed.
143 MSK_IPAR_READ_QNZ
  Expected maximum number of Q non-zeros to be read. The option is used only by MPS and LP file readers.
59 MSK_IPAR_LOG_INFEAS_ANA
  Controls amount of output printed by the infeasibility analyzer procedures. A higher level implies that more information is logged.
168 MSK_IPAR_SIM_PRIMAL_SELECTION
  Controls the choice of the incoming variable, known as the selection strategy, in the primal simplex optimizer.
194 MSK_IPAR_WRITE_INT_CONSTRAINTS
  Controls whether the constraint section is written to the integer solution file.
199 MSK_IPAR_WRITE_LP_STRICT_FORMAT
  Controls whether LP output files satisfy the LP format strictly.
148 MSK_IPAR_SENSITIVITY_TYPE
  Controls which type of sensitivity analysis is to be performed.
153 MSK_IPAR_SIM_DUAL_RESTRICT_SELECTION
  The dual simplex optimizer can use a so-called restricted selection/pricing strategy to chooses the outgoing variable. Hence, if restricted selection is applied, then the dual simplex optimizer first choose a subset of all the potential outgoing variables. Next, for some time it will choose the outgoing variable only among the subset. From time to time the subset is redefined.A larger value of this parameter implies that the optimizer will be more aggressive in its restriction strategy, i.e. a value of 0 implies that the restriction strategy is not applied at all.
62 MSK_IPAR_LOG_MIO_FREQ
  Controls how frequent the mixed-integer optimizer prints the log line. It will print line every time MSK_IPAR_LOG_MIO_FREQ relaxations have been solved.
108 MSK_IPAR_OPF_WRITE_SOL_BAS
  If MSK_IPAR_OPF_WRITE_SOLUTIONS is MSK_ON and a basic solution is defined, include the basic solution in OPF files.
14 MSK_IPAR_CHECK_TASK_DATA
  If this feature is turned on, then the task data is checked for bad values i.e. NaNs. before an optimization is performed.
99 MSK_IPAR_MIO_ROOT_OPTIMIZER
  Controls which optimizer is employed at the root node in the mixed-integer optimizer.
191 MSK_IPAR_WRITE_FREE_CON
  Controls whether the free constraints are written to the data file.
115 MSK_IPAR_PRESOLVE_ELIM_FILL
  Controls the maximum amount of fill-in that can be created during the elimination phase of the presolve. This parameter times (numcon+numvar) denotes the amount of fill-in.
101 MSK_IPAR_NONCONVEX_MAX_ITERATIONS
  Maximum number of iterations that can be used by the nonconvex optimizer.
88 MSK_IPAR_MIO_LOCAL_BRANCH_NUMBER
  Controls the size of the local search space when doing local branching.
192 MSK_IPAR_WRITE_GENERIC_NAMES
  Controls whether the generic names or user-defined names are used in the data file.
184 MSK_IPAR_WARNING_LEVEL
  Warning level.
51 MSK_IPAR_LOG_BI_FREQ
  Controls how frequent the optimizer outputs information about the basis identification and how frequent the user-defined call-back function is called.
16 MSK_IPAR_CONCURRENT_PRIORITY_DUAL_SIMPLEX
  Priority of the dual simplex algorithm when selecting solvers for concurrent optimization.
67 MSK_IPAR_LOG_PRESOLVE
  Controls amount of output printed by the presolve procedure. A higher level implies that more information is logged.
126 MSK_IPAR_READ_ADD_QNZ
  Additional number of non-zeros in the Q matrices that is made room for in the problem.
206 MSK_IPAR_WRITE_SOL_CONSTRAINTS
  Controls whether the constraint section is written to the solution file.
35 MSK_IPAR_INTPNT_OFF_COL_TRH
  Controls how many offending columns are detected in the Jacobian of the constraint matrix.1 means aggressive detection, higher values mean less aggressive detection.0 means no detection.
128 MSK_IPAR_READ_ANZ
  Expected maximum number of A non-zeros to be read. The option is used only by fast MPS and LP file readers.
92 MSK_IPAR_MIO_MODE
  Controls whether the optimizer includes the integer restrictions when solving a (mixed) integer optimization problem.
134 MSK_IPAR_READ_LP_DROP_NEW_VARS_IN_BOU
  If this option is turned on, MOSEK will drop variables that are defined for the first time in the bounds section.
71 MSK_IPAR_LOG_SIM
  Controls amount of output printed by the simplex optimizer. A higher level implies that more information is logged.
41 MSK_IPAR_LIC_TRH_EXPIRY_WRN
  If a license feature expires in a numbers days less than the value of this parameter then a warning will be issued.
182 MSK_IPAR_SOLUTION_CALLBACK
  Indicates whether solution call-backs will be performed during the optimization.
173 MSK_IPAR_SIM_SCALING_METHOD
  Controls how the problem is scaled before a simplex optimizer is used.
72 MSK_IPAR_LOG_SIM_FREQ
  Controls how frequent the simplex optimizer outputs information about the optimization and how frequent the user-defined call-back function is called.
63 MSK_IPAR_LOG_NONCONVEX
  Controls amount of output printed by the nonconvex optimizer.
22 MSK_IPAR_FEASREPAIR_OPTIMIZE
  Controls which type of feasibility analysis is to be performed.
198 MSK_IPAR_WRITE_LP_QUOTED_NAMES
  If this option is turned on, then MOSEK will quote invalid LP names when writing an LP file.
55 MSK_IPAR_LOG_FACTOR
  If turned on, then the factor log lines are added to the log.
4 MSK_IPAR_AUTO_UPDATE_SOL_INFO
  Controls whether the solution information items are automatically updated after an optimization is performed.
203 MSK_IPAR_WRITE_MPS_QUOTED_NAMES
  If a name contains spaces (blanks) when writing an MPS file, then the quotes will be removed.
141 MSK_IPAR_READ_MPS_WIDTH
  Controls the maximal number of characters allowed in one line of the MPS file.
183 MSK_IPAR_TIMING_LEVEL
  Controls the a amount of timing performed inside MOSEK.
65 MSK_IPAR_LOG_ORDER
  If turned on, then factor lines are added to the log.
82 MSK_IPAR_MIO_CUT_LEVEL_ROOT
  Controls the cut level employed by the mixed-integer optimizer at the root node. A negative value means a default value determined by the mixed-integer optimizer is used. By adding the appropriate values from the following table the employed cut types can be controlled.
GUB cover +2
Flow cover +4
Lifting +8
Plant location +16
Disaggregation +32
Knapsack cover +64
Lattice +128
Gomory +256
Coefficient reduction +512
GCD +1024
Obj. integrality +2048
5 MSK_IPAR_BASIS_SOLVE_USE_PLUS_ONE
  If a slack variable is in the basis, then the corresponding column in the basis is a unit vector with -1 in the right position. However, if this parameter is set to MSK_ON, -1 is replaced by 1.
8 MSK_IPAR_BI_IGNORE_NUM_ERROR
  If the parameter MSK_IPAR_INTPNT_BASIS has the value MSK_BI_NO_ERROR and the interior-point optimizer has terminated due to a numerical problem, then basis identification is performed if this parameter has the value MSK_ON.
94 MSK_IPAR_MIO_NODE_SELECTION
  Controls the node selection strategy employed by the mixed-integer optimizer.
2 MSK_IPAR_ANA_SOL_PRINT_VIOLATED
  Controls whether a list of violated constraints is printed.
181 MSK_IPAR_SOL_READ_WIDTH
  Controls the maximal acceptable width of line in the solutions when read by MOSEK.
120 MSK_IPAR_PRESOLVE_LINDEP_WORK_LIM
  Is used to limit the amount of work that can done to locate linear dependencies. In general the higher value this parameter is given the less work can be used. However, a value of 0 means no limit on the amount work that can be used.
33 MSK_IPAR_INTPNT_MAX_NUM_REFINEMENT_STEPS
  Maximum number of steps to be used by the iterative refinement of the search direction. A negative value implies that the optimizer Chooses the maximum number of iterative refinement steps.
124 MSK_IPAR_READ_ADD_CON
  Additional number of constraints that is made room for in the problem.
53 MSK_IPAR_LOG_CONCURRENT
  Controls amount of output printed by the concurrent optimizer.
73 MSK_IPAR_LOG_SIM_MINOR
  Currently not in use.
159 MSK_IPAR_SIM_MAX_ITERATIONS
  Maximum number of iterations that can be used by a simplex optimizer.
31 MSK_IPAR_INTPNT_MAX_ITERATIONS
  Controls the maximum number of iterations allowed in the interior-point optimizer.
20 MSK_IPAR_CPU_TYPE
  Specifies the CPU type. By default MOSEK tries to auto detect the CPU type. Therefore, we recommend to change this parameter only if the auto detection does not work properly.
50 MSK_IPAR_LOG_BI
  Controls the amount of output printed by the basis identification procedure. A higher level implies that more information is logged.
32 MSK_IPAR_INTPNT_MAX_NUM_COR
  Controls the maximum number of correctors allowed by the multiple corrector procedure. A negative value means that MOSEK is making the choice.
197 MSK_IPAR_WRITE_LP_LINE_WIDTH
  Maximum width of line in an LP file written by MOSEK.
180 MSK_IPAR_SOL_READ_NAME_WIDTH
  When a solution is read by MOSEK and some constraint, variable or cone names contain blanks, then a maximum name width much be specified. A negative value implies that no name contain blanks.
45 MSK_IPAR_LICENSE_DEBUG
  This option is used to turn on debugging of the incense manager.
48 MSK_IPAR_LICENSE_WAIT
  If all licenses are in use MOSEK returns with an error code. However, by turning on this parameter MOSEK will wait for an available license.
1 MSK_IPAR_ANA_SOL_BASIS
  Controls whether the basis matrix is analyzed in solaution analyzer.
116 MSK_IPAR_PRESOLVE_ELIMINATOR_MAX_NUM_TRIES
  Control the maximum number of times the eliminator is tried.
193 MSK_IPAR_WRITE_GENERIC_NAMES_IO
  Index origin used in generic names.
15 MSK_IPAR_CONCURRENT_NUM_OPTIMIZERS
  The maximum number of simultaneous optimizations that will be started by the concurrent optimizer.
169 MSK_IPAR_SIM_REFACTOR_FREQ
  Controls how frequent the basis is refactorized. The value 0 means that the optimizer determines the best point of refactorization.It is strongly recommended NOT to change this parameter.
154 MSK_IPAR_SIM_DUAL_SELECTION
  Controls the choice of the incoming variable, known as the selection strategy, in the dual simplex optimizer.
174 MSK_IPAR_SIM_SOLVE_FORM
  Controls whether the primal or the dual problem is solved by the primal-/dual- simplex optimizer.
13 MSK_IPAR_CHECK_CONVEXITY
  Specify the level of convexity check on quadratic problems
122 MSK_IPAR_QO_SEPARABLE_REFORMULATION
  Determine if Quadratic programing problems should be reformulated to separable form.
76 MSK_IPAR_LP_WRITE_IGNORE_INCOMPATIBLE_ITEMS
  Controls the result of writing a problem containing incompatible items to an LP file.
144 MSK_IPAR_READ_TASK_IGNORE_PARAM
  Controls whether MOSEK should ignore the parameter setting defined in the task file and use the default parameter setting instead.
95 MSK_IPAR_MIO_OPTIMIZER_MODE
  An exprimental feature.
60 MSK_IPAR_LOG_INTPNT
  Controls amount of output printed printed by the interior-point optimizer. A higher level implies that more information is logged.
61 MSK_IPAR_LOG_MIO
  Controls the log level for the mixed-integer optimizer. A higher level implies that more information is logged.
156 MSK_IPAR_SIM_HOTSTART
  Controls the type of hot-start that the simplex optimizer perform.
66 MSK_IPAR_LOG_PARAM
  Controls the amount of information printed out about parameter changes.
189 MSK_IPAR_WRITE_DATA_FORMAT
  Controls the file format when writing task data to a file.
155 MSK_IPAR_SIM_EXPLOIT_DUPVEC
  Controls if the simplex optimizers are allowed to exploit duplicated columns.
78 MSK_IPAR_MIO_BRANCH_DIR
  Controls whether the mixed-integer optimizer is branching up or down by default.
29 MSK_IPAR_INTPNT_FACTOR_DEBUG_LVL
  Controls factorization debug level.
179 MSK_IPAR_SOL_QUOTED_NAMES
  If this options is turned on, then MOSEK will quote names that contains blanks while writing the solution file. Moreover when reading leading and trailing quotes will be stripped of.
46 MSK_IPAR_LICENSE_PAUSE_TIME
  If MSK_IPAR_LICENSE_WAIT=MSK_ON and no license is available, then MOSEK sleeps a number of milliseconds between each check of whether a license has become free.
96 MSK_IPAR_MIO_PRESOLVE_AGGREGATE
  Controls whether the presolve used by the mixed-integer optimizer tries to aggregate the constraints.
209 MSK_IPAR_WRITE_TASK_INC_SOL
  Controls whether the solutions are stored in the task file too.
43 MSK_IPAR_LICENSE_CACHE_TIME
  Setting this parameter no longer has any effect. Please see MSK_IPAR_CACHE_LICENSE for an alternative.
9 MSK_IPAR_BI_MAX_ITERATIONS
  Controls the maximum number of simplex iterations allowed to optimize a basis after the basis identification.
157 MSK_IPAR_SIM_HOTSTART_LU
  Determines if the simplex optimizer should exploit the initial factorization.
111 MSK_IPAR_OPF_WRITE_SOLUTIONS
  Enable inclusion of solutions in the OPF files.
162 MSK_IPAR_SIM_NETWORK_DETECT_HOTSTART
  This parameter controls has large the network component in “relative” terms has to be before it is exploited in a simplex hot-start. The network component should be equal or larger than
max(MSK_IPAR_SIM_NETWORK_DETECT,MSK_IPAR_SIM_NETWORK_DETECT_HOTSTART)
before it is exploited. If this value is larger than 100 the network flow component is never detected or exploited.
119 MSK_IPAR_PRESOLVE_LINDEP_USE
  Controls whether the linear constraints are checked for linear dependencies.
114 MSK_IPAR_PARAM_READ_IGN_ERROR
  If turned on, then errors in paramter settings is ignored.
104 MSK_IPAR_OPF_WRITE_HEADER
  Write a text header with date and MOSEK version in an OPF file.
81 MSK_IPAR_MIO_CONT_SOL
  Controls the meaning of the interior-point and basic solutions in mixed integer problems.
102 MSK_IPAR_OBJECTIVE_SENSE
  If the objective sense for the task is undefined, then the value of this parameter is used as the default objective sense.
195 MSK_IPAR_WRITE_INT_HEAD
  Controls whether the header section is written to the integer solution file.
40 MSK_IPAR_INTPNT_STARTING_POINT
  Starting point used by the interior-point optimizer.
49 MSK_IPAR_LOG
  Controls the amount of log information. The value 0 implies that all log information is suppressed. A higher level implies that more information is logged.Please note that if a task is employed to solve a sequence of optimization problems the value of this parameter is reduced by the value of MSK_IPAR_LOG_CUT_SECOND_OPT for the second and any subsequent optimizations.
19 MSK_IPAR_CONCURRENT_PRIORITY_PRIMAL_SIMPLEX
  Priority of the primal simplex algorithm when selecting solvers for concurrent optimization.
138 MSK_IPAR_READ_MPS_OBJ_SENSE
  If turned on, the MPS reader uses the objective sense section. Otherwise the MPS reader ignores it.
10 MSK_IPAR_CACHE_LICENSE
  Specifies if the license is kept checked out for the lifetime of the mosek environment (on) or returned to the server immediately after the optimization (off).Check-in and check-out of licenses have an overhead. Frequent communication with the license server should be avoided.
74 MSK_IPAR_LOG_SIM_NETWORK_FREQ
  Controls how frequent the network simplex optimizer outputs information about the optimization and how frequent the user-defined call-back function is called. The network optimizer will use a logging frequency equal to MSK_IPAR_LOG_SIM_FREQ times MSK_IPAR_LOG_SIM_NETWORK_FREQ.
28 MSK_IPAR_INTPNT_DIFF_STEP
  Controls whether different step sizes are allowed in the primal and dual space.
172 MSK_IPAR_SIM_SCALING
  Controls how much effort is used in scaling the problem before a simplex optimizer is used.
200 MSK_IPAR_WRITE_LP_TERMS_PER_LINE
  Maximum number of terms on a single line in an LP file written by MOSEK. 0 means unlimited.
146 MSK_IPAR_SENSITIVITY_ALL
  Not applicable.
178 MSK_IPAR_SOL_FILTER_KEEP_RANGED
  If turned on, then ranged constraints and variables are written to the solution file independent of the filter setting.
7 MSK_IPAR_BI_IGNORE_MAX_ITER
  If the parameter MSK_IPAR_INTPNT_BASIS has the value MSK_BI_NO_ERROR and the interior-point optimizer has terminated due to maximum number of iterations, then basis identification is performed if this parameter has the value MSK_ON.
56 MSK_IPAR_LOG_FEASREPAIR
  Controls the amount of output printed when performing feasibility repair.
39 MSK_IPAR_INTPNT_SOLVE_FORM
  Controls whether the primal or the dual problem is solved.
103 MSK_IPAR_OPF_MAX_TERMS_PER_LINE
  The maximum number of terms (linear and quadratic) per line when an OPF file is written.
205 MSK_IPAR_WRITE_PRECISION
  Controls the precision with which double numbers are printed in the MPS data file. In general it is not worthwhile to use a value higher than 15.
149 MSK_IPAR_SIM_BASIS_FACTOR_USE
  Controls whether a (LU) factorization of the basis is used in a hot-start. Forcing a refactorization sometimes improves the stability of the simplex optimizers, but in most cases there is a performance penanlty.
210 MSK_IPAR_WRITE_XML_MODE
  Controls if linear coefficients should be written by row or column when writing in the XML file format.
37 MSK_IPAR_INTPNT_REGULARIZATION_USE
  Controls whether regularization is allowed.
6 MSK_IPAR_BI_CLEAN_OPTIMIZER
  Controls which simplex optimizer is used in the clean-up phase.
97 MSK_IPAR_MIO_PRESOLVE_PROBING
  Controls whether the mixed-integer presolve performs probing. Probing can be very time consuming.
42 MSK_IPAR_LICENSE_ALLOW_OVERUSE
  Controls if license overuse is allowed when caching licenses
24 MSK_IPAR_INFEAS_PREFER_PRIMAL
  If both certificates of primal and dual infeasibility are supplied then only the primal is used when this option is turned on.
187 MSK_IPAR_WRITE_BAS_VARIABLES
  Controls whether the variables section is written to the basic solution file.
75 MSK_IPAR_LOG_STORAGE
  When turned on, MOSEK prints messages regarding the storage usage and allocation.
98 MSK_IPAR_MIO_PRESOLVE_USE
  Controls whether presolve is performed by the mixed-integer optimizer.
135 MSK_IPAR_READ_LP_QUOTED_NAMES
  If a name is in quotes when reading an LP file, the quotes will be removed.
27 MSK_IPAR_INTPNT_BASIS
  Controls whether the interior-point optimizer also computes an optimal basis.
54 MSK_IPAR_LOG_CUT_SECOND_OPT
  If a task is employed to solve a sequence of optimization problems, then the value of the log levels is reduced by the value of this parameter. E.g MSK_IPAR_LOG and MSK_IPAR_LOG_SIM are reduced by the value of this parameter for the second and any subsequent optimizations.
137 MSK_IPAR_READ_MPS_KEEP_INT
  Controls whether MOSEK should keep the integer restrictions on the variables while reading the MPS file.
91 MSK_IPAR_MIO_MAX_NUM_SOLUTIONS
  The mixed-integer optimizer can be terminated after a certain number of different feasible solutions has been located. If this parameter has the value n and n is strictly positive, then the mixed-integer optimizer will be terminated when n feasible solutions have been located.
44 MSK_IPAR_LICENSE_CHECK_TIME
  The parameter specifies the number of seconds between the checks of all the active licenses in the MOSEK environment license cache. These checks are performed to determine if the licenses should be returned to the server.
208 MSK_IPAR_WRITE_SOL_VARIABLES
  Controls whether the variables section is written to the solution file.
147 MSK_IPAR_SENSITIVITY_OPTIMIZER
  Controls which optimizer is used for optimal partition sensitivity analysis.
201 MSK_IPAR_WRITE_MPS_INT
  Controls if marker records are written to the MPS file to indicate whether variables are integer restricted.
160 MSK_IPAR_SIM_MAX_NUM_SETBACKS
  Controls how many set-backs are allowed within a simplex optimizer. A set-back is an event where the optimizer moves in the wrong direction. This is impossible in theory but may happen due to numerical problems.
21 MSK_IPAR_DATA_CHECK
  If this option is turned on, then extensive data checking is enabled. It will slow down MOSEK but on the other hand help locating bugs.
17 MSK_IPAR_CONCURRENT_PRIORITY_FREE_SIMPLEX
  Priority of the free simplex optimizer when selecting solvers for concurrent optimization.
133 MSK_IPAR_READ_KEEP_FREE_CON
  Controls whether the free constraints are included in the problem.
57 MSK_IPAR_LOG_FILE
  If turned on, then some log info is printed when a file is written or read.
18 MSK_IPAR_CONCURRENT_PRIORITY_INTPNT
  Priority of the interior-point algorithm when selecting solvers for concurrent optimization.
164 MSK_IPAR_SIM_NON_SINGULAR
  Controls if the simplex optimizer ensures a non-singular basis, if possible.
190 MSK_IPAR_WRITE_DATA_PARAM
  If this option is turned on the parameter settings are written to the data file as parameters.
150 MSK_IPAR_SIM_DEGEN
  Controls how aggressively degeneration is handled.
105 MSK_IPAR_OPF_WRITE_HINTS
  Write a hint section with problem dimensions in the beginning of an OPF file.
117 MSK_IPAR_PRESOLVE_ELIMINATOR_USE
  Controls whether free or implied free variables are eliminated from the problem.
0 MSK_IPAR_ALLOC_ADD_QNZ
  Additional number of Q non-zeros that are allocated space for when numanz exceeds maxnumqnz during addition of new Q entries.
86 MSK_IPAR_MIO_HOTSTART
  Controls whether the integer optimizer is hot-started.
136 MSK_IPAR_READ_MPS_FORMAT
  Controls how strictly the MPS file reader interprets the MPS format.
113 MSK_IPAR_PARAM_READ_CASE_NAME
  If turned on, then names in the parameter file are case sensitive.
139 MSK_IPAR_READ_MPS_QUOTED_NAMES
  If a name is in quotes when reading an MPS file, then the quotes will be removed.
64 MSK_IPAR_LOG_OPTIMIZER
  Controls the amount of general optimizer information that is logged.
202 MSK_IPAR_WRITE_MPS_OBJ_SENSE
  If turned off, the objective sense section is not written to the MPS file.
34 MSK_IPAR_INTPNT_NUM_THREADS
  Controls the number of threads employed by the interior-point optimizer. If set to a positive number MOSEK will use this number of threads. If zero the number of threads used will equal the number of cores detected on the machine.
89 MSK_IPAR_MIO_MAX_NUM_BRANCHES
  Maximum number of branches allowed during the branch and bound search. A negative value means infinite.
165 MSK_IPAR_SIM_PRIMAL_CRASH
  Controls whether crashing is performed in the primal simplex optimizer.In general, if a basis consists of more than (100-this parameter value)% fixed variables, then a crash will be performed.
80 MSK_IPAR_MIO_CONSTRUCT_SOL
  If set to MSK_ON and all integer variables have been given a value for which a feasible mixed integer solution exists, then MOSEK generates an initial solution to the mixed integer problem by fixing all integer values and solving the remaining problem.
3 MSK_IPAR_AUTO_SORT_A_BEFORE_OPT
  Controls whether the elements in each column of A are sorted before an optimization is performed. This is not required but makes the optimization more deterministic.
100 MSK_IPAR_MIO_STRONG_BRANCH
  The value specifies the depth from the root in which strong branching is used. A negative value means that the optimizer chooses a default value automatically.
152 MSK_IPAR_SIM_DUAL_PHASEONE_METHOD
  An exprimental feature.
158 MSK_IPAR_SIM_INTEGER
  An exprimental feature.
167 MSK_IPAR_SIM_PRIMAL_RESTRICT_SELECTION
  The primal simplex optimizer can use a so-called restricted selection/pricing strategy to chooses the outgoing variable. Hence, if restricted selection is applied, then the primal simplex optimizer first choose a subset of all the potential incoming variables. Next, for some time it will choose the incoming variable only among the subset. From time to time the subset is redefined.A larger value of this parameter implies that the optimizer will be more aggressive in its restriction strategy, i.e. a value of 0 implies that the restriction strategy is not applied at all.
130 MSK_IPAR_READ_CONE
  Expected maximum number of conic constraints to be read. The option is used only by fast MPS and LP file readers.
112 MSK_IPAR_OPTIMIZER
  The paramter controls which optimizer is used to optimize the task.
77 MSK_IPAR_MAX_NUM_WARNINGS
  Waning level. A higher value results in more warnings.
47 MSK_IPAR_LICENSE_SUPPRESS_EXPIRE_WRNS
  Controls whether license features expire warnings are suppressed.
207 MSK_IPAR_WRITE_SOL_HEAD
  Controls whether the header section is written to the solution file.
185 MSK_IPAR_WRITE_BAS_CONSTRAINTS
  Controls whether the constraint section is written to the basic solution file.
84 MSK_IPAR_MIO_FEASPUMP_LEVEL
  Feasibility pump is a heuristic designed to compute an initial feasible solution. A value of 0 implies that the feasibility pump heuristic is not used. A value of -1 implies that the mixed-integer optimizer decides how the feasibility pump heuristic is used. A larger value than 1 implies that the feasibility pump is employed more aggressively. Normally a value beyond 3 is not worthwhile.
23 MSK_IPAR_INFEAS_GENERIC_NAMES
  Controls whether generic names are used when an infeasible subproblem is created.
161 MSK_IPAR_SIM_NETWORK_DETECT
  The simplex optimizer is capable of exploiting a network flow component in a problem. However it is only worthwhile to exploit the network flow component if it is sufficiently large. This parameter controls how large the network component has to be in “relative” terms before it is exploited. For instance a value of 20 means at least 20% of the model should be a network before it is exploited. If this value is larger than 100 the network flow component is never detected or exploited.
68 MSK_IPAR_LOG_RESPONSE
  Controls amount of output printed when response codes are reported. A higher level implies that more information is logged.
26 MSK_IPAR_INFEAS_REPORT_LEVEL
  Controls the amount of information presented in an infeasibility report. Higher values imply more information.
11 MSK_IPAR_CACHE_SIZE_L1
  Specifies the size of the cache of the computer. This parameter is potentially very important for the efficiency on computers if MOSEK cannot determine the cache size automatically. If the cache size is negative, then MOSEK tries to determine the value automatically.
12 MSK_IPAR_CACHE_SIZE_L2
  Specifies the size of the cache of the computer. This parameter is potentially very important for the efficiency on computers where MOSEK cannot determine the cache size automatically. If the cache size is negative, then MOSEK tries to determine the value automatically.
176 MSK_IPAR_SIM_SWITCH_OPTIMIZER
  The simplex optimizer sometimes chooses to solve the dual problem instead of the primal problem. This implies that if you have chosen to use the dual simplex optimizer and the problem is dualized, then it actually makes sense to use the primal simplex optimizer instead. If this parameter is on and the problem is dualized and furthermore the simplex optimizer is chosen to be the primal (dual) one, then it is switched to the dual (primal).
131 MSK_IPAR_READ_DATA_COMPRESSED
  If this option is turned on,it is assumed that the data file is compressed.
142 MSK_IPAR_READ_Q_MODE
  Controls how the Q matrices are read from the MPS file.
107 MSK_IPAR_OPF_WRITE_PROBLEM
  Write objective, constraints, bounds etc. to an OPF file.
52 MSK_IPAR_LOG_CHECK_CONVEXITY
  Controls logging in convexity check on quadratic problems. Set to a positive value to turn logging on.If a quadratic coefficient matrix is found to violate the requirement of PSD (NSD) then a list of negative (positive) pivot elements is printed. The absolute value of the pivot elements is also shown.
132 MSK_IPAR_READ_DATA_FORMAT
  Format of the data file to be read.
151 MSK_IPAR_SIM_DUAL_CRASH
  Controls whether crashing is performed in the dual simplex optimizer.In general if a basis consists of more than (100-this parameter value)% fixed variables, then a crash will be performed.
163 MSK_IPAR_SIM_NETWORK_DETECT_METHOD
  Controls which type of detection method the network extraction should use.
145 MSK_IPAR_READ_VAR
  Expected maximum number of variable to be read. The option is used only by MPS and LP file readers.
58 MSK_IPAR_LOG_HEAD
  If turned on, then a header line is added to the log.
170 MSK_IPAR_SIM_REFORMULATION
  Controls if the simplex optimizers are allowed to reformulate the problem.
171 MSK_IPAR_SIM_SAVE_LU
  Controls if the LU factorization stored should be replaced with the LU factorization corresponding to the initial basis.
30 MSK_IPAR_INTPNT_FACTOR_METHOD
  Controls the method used to factor the Newton equation system.
90 MSK_IPAR_MIO_MAX_NUM_RELAXS
  Maximum number of relaxations allowed during the branch and bound search. A negative value means infinite.
177 MSK_IPAR_SOL_FILTER_KEEP_BASIC
  If turned on, then basic and super basic constraints and variables are written to the solution file independent of the filter setting.
85 MSK_IPAR_MIO_HEURISTIC_LEVEL
  Controls the heuristic employed by the mixed-integer optimizer to locate an initial good integer feasible solution. A value of zero means the heuristic is not used at all. A larger value than 0 means that a gradually more sophisticated heuristic is used which is computationally more expensive. A negative value implies that the optimizer chooses the heuristic. Normally a value around 3 to 5 should be optimal.
87 MSK_IPAR_MIO_KEEP_BASIS
  Controls whether the integer presolve keeps bases in memory. This speeds on the solution process at cost of bigger memory consumption.
38 MSK_IPAR_INTPNT_SCALING
  Controls how the problem is scaled before the interior-point optimizer is used.

I.21. Language selection constants

1 MSK_LANG_DAN
  Danish language selection
0 MSK_LANG_ENG
  English language selection

I.22. Long integer information items.

6 MSK_LIINF_BI_CLEAN_PRIMAL_ITER
  Number of primal clean iterations performed in the basis identification.
9 MSK_LIINF_INTPNT_FACTOR_NUM_NZ
  Number of non-zeros in factorization.
10 MSK_LIINF_MIO_INTPNT_ITER
  Number of interior-point iterations performed by the mixed-integer optimizer.
4 MSK_LIINF_BI_CLEAN_PRIMAL_DUAL_ITER
  Number of primal-dual clean iterations performed in the basis identification.
3 MSK_LIINF_BI_CLEAN_PRIMAL_DUAL_DEG_ITER
  Number of primal-dual degenerate clean iterations performed in the basis identification.
2 MSK_LIINF_BI_CLEAN_PRIMAL_DEG_ITER
  Number of primal degenerate clean iterations performed in the basis identification.
1 MSK_LIINF_BI_CLEAN_DUAL_ITER
  Number of dual clean iterations performed in the basis identification.
13 MSK_LIINF_RD_NUMQNZ
  Number of Q non-zeros.
12 MSK_LIINF_RD_NUMANZ
  Number of non-zeros in A that is read.
8 MSK_LIINF_BI_PRIMAL_ITER
  Number of primal pivots performed in the basis identification.
7 MSK_LIINF_BI_DUAL_ITER
  Number of dual pivots performed in the basis identification.
0 MSK_LIINF_BI_CLEAN_DUAL_DEG_ITER
  Number of dual degenerate clean iterations performed in the basis identification.
11 MSK_LIINF_MIO_SIMPLEX_ITER
  Number of simplex iterations performed by the mixed-integer optimizer.
5 MSK_LIINF_BI_CLEAN_PRIMAL_DUAL_SUB_ITER
  Number of primal-dual subproblem clean iterations performed in the basis identification.

I.23. Mark

0 MSK_MARK_LO
  The lower bound is selected for sensitivity analysis.
1 MSK_MARK_UP
  The upper bound is selected for sensitivity analysis.

I.24. Continuous mixed-integer solution type

2 MSK_MIO_CONT_SOL_ITG
  The reported interior-point and basic solutions are a solution to the problem with all integer variables fixed at the value they have in the integer solution. A solution is only reported in case the problem has a primal feasible solution.
0 MSK_MIO_CONT_SOL_NONE
  No interior-point or basic solution are reported when the mixed-integer optimizer is used.
1 MSK_MIO_CONT_SOL_ROOT
  The reported interior-point and basic solutions are a solution to the root node problem when mixed-integer optimizer is used.
3 MSK_MIO_CONT_SOL_ITG_REL
  In case the problem is primal feasible then the reported interior-point and basic solutions are a solution to the problem with all integer variables fixed at the value they have in the integer solution. If the problem is primal infeasible, then the solution to the root node problem is reported.

I.25. Integer restrictions

0 MSK_MIO_MODE_IGNORED
  The integer constraints are ignored and the problem is solved as a continuous problem.
2 MSK_MIO_MODE_LAZY
  Integer restrictions should be satisfied if an optimizer is available for the problem.
1 MSK_MIO_MODE_SATISFIED
  Integer restrictions should be satisfied.

I.26. Mixed-integer node selection types

5 MSK_MIO_NODE_SELECTION_PSEUDO
  The optimizer employs selects the node based on a pseudo cost estimate.
4 MSK_MIO_NODE_SELECTION_HYBRID
  The optimizer employs a hybrid strategy.
0 MSK_MIO_NODE_SELECTION_FREE
  The optimizer decides the node selection strategy.
3 MSK_MIO_NODE_SELECTION_WORST
  The optimizer employs a worst bound node selection strategy.
2 MSK_MIO_NODE_SELECTION_BEST
  The optimizer employs a best bound node selection strategy.
1 MSK_MIO_NODE_SELECTION_FIRST
  The optimizer employs a depth first node selection strategy.

I.27. MPS file format type

0 MSK_MPS_FORMAT_STRICT
  It is assumed that the input file satisfies the MPS format strictly.
1 MSK_MPS_FORMAT_RELAXED
  It is assumed that the input file satisfies a slightly relaxed version of the MPS format.
2 MSK_MPS_FORMAT_FREE
  It is assumed that the input file satisfies the free MPS format. This implies that spaces are not allowed in names. Otherwise the format is free.

I.28. Message keys

1000 MSK_MSG_READING_FILE
  None
1001 MSK_MSG_WRITING_FILE
  None
1100 MSK_MSG_MPS_SELECTED
  None

I.29. Network detection method

1 MSK_NETWORK_DETECT_SIMPLE
  The network detection should use a very simple heuristic.
2 MSK_NETWORK_DETECT_ADVANCED
  The network detection should use a more advanced heuristic.
0 MSK_NETWORK_DETECT_FREE
  The network detection is free.

I.30. Objective sense types

1 MSK_OBJECTIVE_SENSE_MINIMIZE
  The problem should be minimized.
0 MSK_OBJECTIVE_SENSE_UNDEFINED
  The objective sense is undefined.
2 MSK_OBJECTIVE_SENSE_MAXIMIZE
  The problem should be maximized.

I.31. On/off

1 MSK_ON
  Switch the option on.
0 MSK_OFF
  Switch the option off.

I.32. Optimizer types

1 MSK_OPTIMIZER_INTPNT
  The interior-point optimizer is used.
10 MSK_OPTIMIZER_CONCURRENT
  The optimizer for nonconvex nonlinear problems.
8 MSK_OPTIMIZER_MIXED_INT
  The mixed-integer optimizer.
5 MSK_OPTIMIZER_DUAL_SIMPLEX
  The dual simplex optimizer is used.
0 MSK_OPTIMIZER_FREE
  The optimizer is chosen automatically.
6 MSK_OPTIMIZER_PRIMAL_DUAL_SIMPLEX
  The primal dual simplex optimizer is used.
2 MSK_OPTIMIZER_CONIC
  The optimizer for problems having conic constraints.
9 MSK_OPTIMIZER_NONCONVEX
  The optimizer for nonconvex nonlinear problems.
3 MSK_OPTIMIZER_QCONE
  For internal use only.
4 MSK_OPTIMIZER_PRIMAL_SIMPLEX
  The primal simplex optimizer is used.
7 MSK_OPTIMIZER_FREE_SIMPLEX
  One of the simplex optimizers is used.

I.33. Ordering strategies

5 MSK_ORDER_METHOD_NONE
  No ordering is used.
2 MSK_ORDER_METHOD_APPMINLOC2
  A variant of the approximate minimum local-fill-in ordering is used.
1 MSK_ORDER_METHOD_APPMINLOC1
  Approximate minimum local-fill-in ordering is used.
4 MSK_ORDER_METHOD_GRAPHPAR2
  An alternative graph partitioning based ordering.
0 MSK_ORDER_METHOD_FREE
  The ordering method is chosen automatically.
3 MSK_ORDER_METHOD_GRAPHPAR1
  Graph partitioning based ordering.

I.34. Parameter type

0 MSK_PAR_INVALID_TYPE
  Not a valid parameter.
3 MSK_PAR_STR_TYPE
  Is a string parameter.
1 MSK_PAR_DOU_TYPE
  Is a double parameter.
2 MSK_PAR_INT_TYPE
  Is an integer parameter.

I.35. Presolve method.

1 MSK_PRESOLVE_MODE_ON
  The problem is presolved before it is optimized.
0 MSK_PRESOLVE_MODE_OFF
  The problem is not presolved before it is optimized.
2 MSK_PRESOLVE_MODE_FREE
  It is decided automatically whether to presolve before the problem is optimized.

I.36. Problem data items

0 MSK_PI_VAR
  Item is a variable.
2 MSK_PI_CONE
  Item is a cone.
1 MSK_PI_CON
  Item is a constraint.

I.37. Problem types

2 MSK_PROBTYPE_QCQO
  The problem is a quadratically constrained optimization problem.
0 MSK_PROBTYPE_LO
  The problem is a linear optimization problem.
4 MSK_PROBTYPE_CONIC
  A conic optimization.
3 MSK_PROBTYPE_GECO
  General convex optimization.
5 MSK_PROBTYPE_MIXED
  General nonlinear constraints and conic constraints. This combination can not be solved by MOSEK.
1 MSK_PROBTYPE_QO
  The problem is a quadratic optimization problem.

I.38. Problem status keys

6 MSK_PRO_STA_PRIM_AND_DUAL_INFEAS
  The problem is primal and dual infeasible.
4 MSK_PRO_STA_PRIM_INFEAS
  The problem is primal infeasible.
7 MSK_PRO_STA_ILL_POSED
  The problem is ill-posed. For example, it may be primal and dual feasible but have a positive duality gap.
0 MSK_PRO_STA_UNKNOWN
  Unknown problem status.
2 MSK_PRO_STA_PRIM_FEAS
  The problem is primal feasible.
8 MSK_PRO_STA_NEAR_PRIM_AND_DUAL_FEAS
  The problem is at least nearly primal and dual feasible.
10 MSK_PRO_STA_NEAR_DUAL_FEAS
  The problem is at least nearly dual feasible.
11 MSK_PRO_STA_PRIM_INFEAS_OR_UNBOUNDED
  The problem is either primal infeasible or unbounded. This may occur for mixed-integer problems.
1 MSK_PRO_STA_PRIM_AND_DUAL_FEAS
  The problem is primal and dual feasible.
5 MSK_PRO_STA_DUAL_INFEAS
  The problem is dual infeasible.
9 MSK_PRO_STA_NEAR_PRIM_FEAS
  The problem is at least nearly primal feasible.
3 MSK_PRO_STA_DUAL_FEAS
  The problem is dual feasible.

I.39. Interpretation of quadratic terms in MPS files

0 MSK_Q_READ_ADD
  All elements in a Q matrix are assumed to belong to the lower triangular part. Duplicate elements in a Q matrix are added together.
1 MSK_Q_READ_DROP_LOWER
  All elements in the strict lower triangular part of the Q matrices are dropped.
2 MSK_Q_READ_DROP_UPPER
  All elements in the strict upper triangular part of the Q matrices are dropped.

I.40. Response codes

352 MSK_RES_WRN_SOL_FILE_IGNORED_VAR
  One or more lines in the variable section were ignored when reading a solution file.
1218 MSK_RES_ERR_PARAM_TYPE
  The parameter type is invalid.
1203 MSK_RES_ERR_INDEX_IS_TOO_SMALL
  An index in an argument is too small.
2501 MSK_RES_ERR_INV_MARKI
  Invalid value in marki.
803 MSK_RES_WRN_PRESOLVE_BAD_PRECISION
  The presolve estimates that the model is specified with insufficient precision.
1500 MSK_RES_ERR_INV_PROBLEM
  Invalid problem type. Probably a nonconvex problem has been specified.
1268 MSK_RES_ERR_INV_SKX
  Invalid value in skx.
1551 MSK_RES_ERR_MIO_NO_OPTIMIZER
  No optimizer is available for the current class of integer optimization problems.
4009 MSK_RES_TRM_MIO_NUM_BRANCHES
  The mixed-integer optimizer terminated as to the maximum number of branches was reached.
4004 MSK_RES_TRM_MIO_NEAR_ABS_GAP
  The mixed-integer optimizer terminated because the near optimal absolute gap tolerance was satisfied.
2001 MSK_RES_ERR_NO_DUAL_INFEAS_CER
  A certificate of infeasibility is not available.
1254 MSK_RES_ERR_MUL_A_ELEMENT
  An element in A is defined multiple times.
1170 MSK_RES_ERR_INVALID_NAME_IN_SOL_FILE
  An invalid name occurred in a solution file.
1114 MSK_RES_ERR_MPS_MUL_QOBJ
  The Q term in the objective is specified multiple times in the MPS data file.
1063 MSK_RES_ERR_NO_INIT_ENV
  env is not initialized.
1265 MSK_RES_ERR_UNDEF_SOLUTION
  MOSEK has the following solution types:
  • an interior-point solution,
  • an basic solution,
  • and an integer solution.
Each optimizer may set one or more of these solutions; e.g by default a successful optimization with the interior-point optimizer defines the interior-point solution, and, for linear problems, also the basic solution. This error occurs when asking for a solution or for information about a solution that is not defined.
1288 MSK_RES_ERR_LASTJ
  Invalid lastj.
1001 MSK_RES_ERR_LICENSE_EXPIRED
  The license has expired.
3055 MSK_RES_ERR_SEN_INDEX_INVALID
  Invalid range given in the sensitivity file.
1274 MSK_RES_ERR_INV_SKN
  Invalid value in skn.
1295 MSK_RES_ERR_OBJ_Q_NOT_PSD
  The quadratic coefficient matrix in the objective is not positive semi-definite as expected for a minimization problem.
1234 MSK_RES_ERR_INF_LINT_NAME
  A long integer information name is invalid.
903 MSK_RES_WRN_ANA_CLOSE_BOUNDS
  This warning is issued by problem analyzer, if ranged constraints or variables with very close upper and lower bounds are detected. One should consider treating such constraints as equalities and such variables as constants.
1008 MSK_RES_ERR_MISSING_LICENSE_FILE
  MOSEK cannot find the license file or license server. Usually this happens if the operating system variable MOSEKLM_LICENSE_FILE is not set up appropriately. Please see the MOSEK installation manual for details.
1235 MSK_RES_ERR_INDEX
  An index is out of range.
1350 MSK_RES_ERR_SOL_FILE_INVALID_NUMBER
  An invalid number is specified in a solution file.
2800 MSK_RES_ERR_LU_MAX_NUM_TRIES
  Could not compute the LU factors of the matrix within the maximum number of allowed tries.
1267 MSK_RES_ERR_INV_SKC
  Invalid value in skc.
201 MSK_RES_WRN_DROPPED_NZ_QOBJ
  One or more non-zero elements were dropped in the Q matrix in the objective.
3000 MSK_RES_ERR_INTERNAL
  An internal error occurred. Please report this problem.
1610 MSK_RES_ERR_BASIS_FACTOR
  The factorization of the basis is invalid.
1204 MSK_RES_ERR_INDEX_IS_TOO_LARGE
  An index in an argument is too large.
1154 MSK_RES_ERR_LP_INVALID_VAR_NAME
  A variable name is invalid when used in an LP formatted file.
2950 MSK_RES_ERR_NO_DUAL_FOR_ITG_SOL
  No dual information is available for the integer solution.
1590 MSK_RES_ERR_OVERFLOW
  A computation produced an overflow i.e. a very large number.
1150 MSK_RES_ERR_LP_INCOMPATIBLE
  The problem cannot be written to an LP formatted file.
1501 MSK_RES_ERR_MIXED_PROBLEM
  The problem contains both conic and nonlinear constraints.
1700 MSK_RES_ERR_FEASREPAIR_CANNOT_RELAX
  An optimization problem cannot be relaxed. This is the case e.g. for general nonlinear optimization problems.
1207 MSK_RES_ERR_PARAM_NAME_INT
  The parameter name is not correct for an integer parameter.
3057 MSK_RES_ERR_SEN_SOLUTION_STATUS
  No optimal solution found to the original problem given for sensitivity analysis.
1225 MSK_RES_ERR_INF_LINT_INDEX
  A long integer information index is out of range for the specified type.
4008 MSK_RES_TRM_MIO_NUM_RELAXS
  The mixed-integer optimizer terminated as the maximum number of relaxations was reached.
405 MSK_RES_WRN_TOO_MANY_BASIS_VARS
  A basis with too many variables has been specified.
1081 MSK_RES_ERR_SPACE_NO_INFO
  No available information about the space usage.
1205 MSK_RES_ERR_PARAM_NAME
  The parameter name is not correct.
1106 MSK_RES_ERR_MPS_UNDEF_VAR_NAME
  An undefined variable name occurred in an MPS file.
200 MSK_RES_WRN_NZ_IN_UPR_TRI
  Non-zero elements specified in the upper triangle of a matrix were ignored.
505 MSK_RES_WRN_LICENSE_FEATURE_EXPIRE
  The license expires.
1263 MSK_RES_ERR_NEGATIVE_SURPLUS
  Negative surplus.
1404 MSK_RES_ERR_INV_QCON_SUBK
  Invalid value in qcsubk.
1406 MSK_RES_ERR_INV_QCON_SUBJ
  Invalid value in qcsubj.
705 MSK_RES_WRN_ZEROS_IN_SPARSE_ROW
  One or more (near) zero elements are specified in a sparse row of a matrix. It is redundant to specify zero elements. Hence it may indicate an error.
1198 MSK_RES_ERR_ARGUMENT_TYPE
  Incorrect argument type.
1017 MSK_RES_ERR_LICENSE_MOSEKLM_DAEMON
  The MOSEKLM license manager daemon is not up and running.
2901 MSK_RES_ERR_INVALID_WCHAR
  An invalid wchar string is encountered.
1059 MSK_RES_ERR_END_OF_FILE
  End of file reached.
3102 MSK_RES_ERR_AD_INVALID_CODELIST
  The code list data was invalid.
1462 MSK_RES_ERR_NAN_IN_BUC
  [[MathCmd 395]] contains an invalid floating point value, i.e. a NaN.
1290 MSK_RES_ERR_NONLINEAR_EQUALITY
  The model contains a nonlinear equality which defines a nonconvex set.
1055 MSK_RES_ERR_DATA_FILE_EXT
  The data file format cannot be determined from the file name.
1210 MSK_RES_ERR_PARAM_INDEX
  Parameter index is out of range.
1285 MSK_RES_ERR_FIRSTI
  Invalid firsti.
1000 MSK_RES_ERR_LICENSE
  Invalid license.
1299 MSK_RES_ERR_ARGUMENT_PERM_ARRAY
  An invalid permutation array is specified.
85 MSK_RES_WRN_LP_DROP_VARIABLE
  Ignored a variable because the variable was not previously defined. Usually this implies that a variable appears in the bound section but not in the objective or the constraints.
1287 MSK_RES_ERR_FIRSTJ
  Invalid firstj.
1432 MSK_RES_ERR_USER_NLO_FUNC
  The user-defined nonlinear function reported an error.
1219 MSK_RES_ERR_INF_DOU_INDEX
  A double information index is out of range for the specified type.
1286 MSK_RES_ERR_LASTI
  Invalid lasti.
1431 MSK_RES_ERR_USER_FUNC_RET_DATA
  An user function returned invalid data.
3900 MSK_RES_ERR_SIZE_LICENSE_NUMCORES
  The computer contains more cpu cores than the license allows for.
1199 MSK_RES_ERR_NR_ARGUMENTS
  Incorrect number of function arguments.
1293 MSK_RES_ERR_CON_Q_NOT_PSD
  The quadratic constraint matrix is not positive semi-definite as expected for a constraint with finite upper bound. This results in a nonconvex problem.
63 MSK_RES_WRN_ZERO_AIJ
  One or more zero elements are specified in A.
2504 MSK_RES_ERR_INV_NUMJ
  Invalid numj.
1650 MSK_RES_ERR_FACTOR
  An error occurred while factorizing a matrix.
3201 MSK_RES_ERR_INVALID_BRANCH_PRIORITY
  An invalid branching priority is specified. It should be nonnegative.
1216 MSK_RES_ERR_PARAM_IS_TOO_SMALL
  The parameter value is too small.
1163 MSK_RES_ERR_LP_WRITE_CONIC_PROBLEM
  The problem contains cones that cannot be written to an LP formatted file.
1002 MSK_RES_ERR_LICENSE_VERSION
  The license is valid for another version of MOSEK.
1240 MSK_RES_ERR_MAXNUMCON
  The maximum number of constraints specified is smaller than the number of constraints in the task.
1050 MSK_RES_ERR_UNKNOWN
  Unknown error.
1162 MSK_RES_ERR_READ_LP_NONEXISTING_NAME
  A variable never occurred in objective or constraints.
2503 MSK_RES_ERR_INV_NUMI
  Invalid numi.
1292 MSK_RES_ERR_NONLINEAR_RANGED
  The model contains a nonlinear ranged constraint which by definition defines a nonconvex set.
1047 MSK_RES_ERR_THREAD_MUTEX_UNLOCK
  Could not unlock a mutex.
1100 MSK_RES_ERR_MPS_FILE
  An error occurred while reading an MPS file.
1156 MSK_RES_ERR_WRITE_OPF_INVALID_VAR_NAME
  Empty variable names cannot be written to OPF files.
1152 MSK_RES_ERR_LP_DUP_SLACK_NAME
  The name of the slack variable added to a ranged constraint already exists.
2000 MSK_RES_ERR_NO_PRIMAL_INFEAS_CER
  A certificate of primal infeasibility is not available.
1158 MSK_RES_ERR_WRITE_LP_FORMAT
  Problem cannot be written as an LP file.
1461 MSK_RES_ERR_NAN_IN_BLC
  [[MathCmd 393]] contains an invalid floating point value, i.e. a NaN.
3058 MSK_RES_ERR_SEN_NUMERICAL
  Numerical difficulties encountered performing the sensitivity analysis.
3052 MSK_RES_ERR_SEN_INDEX_RANGE
  Index out of range in the sensitivity analysis file.
1027 MSK_RES_ERR_LICENSE_NO_SERVER_SUPPORT
  The license server does not support the requested feature. Possible reasons for this error include:
  • The feature has expired.
  • The feature's start date is later than today's date.
  • The version requested is higher than feature's the highest supported version.
  • A corrupted license file.
Try restarting the license and inspect the license server debug file, usually called lmgrd.log.
66 MSK_RES_WRN_SPAR_MAX_LEN
  A value for a string parameter is longer than the buffer that is supposed to hold it.
3050 MSK_RES_ERR_SEN_FORMAT
  Syntax error in sensitivity analysis file.
1407 MSK_RES_ERR_INV_QCON_VAL
  Invalid value in qcval.
1206 MSK_RES_ERR_PARAM_NAME_DOU
  The parameter name is not correct for a double parameter.
1172 MSK_RES_ERR_OPF_PREMATURE_EOF
  Premature end of file in an OPF file.
1300 MSK_RES_ERR_CONE_INDEX
  An index of a non-existing cone has been specified.
1470 MSK_RES_ERR_NAN_IN_C
  c contains an invalid floating point value, i.e. a NaN.
1066 MSK_RES_ERR_LIVING_TASKS
  All tasks associated with an enviroment must be deleted before the environment is deleted. There are still some undeleted tasks.
1304 MSK_RES_ERR_MAXNUMCONE
  The value specified for maxnumcone is too small.
1103 MSK_RES_ERR_MPS_NULL_CON_NAME
  An empty constraint name is used in an MPS file.
1417 MSK_RES_ERR_QCON_UPPER_TRIANGLE
  An element in the upper triangle of a [[MathCmd 58]] is specified. Only elements in the lower triangle should be specified.
1171 MSK_RES_ERR_LP_INVALID_CON_NAME
  A constraint name is invalid when used in an LP formatted file.
1125 MSK_RES_ERR_MPS_TAB_IN_FIELD2
  A tab char occurred in field 2.
270 MSK_RES_WRN_MIO_INFEASIBLE_FINAL
  The final mixed-integer problem with all the integer variables fixed at their optimal values is infeasible.
710 MSK_RES_WRN_ZEROS_IN_SPARSE_COL
  One or more (near) zero elements are specified in a sparse column of a matrix. It is redundant to specify zero elements. Hence, it may indicate an error.
1433 MSK_RES_ERR_USER_NLO_EVAL
  The user-defined nonlinear function reported an error.
1232 MSK_RES_ERR_INF_TYPE
  The information type is invalid.
800 MSK_RES_WRN_INCOMPLETE_LINEAR_DEPENDENCY_CHECK
  The linear dependency check(s) was not completed and therefore the A matrix may contain linear dependencies.
503 MSK_RES_WRN_USING_GENERIC_NAMES
  The file writer reverts to generic names because a name is blank.
1127 MSK_RES_ERR_MPS_TAB_IN_FIELD5
  A tab char occurred in field 5.
1056 MSK_RES_ERR_INVALID_FILE_NAME
  An invalid file name has been specified.
804 MSK_RES_WRN_WRITE_DISCARDED_CFIX
  The fixed objective term could not be converted to a variable and was discarded in the output file.
1415 MSK_RES_ERR_QOBJ_UPPER_TRIANGLE
  An element in the upper triangle of [[MathCmd 56]] is specified. Only elements in the lower triangle should be specified.
1054 MSK_RES_ERR_FILE_WRITE
  File write error.
1048 MSK_RES_ERR_THREAD_CREATE
  Could not create a thread. This error may occur if a large number of environments are created and not deleted again. In any case it is a good practice to minimize the number of environments created.
1243 MSK_RES_ERR_MAXNUMQNZ
  The maximum number of non-zeros specified for the Q matrices is smaller than the number of non-zeros in the current Q matrices.
2506 MSK_RES_ERR_CANNOT_HANDLE_NL
  A function cannot handle a task with nonlinear function call-backs.
1600 MSK_RES_ERR_NO_BASIS_SOL
  No basic solution is defined.
1131 MSK_RES_ERR_ORD_INVALID
  Invalid content in branch ordering file.
1303 MSK_RES_ERR_CONE_REP_VAR
  A variable is included multiple times in the cone.
1075 MSK_RES_ERR_INVALID_OBJ_NAME
  An invalid objective name is specified.
1052 MSK_RES_ERR_FILE_OPEN
  Error while opening a file.
250 MSK_RES_WRN_IGNORE_INTEGER
  Ignored integer constraints.
1296 MSK_RES_ERR_OBJ_Q_NOT_NSD
  The quadratic coefficient matrix in the objective is not negative semi-definite as expected for a maximization problem.
1064 MSK_RES_ERR_INVALID_TASK
  The task is invalid.
1065 MSK_RES_ERR_NULL_POINTER
  An argument to a function is unexpectedly a NULL pointer.
3059 MSK_RES_ERR_CONCURRENT_OPTIMIZER
  An unsupported optimizer was chosen for use with the concurrent optimizer.
3005 MSK_RES_ERR_API_FATAL_ERROR
  An internal error occurred in the API. Please report this problem.
1550 MSK_RES_ERR_INV_OPTIMIZER
  An invalid optimizer has been chosen for the problem. This means that the simplex or the conic optimizer is chosen to optimize a nonlinear problem.
1310 MSK_RES_ERR_REMOVE_CONE_VARIABLE
  A variable cannot be removed because it will make a cone invalid.
62 MSK_RES_WRN_LARGE_AIJ
  A numerically large value is specified for an [[MathCmd 686]] element in A. The parameter MSK_DPAR_DATA_TOL_AIJ_LARGE controls when an [[MathCmd 686]] is considered large.
1208 MSK_RES_ERR_PARAM_NAME_STR
  The parameter name is not correct for a string parameter.
1018 MSK_RES_ERR_LICENSE_FEATURE
  A requested feature is not available in the license file(s). Most likely due to an incorrect license system setup.
251 MSK_RES_WRN_NO_GLOBAL_OPTIMIZER
  No global optimizer is available.
1040 MSK_RES_ERR_LINK_FILE_DLL
  A file cannot be linked to a stream in the DLL version.
1701 MSK_RES_ERR_FEASREPAIR_SOLVING_RELAXED
  The relaxed problem could not be solved to optimality. Please consult the log file for further details.
1221 MSK_RES_ERR_INDEX_ARR_IS_TOO_SMALL
  An index in an array argument is too small.
1259 MSK_RES_ERR_SOLVER_PROBTYPE
  Problem type does not match the chosen optimizer.
1220 MSK_RES_ERR_INF_INT_INDEX
  An integer information index is out of range for the specified type.
1053 MSK_RES_ERR_FILE_READ
  File read error.
1440 MSK_RES_ERR_USER_NLO_EVAL_HESSUBI
  The user-defined nonlinear function reported an invalid subscript in the Hessian.
1441 MSK_RES_ERR_USER_NLO_EVAL_HESSUBJ
  The user-defined nonlinear function reported an invalid subscript in the Hessian.
300 MSK_RES_WRN_SOL_FILTER
  Invalid solution filter is specified.
4030 MSK_RES_TRM_INTERNAL
  The optimizer terminated due to some internal reason. Please contact MOSEK support.
1110 MSK_RES_ERR_MPS_NO_OBJECTIVE
  No objective is defined in an MPS file.
1403 MSK_RES_ERR_INV_QOBJ_VAL
  Invalid value in qoval.
1400 MSK_RES_ERR_INFINITE_BOUND
  A numerically huge bound value is specified.
1030 MSK_RES_ERR_OPEN_DL
  A dynamic link library could not be opened.
3001 MSK_RES_ERR_API_ARRAY_TOO_SMALL
  An input array was too short.
1046 MSK_RES_ERR_THREAD_MUTEX_LOCK
  Could not lock a mutex.
1262 MSK_RES_ERR_LAST
  Invalid index last. A given index was out of expected range.
1151 MSK_RES_ERR_LP_EMPTY
  The problem cannot be written to an LP formatted file.
1011 MSK_RES_ERR_SIZE_LICENSE_VAR
  The problem has too many variables to be solved with the available license.
1062 MSK_RES_ERR_INVALID_STREAM
  An invalid stream is referenced.
2505 MSK_RES_ERR_CANNOT_CLONE_NL
  A task with a nonlinear function call-back cannot be cloned.
2520 MSK_RES_ERR_INVALID_ACCMODE
  An invalid access mode is specified.
1250 MSK_RES_ERR_NUMCONLIM
  Maximum number of constraints limit is exceeded.
2550 MSK_RES_ERR_MBT_INCOMPATIBLE
  The MBT file is incompatible with this platform. This results from reading a file on a 32 bit platform generated on a 64 bit platform.
1104 MSK_RES_ERR_MPS_NULL_VAR_NAME
  An empty variable name is used in an MPS file.
72 MSK_RES_WRN_MPS_SPLIT_BOU_VECTOR
  A BOUNDS vector is split into several nonadjacent parts in an MPS file.
1026 MSK_RES_ERR_LICENSE_SERVER_VERSION
  The version specified in the checkout request is greater than the highest version number the daemon supports.
1025 MSK_RES_ERR_LICENSE_INVALID_HOSTID
  The host ID specified in the license file does not match the host ID of the computer.
1045 MSK_RES_ERR_THREAD_MUTEX_INIT
  Could not initialize a mutex.
54 MSK_RES_WRN_LARGE_CON_FX
  An equality constraint is fixed to a numerically large value. This can cause numerical problems.
1280 MSK_RES_ERR_INV_NAME_ITEM
  An invalid name item code is used.
3106 MSK_RES_ERR_AD_MISSING_RETURN
  The code list data was invalid. Missing return operation in function.
53 MSK_RES_WRN_LARGE_UP_BOUND
  A numerically large upper bound value is specified.
3910 MSK_RES_ERR_INFEAS_UNDEFINED
  The requested value is not defined for this solution type.
901 MSK_RES_WRN_ANA_C_ZERO
  This warning is issued by the problem analyzer, if the coefficients in the linear part of the objective are all zero.
1112 MSK_RES_ERR_MPS_MUL_CON_NAME
  A constraint name was specified multiple times in the ROWS section.
1801 MSK_RES_ERR_INVALID_IOMODE
  Invalid io mode.
1115 MSK_RES_ERR_MPS_INV_SEC_ORDER
  The sections in the MPS data file are not in the correct order.
1016 MSK_RES_ERR_LICENSE_MAX
  Maximum number of licenses is reached.
4007 MSK_RES_TRM_USER_CALLBACK
  The optimizer terminated due to the return of the user-defined call-back function.
805 MSK_RES_WRN_CONSTRUCT_SOLUTION_INFEAS
  After fixing the integer variables at the suggested values then the problem is infeasible.
1058 MSK_RES_ERR_INVALID_MBT_FILE
  A MOSEK binary task file is invalid.
1294 MSK_RES_ERR_CON_Q_NOT_NSD
  The quadratic constraint matrix is not negative semi-definite as expected for a constraint with finite lower bound. This results in a nonconvex problem.
3600 MSK_RES_ERR_XML_INVALID_PROBLEM_TYPE
  The problem type is not supported by the XML format.
1231 MSK_RES_ERR_INF_INT_NAME
  An integer information name is invalid.
1107 MSK_RES_ERR_MPS_INV_CON_KEY
  An invalid constraint key occurred in an MPS file.
1425 MSK_RES_ERR_FIXED_BOUND_VALUES
  A fixed constraint/variable has been specified using the bound keys but the numerical value of the lower and upper bound is different.
4025 MSK_RES_TRM_NUMERICAL_PROBLEM
  The optimizer terminated due to numerical problems.
3056 MSK_RES_ERR_SEN_INVALID_REGEXP
  Syntax error in regexp or regexp longer than 1024.
52 MSK_RES_WRN_LARGE_LO_BOUND
  A numerically large lower bound value is specified.
3999 MSK_RES_ERR_API_INTERNAL
  An internal fatal error occurred in an interface function.
70 MSK_RES_WRN_MPS_SPLIT_RHS_VECTOR
  An RHS vector is split into several nonadjacent parts in an MPS file.
3053 MSK_RES_ERR_SEN_BOUND_INVALID_UP
  Analysis of upper bound requested for an index, where no upper bound exists.
1702 MSK_RES_ERR_FEASREPAIR_INCONSISTENT_BOUND
  The upper bound is less than the lower bound for a variable or a constraint. Please correct this before running the feasibility repair.
1449 MSK_RES_ERR_Y_IS_UNDEFINED
  The solution item y is undefined.
3200 MSK_RES_ERR_INVALID_BRANCH_DIRECTION
  An invalid branching direction is specified.
1430 MSK_RES_ERR_USER_FUNC_RET
  An user function reported an error.
1750 MSK_RES_ERR_NAME_MAX_LEN
  A name is longer than the buffer that is supposed to hold it.
1305 MSK_RES_ERR_CONE_TYPE
  Invalid cone type specified.
4005 MSK_RES_TRM_USER_BREAK
  Not in use.
1256 MSK_RES_ERR_INV_BKC
  Invalid bound key is specified for a constraint.
4020 MSK_RES_TRM_MAX_NUM_SETBACKS
  The optimizer terminated as the maximum number of set-backs was reached. This indicates numerical problems and a possibly badly formulated problem.
4015 MSK_RES_TRM_NUM_MAX_NUM_INT_SOLUTIONS
  The mixed-integer optimizer terminated as the maximum number of feasible solutions was reached.
3101 MSK_RES_ERR_IDENTICAL_TASKS
  Some tasks related to this function call were identical. Unique tasks were expected.
1020 MSK_RES_ERR_LICENSE_CANNOT_ALLOCATE
  The license system cannot allocate the memory required.
904 MSK_RES_WRN_ANA_ALMOST_INT_BOUNDS
  This warning is issued by the problem analyzer if a constraint is bound nearly integral.
1402 MSK_RES_ERR_INV_QOBJ_SUBJ
  Invalid value in qosubj.
1302 MSK_RES_ERR_CONE_OVERLAP
  A new cone which variables overlap with an existing cone has been specified.
807 MSK_RES_WRN_CONSTRUCT_INVALID_SOL_ITG
  The intial value for one or more of the integer variables is not feasible.
1401 MSK_RES_ERR_INV_QOBJ_SUBI
  Invalid value in qosubi.
1153 MSK_RES_ERR_WRITE_MPS_INVALID_NAME
  An invalid name is created while writing an MPS file. Usually this will make the MPS file unreadable.
1553 MSK_RES_ERR_MIO_NOT_LOADED
  The mixed-integer optimizer is not loaded.
1061 MSK_RES_ERR_NULL_TASK
  task is a NULL pointer.
1070 MSK_RES_ERR_BLANK_NAME
  An all blank name has been specified.
1252 MSK_RES_ERR_TOO_SMALL_MAXNUMANZ
  The maximum number of non-zeros specified for A is smaller than the number of non-zeros in the current A.
1197 MSK_RES_ERR_ARGUMENT_LENNEQ
  Incorrect length of arguments.
500 MSK_RES_WRN_LICENSE_EXPIRE
  The license expires.
1200 MSK_RES_ERR_IN_ARGUMENT
  A function argument is incorrect.
1051 MSK_RES_ERR_SPACE
  Out of space.
1241 MSK_RES_ERR_MAXNUMVAR
  The maximum number of variables specified is smaller than the number of variables in the task.
1800 MSK_RES_ERR_INVALID_COMPRESSION
  Invalid compression type.
1101 MSK_RES_ERR_MPS_INV_FIELD
  A field in the MPS file is invalid. Probably it is too wide.
1060 MSK_RES_ERR_NULL_ENV
  env is a NULL pointer.
3500 MSK_RES_ERR_INTERNAL_TEST_FAILED
  An internal unit test function failed.
501 MSK_RES_WRN_LICENSE_SERVER
  The license server is not responding.
1122 MSK_RES_ERR_MPS_INVALID_OBJSENSE
  An invalid objective sense is specified.
1168 MSK_RES_ERR_OPF_FORMAT
  Syntax error in an OPF file
900 MSK_RES_WRN_ANA_LARGE_BOUNDS
  This warning is issued by the problem analyzer, if one or more constraint or variable bounds are very large. One should consider omitting these bounds entirely by setting them to +inf or -inf.
1071 MSK_RES_ERR_DUP_NAME
  The same name was used multiple times for the same problem item type.
1116 MSK_RES_ERR_MPS_MUL_CSEC
  Multiple CSECTIONs are given the same name.
51 MSK_RES_WRN_LARGE_BOUND
  A numerically large bound value is specified.
50 MSK_RES_WRN_OPEN_PARAM_FILE
  The parameter file could not be opened.
1291 MSK_RES_ERR_NONCONVEX
  The optimization problem is nonconvex.
3100 MSK_RES_ERR_UNB_STEP_SIZE
  A step size in an optimizer was unexpectedly unbounded. For instance, if the step-size becomes unbounded in phase 1 of the simplex algorithm then an error occurs. Normally this will happen only if the problem is badly formulated. Please contact MOSEK support if this error occurs.
1615 MSK_RES_ERR_BASIS_SINGULAR
  The basis is singular and hence cannot be factored.
1155 MSK_RES_ERR_LP_FREE_CONSTRAINT
  Free constraints cannot be written in LP file format.
1445 MSK_RES_ERR_INVALID_OBJECTIVE_SENSE
  An invalid objective sense is specified.
0 MSK_RES_OK
  No error occurred.
3002 MSK_RES_ERR_API_CB_CONNECT
  Failed to connect a callback object.
1253 MSK_RES_ERR_INV_APTRE
  aptre[j] is strictly smaller than aptrb[j] for some j.
1013 MSK_RES_ERR_OPTIMIZER_LICENSE
  The optimizer required is not licensed.
1007 MSK_RES_ERR_FILE_LICENSE
  Invalid license file.
1160 MSK_RES_ERR_LP_FORMAT
  Syntax error in an LP file.
1237 MSK_RES_ERR_SOLITEM
  The solution item number solitem is invalid. Please note that MSK_SOL_ITEM_SNX is invalid for the basic solution.
1010 MSK_RES_ERR_SIZE_LICENSE_CON
  The problem has too many constraints to be solved with the available license.
1118 MSK_RES_ERR_MPS_CONE_OVERLAP
  A variable is specified to be a member of several cones.
1090 MSK_RES_ERR_READ_FORMAT
  The specified format cannot be read.
1408 MSK_RES_ERR_QCON_SUBI_TOO_SMALL
  Invalid value in qcsubi.
4006 MSK_RES_TRM_STALL
  The optimizer terminated due to slow progress. Normally there are three possible reasons for this: Either a bug in MOSEK, the problem is badly formulated, or, for nonlinear problems, the nonlinear call-back functions are incorrect.The solution returned may or may not be of acceptable quality. Therefore, the solution status should be examined to determine the status of the solution.In particular, if a linear optimization problem is solved with the interior-point optimizer with basis identification turned on, the returned solution may be of acceptable quality, even in the optimizer stalled.
1580 MSK_RES_ERR_POSTSOLVE
  An error occurred during the postsolve. Please contact MOSEK support.
1215 MSK_RES_ERR_PARAM_IS_TOO_LARGE
  The parameter value is too large.
1164 MSK_RES_ERR_LP_WRITE_GECO_PROBLEM
  The problem contains general convex terms that cannot be written to an LP formatted file.
1281 MSK_RES_ERR_PRO_ITEM
  An invalid problem is used.
1057 MSK_RES_ERR_INVALID_SOL_FILE_NAME
  An invalid file name has been specified.
1271 MSK_RES_ERR_INV_CONE_TYPE_STR
  Invalid cone type string encountered.
1283 MSK_RES_ERR_INVALID_FORMAT_TYPE
  Invalid format type.
57 MSK_RES_WRN_LARGE_CJ
  A numerically large value is specified for one [[MathCmd 688]].
1035 MSK_RES_ERR_OLDER_DLL
  The dynamic link library is older than the specified version.
1019 MSK_RES_ERR_PLATFORM_NOT_LICENSED
  A requested license feature is not available for the required platform.
1119 MSK_RES_ERR_MPS_CONE_REPEAT
  A variable is repeated within the CSECTION.
3051 MSK_RES_ERR_SEN_UNDEF_NAME
  An undefined name was encountered in the sensitivity analysis file.
1380 MSK_RES_ERR_HUGE_AIJ
  A numerically huge value is specified for an [[MathCmd 686]] element in A. The parameter MSK_DPAR_DATA_TOL_AIJ_HUGE controls when an [[MathCmd 686]] is considered huge.
71 MSK_RES_WRN_MPS_SPLIT_RAN_VECTOR
  A RANGE vector is split into several nonadjacent parts in an MPS file.
3054 MSK_RES_ERR_SEN_BOUND_INVALID_LO
  Analysis of lower bound requested for an index, where no lower bound exists.
3105 MSK_RES_ERR_AD_MISSING_OPERAND
  The code list data was invalid. Missing operand for operator.
1111 MSK_RES_ERR_MPS_SPLITTED_VAR
  All elements in a column of the A matrix must be specified consecutively. Hence, it is illegal to specify non-zero elements in A for variable 1, then for variable 2 and then variable 1 again.
1080 MSK_RES_ERR_SPACE_LEAKING
  MOSEK is leaking memory. This can be due to either an incorrect use of MOSEK or a bug.
1201 MSK_RES_ERR_ARGUMENT_DIMENSION
  A function argument is of incorrect dimension.
1159 MSK_RES_ERR_READ_LP_MISSING_END_TAG
  Missing End tag in LP file.
4001 MSK_RES_TRM_MAX_TIME
  The optimizer terminated at the maximum amount of time.
810 MSK_RES_WRN_CONSTRUCT_NO_SOL_ITG
  The construct solution requires an integer solution.
3700 MSK_RES_ERR_INVALID_AMPL_STUB
  Invalid AMPL stub.
1260 MSK_RES_ERR_OBJECTIVE_RANGE
  Empty objective range.
1238 MSK_RES_ERR_WHICHITEM_NOT_ALLOWED
  whichitem is unacceptable.
1471 MSK_RES_ERR_NAN_IN_BLX
  [[MathCmd 397]] contains an invalid floating point value, i.e. a NaN.
1236 MSK_RES_ERR_WHICHSOL
  The solution defined by compwhichsol does not exists.
801 MSK_RES_WRN_ELIMINATOR_SPACE
  The eliminator is skipped at least once due to lack of space.
1049 MSK_RES_ERR_THREAD_COND_INIT
  Could not initialize a condition.
1269 MSK_RES_ERR_INV_SK_STR
  Invalid status key string encountered.
1036 MSK_RES_ERR_NEWER_DLL
  The dynamic link library is newer than the specified version.
1251 MSK_RES_ERR_NUMVARLIM
  Maximum number of variables limit is exceeded.
1113 MSK_RES_ERR_MPS_MUL_QSEC
  Multiple QSECTIONs are specified for a constraint in the MPS data file.
502 MSK_RES_WRN_EMPTY_NAME
  A variable or constraint name is empty. The output file may be invalid.
4003 MSK_RES_TRM_MIO_NEAR_REL_GAP
  The mixed-integer optimizer terminated because the near optimal relative gap tolerance was satisfied.
80 MSK_RES_WRN_LP_OLD_QUAD_FORMAT
  Missing '/2' after quadratic expressions in bound or objective.
1272 MSK_RES_ERR_INV_CONE_TYPE
  Invalid cone type code is encountered.
1102 MSK_RES_ERR_MPS_INV_MARKER
  An invalid marker has been specified in the MPS file.
1230 MSK_RES_ERR_INF_DOU_NAME
  A double information name is invalid.
1264 MSK_RES_ERR_NEGATIVE_APPEND
  Cannot append a negative number.
1270 MSK_RES_ERR_INV_SK
  Invalid status key code.
1006 MSK_RES_ERR_PROB_LICENSE
  The software is not licensed to solve the problem.
3104 MSK_RES_ERR_AD_INVALID_OPERAND
  The code list data was invalid. An unknown operand was used.
1015 MSK_RES_ERR_LICENSE_SERVER
  The license server is not responding.
400 MSK_RES_WRN_TOO_FEW_BASIS_VARS
  An incomplete basis has been specified. Too few basis variables are specified.
1161 MSK_RES_ERR_WRITE_LP_NON_UNIQUE_NAME
  An auto-generated name is not unique.
1108 MSK_RES_ERR_MPS_INV_BOUND_KEY
  An invalid bound key occurred in an MPS file.
1472 MSK_RES_ERR_NAN_IN_BUX
  [[MathCmd 399]] contains an invalid floating point value, i.e. a NaN.
1450 MSK_RES_ERR_NAN_IN_DOUBLE_DATA
  An invalid floating point value was used in some double data.
1109 MSK_RES_ERR_MPS_INV_SEC_NAME
  An invalid section name occurred in an MPS file.
1266 MSK_RES_ERR_BASIS
  An invalid basis is specified. Either too many or too few basis variables are specified.
1257 MSK_RES_ERR_INV_BKX
  An invalid bound key is specified for a variable.
351 MSK_RES_WRN_SOL_FILE_IGNORED_CON
  One or more lines in the constraint section were ignored when reading a solution file.
902 MSK_RES_WRN_ANA_EMPTY_COLS
  This warning is issued by the problem analyzer, if columns, in which all coefficients are zero, are found.
1128 MSK_RES_ERR_MPS_INVALID_OBJ_NAME
  An invalid objective name is specified.
1217 MSK_RES_ERR_PARAM_VALUE_STR
  The parameter value string is incorrect.
1222 MSK_RES_ERR_INDEX_ARR_IS_TOO_LARGE
  An index in an array argument is too large.
1306 MSK_RES_ERR_CONE_TYPE_STR
  Invalid cone type specified.
1405 MSK_RES_ERR_INV_QCON_SUBI
  Invalid value in qcsubi.
1760 MSK_RES_ERR_NAME_IS_NULL
  The name buffer is a NULL pointer.
1258 MSK_RES_ERR_INV_VAR_TYPE
  An invalid variable type is specified for a variable.
1157 MSK_RES_ERR_LP_FILE_FORMAT
  Syntax error in an LP file.
1021 MSK_RES_ERR_LICENSE_CANNOT_CONNECT
  MOSEK cannot connect to the license server. Most likely the license server is not up and running.
4002 MSK_RES_TRM_OBJECTIVE_RANGE
  The optimizer terminated on the bound of the objective range.
1126 MSK_RES_ERR_MPS_TAB_IN_FIELD3
  A tab char occurred in field 3.
350 MSK_RES_WRN_UNDEF_SOL_FILE_NAME
  Undefined name occurred in a solution.
1255 MSK_RES_ERR_INV_BK
  Invalid bound key.
1169 MSK_RES_ERR_OPF_NEW_VARIABLE
  Introducing new variables is now allowed. When a [variables] section is present, it is not allowed to introduce new variables later in the problem.
1014 MSK_RES_ERR_FLEXLM
  The FLEXlm license manager reported an error.
1275 MSK_RES_ERR_INVALID_SURPLUS
  Invalid surplus.
65 MSK_RES_WRN_NAME_MAX_LEN
  A name is longer than the buffer that is supposed to hold it.
1301 MSK_RES_ERR_CONE_SIZE
  A cone with too few members is specified.
1261 MSK_RES_ERR_FIRST
  Invalid first.
1473 MSK_RES_ERR_NAN_IN_AIJ
  [[MathCmd 686]] contains an invalid floating point value, i.e. a NaN.
4031 MSK_RES_TRM_INTERNAL_STOP
  The optimizer terminated for internal reasons. Please contact MOSEK support.
1117 MSK_RES_ERR_MPS_CONE_TYPE
  Invalid cone type specified in a CSECTION.
1005 MSK_RES_ERR_SIZE_LICENSE
  The problem is bigger than the license.
1409 MSK_RES_ERR_QCON_SUBI_TOO_LARGE
  Invalid value in qcsubi.
1375 MSK_RES_ERR_HUGE_C
  A huge value in absolute size is specified for one [[MathCmd 688]].
1446 MSK_RES_ERR_UNDEFINED_OBJECTIVE_SENSE
  The objective sense has not been specified before the optimization.
4000 MSK_RES_TRM_MAX_ITERATIONS
  The optimizer terminated at the maximum number of iterations.
802 MSK_RES_WRN_PRESOLVE_OUTOFSPACE
  The presolve is incomplete due to lack of space.
1130 MSK_RES_ERR_ORD_INVALID_BRANCH_DIR
  An invalid branch direction key is specified.
3103 MSK_RES_ERR_AD_INVALID_OPERATOR
  The code list data was invalid. An unknown operator was used.
1166 MSK_RES_ERR_WRITING_FILE
  An error occurred while writing file
2502 MSK_RES_ERR_INV_MARKJ
  Invalid value in markj.
2500 MSK_RES_ERR_NO_SOLUTION_IN_CALLBACK
  The required solution is not available.
2900 MSK_RES_ERR_INVALID_UTF8
  An invalid UTF8 string is encountered.
1105 MSK_RES_ERR_MPS_UNDEF_CON_NAME
  An undefined constraint name occurred in an MPS file.
1012 MSK_RES_ERR_SIZE_LICENSE_INTVAR
  The problem contains too many integer variables to be solved with the available license.
3800 MSK_RES_ERR_INT64_TO_INT32_CAST
  An 32 bit integer could not cast to a 64 bit integer.
1552 MSK_RES_ERR_NO_OPTIMIZER_VAR_TYPE
  No optimizer is available for this class of optimization problems.

I.41. Response code type

1 MSK_RESPONSE_WRN
  The response code is a warning.
2 MSK_RESPONSE_TRM
  The response code is an optimizer termination status.
4 MSK_RESPONSE_UNK
  The response code does not belong to any class.
0 MSK_RESPONSE_OK
  The response code is OK.
3 MSK_RESPONSE_ERR
  The response code is an error.

I.42. Scaling type

0 MSK_SCALING_METHOD_POW2
  Scales only with power of 2 leaving the mantissa untouched.
1 MSK_SCALING_METHOD_FREE
  The optimizer chooses the scaling heuristic.

I.43. Scaling type

1 MSK_SCALING_NONE
  No scaling is performed.
2 MSK_SCALING_MODERATE
  A conservative scaling is performed.
3 MSK_SCALING_AGGRESSIVE
  A very aggressive scaling is performed.
0 MSK_SCALING_FREE
  The optimizer chooses the scaling heuristic.

I.44. Sensitivity types

1 MSK_SENSITIVITY_TYPE_OPTIMAL_PARTITION
  Optimal partition sensitivity analysis is performed.
0 MSK_SENSITIVITY_TYPE_BASIS
  Basis sensitivity analysis is performed.

I.45. Degeneracy strategies

0 MSK_SIM_DEGEN_NONE
  The simplex optimizer should use no degeneration strategy.
3 MSK_SIM_DEGEN_MODERATE
  The simplex optimizer should use a moderate degeneration strategy.
4 MSK_SIM_DEGEN_MINIMUM
  The simplex optimizer should use a minimum degeneration strategy.
2 MSK_SIM_DEGEN_AGGRESSIVE
  The simplex optimizer should use an aggressive degeneration strategy.
1 MSK_SIM_DEGEN_FREE
  The simplex optimizer chooses the degeneration strategy.

I.46. Exploit duplicate columns.

1 MSK_SIM_EXPLOIT_DUPVEC_ON
  Allow the simplex optimizer to exploit duplicated columns.
0 MSK_SIM_EXPLOIT_DUPVEC_OFF
  Disallow the simplex optimizer to exploit duplicated columns.
2 MSK_SIM_EXPLOIT_DUPVEC_FREE
  The simplex optimizer can choose freely.

I.47. Hot-start type employed by the simplex optimizer

0 MSK_SIM_HOTSTART_NONE
  The simplex optimizer performs a coldstart.
2 MSK_SIM_HOTSTART_STATUS_KEYS
  Only the status keys of the constraints and variables are used to choose the type of hot-start.
1 MSK_SIM_HOTSTART_FREE
  The simplex optimize chooses the hot-start type.

I.48. Problem reformulation.

1 MSK_SIM_REFORMULATION_ON
  Allow the simplex optimizer to reformulate the problem.
3 MSK_SIM_REFORMULATION_AGGRESSIVE
  The simplex optimizer should use an aggressive reformulation strategy.
0 MSK_SIM_REFORMULATION_OFF
  Disallow the simplex optimizer to reformulate the problem.
2 MSK_SIM_REFORMULATION_FREE
  The simplex optimizer can choose freely.

I.49. Simplex selection strategy

1 MSK_SIM_SELECTION_FULL
  The optimizer uses full pricing.
5 MSK_SIM_SELECTION_PARTIAL
  The optimizer uses a partial selection approach. The approach is usually beneficial if the number of variables is much larger than the number of constraints.
0 MSK_SIM_SELECTION_FREE
  The optimizer chooses the pricing strategy.
2 MSK_SIM_SELECTION_ASE
  The optimizer uses approximate steepest-edge pricing.
3 MSK_SIM_SELECTION_DEVEX
  The optimizer uses devex steepest-edge pricing (or if it is not available an approximate steep-edge selection).
4 MSK_SIM_SELECTION_SE
  The optimizer uses steepest-edge selection (or if it is not available an approximate steep-edge selection).

I.50. Solution items

4 MSK_SOL_ITEM_SUC
  Lagrange multipliers for upper bounds on the constraints.
0 MSK_SOL_ITEM_XC
  Solution for the constraints.
1 MSK_SOL_ITEM_XX
  Variable solution.
2 MSK_SOL_ITEM_Y
  Lagrange multipliers for equations.
5 MSK_SOL_ITEM_SLX
  Lagrange multipliers for lower bounds on the variables.
6 MSK_SOL_ITEM_SUX
  Lagrange multipliers for upper bounds on the variables.
7 MSK_SOL_ITEM_SNX
  Lagrange multipliers corresponding to the conic constraints on the variables.
3 MSK_SOL_ITEM_SLC
  Lagrange multipliers for lower bounds on the constraints.

I.51. Solution status keys

6 MSK_SOL_STA_DUAL_INFEAS_CER
  The solution is a certificate of dual infeasibility.
5 MSK_SOL_STA_PRIM_INFEAS_CER
  The solution is a certificate of primal infeasibility.
0 MSK_SOL_STA_UNKNOWN
  Status of the solution is unknown.
8 MSK_SOL_STA_NEAR_OPTIMAL
  The solution is nearly optimal.
12 MSK_SOL_STA_NEAR_PRIM_INFEAS_CER
  The solution is almost a certificate of primal infeasibility.
2 MSK_SOL_STA_PRIM_FEAS
  The solution is primal feasible.
15 MSK_SOL_STA_NEAR_INTEGER_OPTIMAL
  The primal solution is near integer optimal.
10 MSK_SOL_STA_NEAR_DUAL_FEAS
  The solution is nearly dual feasible.
14 MSK_SOL_STA_INTEGER_OPTIMAL
  The primal solution is integer optimal.
13 MSK_SOL_STA_NEAR_DUAL_INFEAS_CER
  The solution is almost a certificate of dual infeasibility.
11 MSK_SOL_STA_NEAR_PRIM_AND_DUAL_FEAS
  The solution is nearly both primal and dual feasible.
1 MSK_SOL_STA_OPTIMAL
  The solution is optimal.
4 MSK_SOL_STA_PRIM_AND_DUAL_FEAS
  The solution is both primal and dual feasible.
9 MSK_SOL_STA_NEAR_PRIM_FEAS
  The solution is nearly primal feasible.
3 MSK_SOL_STA_DUAL_FEAS
  The solution is dual feasible.

I.52. Solution types

2 MSK_SOL_ITG
  The integer solution.
0 MSK_SOL_ITR
  The interior solution.
1 MSK_SOL_BAS
  The basic solution.

I.53. Solve primal or dual form

1 MSK_SOLVE_PRIMAL
  The optimizer should solve the primal problem.
2 MSK_SOLVE_DUAL
  The optimizer should solve the dual problem.
0 MSK_SOLVE_FREE
  The optimizer is free to solve either the primal or the dual problem.

I.54. String parameter types

8 MSK_SPAR_PARAM_COMMENT_SIGN
  Only the first character in this string is used. It is considered as a start of comment sign in the MOSEK parameter file. Spaces are ignored in the string.
3 MSK_SPAR_FEASREPAIR_NAME_PREFIX
  Not applicable.
0 MSK_SPAR_BAS_SOL_FILE_NAME
  Name of the bas solution file.
12 MSK_SPAR_READ_MPS_OBJ_NAME
  Name of the free constraint used as objective function. An empty name means that the first constraint is used as objective function.
5 MSK_SPAR_FEASREPAIR_NAME_WSUMVIOL
  The constraint and variable associated with the total weighted sum of violations are each given the name of this parameter postfixed with CON and VAR respectively.
4 MSK_SPAR_FEASREPAIR_NAME_SEPARATOR
  Not applicable.
10 MSK_SPAR_PARAM_WRITE_FILE_NAME
  The parameter database is written to this file.
6 MSK_SPAR_INT_SOL_FILE_NAME
  Name of the int solution file.
14 MSK_SPAR_READ_MPS_RHS_NAME
  Name of the RHS used. An empty name means that the first RHS vector is used.
21 MSK_SPAR_STAT_FILE_NAME
  Statistics file name.
24 MSK_SPAR_WRITE_LP_GEN_VAR_NAME
  Sometimes when an LP file is written additional variables must be inserted. They will have the prefix denoted by this parameter.
1 MSK_SPAR_DATA_FILE_NAME
  Data are read and written to this file.
13 MSK_SPAR_READ_MPS_RAN_NAME
  Name of the RANGE vector used. An empty name means that the first RANGE vector is used.
17 MSK_SPAR_SOL_FILTER_XC_LOW
  A filter used to determine which constraints should be listed in the solution file. A value of “0.5” means that all constraints having xc[i]>0.5 should be listed, whereas “+0.5” means that all constraints having xc[i]>=blc[i]+0.5 should be listed. An empty filter means that no filter is applied.
18 MSK_SPAR_SOL_FILTER_XC_UPR
  A filter used to determine which constraints should be listed in the solution file. A value of “0.5” means that all constraints having xc[i]<0.5 should be listed, whereas “-0.5” means all constraints having xc[i]<=buc[i]-0.5 should be listed. An empty filter means that no filter is applied.
11 MSK_SPAR_READ_MPS_BOU_NAME
  Name of the BOUNDS vector used. An empty name means that the first BOUNDS vector is used.
20 MSK_SPAR_SOL_FILTER_XX_UPR
  A filter used to determine which variables should be listed in the solution file. A value of “0.5” means that all constraints having xx[j]<0.5 should be printed, whereas “-0.5” means all constraints having xx[j]<=bux[j]-0.5 should be listed. An empty filter means no filter is applied.
23 MSK_SPAR_STAT_NAME
  Name used when writing the statistics file.
9 MSK_SPAR_PARAM_READ_FILE_NAME
  Modifications to the parameter database is read from this file.
7 MSK_SPAR_ITR_SOL_FILE_NAME
  Name of the itr solution file.
15 MSK_SPAR_SENSITIVITY_FILE_NAME
  Not applicable.
2 MSK_SPAR_DEBUG_FILE_NAME
  MOSEK debug file.
22 MSK_SPAR_STAT_KEY
  Key used when writing the summary file.
16 MSK_SPAR_SENSITIVITY_RES_FILE_NAME
  Not applicable.
19 MSK_SPAR_SOL_FILTER_XX_LOW
  A filter used to determine which variables should be listed in the solution file. A value of “0.5” means that all constraints having xx[j]>=0.5 should be listed, whereas “+0.5” means that all constraints having xx[j]>=blx[j]+0.5 should be listed. An empty filter means no filter is applied.

I.55. Status keys

2 MSK_SK_SUPBAS
  The constraint or variable is super basic.
1 MSK_SK_BAS
  The constraint or variable is in the basis.
5 MSK_SK_FIX
  The constraint or variable is fixed.
3 MSK_SK_LOW
  The constraint or variable is at its lower bound.
6 MSK_SK_INF
  The constraint or variable is infeasible in the bounds.
0 MSK_SK_UNK
  The status for the constraint or variable is unknown.
4 MSK_SK_UPR
  The constraint or variable is at its upper bound.

I.56. Starting point types

1 MSK_STARTING_POINT_GUESS
  The optimizer guesses a starting point.
3 MSK_STARTING_POINT_SATISFY_BOUNDS
  The starting point is choosen to satisfy all the simple bounds on nonlinear variables. If this starting point is employed, then more care than usual should employed when choosing the bounds on the nonlinear variables. In particular very tight bounds should be avoided.
2 MSK_STARTING_POINT_CONSTANT
  The optimizer constructs a starting point by assigning a constant value to all primal and dual variables. This starting point is normally robust.
0 MSK_STARTING_POINT_FREE
  The starting point is chosen automatically.

I.57. Stream types

1 MSK_STREAM_MSG
  Message stream. Log information relating to performance and progress of the optimization is written to this stream.
3 MSK_STREAM_WRN
  Warning stream. Warning messages are written to this stream.
0 MSK_STREAM_LOG
  Log stream. Contains the aggregated contents of all other streams. This means that a message written to any other stream will also be written to this stream.
2 MSK_STREAM_ERR
  Error stream. Error messages are written to this stream.

I.58. Integer values

1024 MSK_MAX_STR_LEN
  Maximum string length allowed in MOSEK.
20 MSK_LICENSE_BUFFER_LENGTH
  The length of a license key buffer.

I.59. Variable types

1 MSK_VAR_TYPE_INT
  Is an integer variable.
0 MSK_VAR_TYPE_CONT
  Is a continuous variable.

I.60. XML writer output mode

1 MSK_WRITE_XML_MODE_COL
  Write in column order.
0 MSK_WRITE_XML_MODE_ROW
  Write in row order.
Wed Feb 29 16:20:56 2012