Value | Name |
Description | |
0 | MSK_ACC_VAR |
Access variables or equivalently columns | |
1 | MSK_ACC_CON |
Access constraints or equivalently rows |
Value | Name |
Description | |
11 | MSK_CALLBACK_BEGIN_PRESOLVE |
The call-back function is called from within the presolve is started. | |
62 | MSK_CALLBACK_UPDATE_PRESOLVE |
The call-back function is called from within the presolve procedure, | |
49 | MSK_CALLBACK_IM_PRESOLVE |
The call-back function is called from within the presolve procedure at an intermediate stage. | |
31 | MSK_CALLBACK_END_PRESOLVE |
The call-back function is called when the presolve is completed. | |
8 | MSK_CALLBACK_BEGIN_INTPNT |
The call-back function is called when the interior-point optimizer is started. | |
54 | MSK_CALLBACK_INTPNT |
The call-back function is called from within the interior-point optimizer after the information database has been updated. | |
43 | 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. | |
28 | MSK_CALLBACK_END_INTPNT |
The call-back function is called when interior-point optimizer is terminated. | |
2 | MSK_CALLBACK_BEGIN_CONIC |
The call-back function is called when the conic optimizer is started. | |
18 | MSK_CALLBACK_CONIC |
The call-back function is called from within the conic optimizer after the information database has been updated. | |
39 | 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. | |
22 | MSK_CALLBACK_END_CONIC |
The call-back function is called when conic optimizer is terminated. | |
57 | MSK_CALLBACK_PRIMAL_SIMPLEX |
The call-back function is called from within the primal simplex optimizer. | |
19 | MSK_CALLBACK_DUAL_SIMPLEX |
The call-back function is called from within the dual simplex optimizer. | |
58 | MSK_CALLBACK_QCONE |
The call-back function is called from within the Qcone optimizer. | |
0 | MSK_CALLBACK_BEGIN_BI |
The call-back function is called from within the basis identification procedure has been started. | |
38 | MSK_CALLBACK_IM_BI |
The call-back function is called from within the basis identification procedure at an intermediate point. | |
20 | MSK_CALLBACK_END_BI |
The call-back function is called when the basis identification procedure has been terminated. | |
12 | MSK_CALLBACK_BEGIN_PRIMAL_BI |
The call-back function is called from within the basis identification procedure when the primal phase is started. | |
50 | 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. | |
63 | 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. | |
32 | MSK_CALLBACK_END_PRIMAL_BI |
The call-back function is called from within the basis identification procedure when the primal phase is terminated. | |
3 | MSK_CALLBACK_BEGIN_DUAL_BI |
The call-back function is called from within the basis identification procedure when the dual phase is started. | |
40 | 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. | |
59 | 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. | |
23 | MSK_CALLBACK_END_DUAL_BI |
The call-back function is called from within the basis identification procedure when the dual phase is terminated. | |
17 | 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. | |
53 | 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 is started. The frequency of the call back is controlled by MSK_IPAR_SIM_LOG_FREQ parameter. | |
65 | MSK_CALLBACK_UPDATE_SIMPLEX_BI |
The call-back function is called from within the basis identification procedure at an intermediate point in the simplex clean-up phase is started. The frequency of the call back is controlled by MSK_IPAR_SIM_LOG_FREQ parameter. | |
37 | 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. | |
9 | MSK_CALLBACK_BEGIN_MIO |
The call-back function is called when the mixed integer optimizer is started. | |
44 | MSK_CALLBACK_IM_MIO |
The call-back function is called at an intermediate point in the mixed integer optimizer is started. | |
55 | MSK_CALLBACK_NEW_INT_MIO |
The call-back function is called at after a new integer solution has been located by mixed integer optimizer. | |
29 | MSK_CALLBACK_END_MIO |
The call-back function is called when the mixed integer optimizer is started. | |
16 | MSK_CALLBACK_BEGIN_SIMPLEX |
The call-back function is called when the simplex optimizer is started. | |
6 | MSK_CALLBACK_BEGIN_DUAL_SIMPLEX |
The call-back function is called when the dual simplex optimizer started. | |
42 | MSK_CALLBACK_IM_DUAL_SIMPLEX |
The call-back function is called at an intermediate point in the dual simplex optimizer. | |
60 | MSK_CALLBACK_UPDATE_DUAL_SIMPLEX |
The call-back function is called in the dual simplex optimizer. | |
26 | MSK_CALLBACK_END_DUAL_SIMPLEX |
The call-back function is called when the dual simplex optimizer is terminated. | |
15 | MSK_CALLBACK_BEGIN_PRIMAL_SIMPLEX |
The call-back function is called when the primal simplex optimizer is started. | |
52 | MSK_CALLBACK_IM_PRIMAL_SIMPLEX |
The call-back function is called at an intermediate point in the primal simplex optimizer. | |
64 | MSK_CALLBACK_UPDATE_PRIMAL_SIMPLEX |
The call-back function is called in the primal simplex optimizer. | |
35 | MSK_CALLBACK_END_PRIMAL_SIMPLEX |
The call-back function is called when the primal simplex optimizer is terminated. | |
36 | MSK_CALLBACK_END_SIMPLEX |
The call-back function is called when the simplex optimizer is terminated. | |
10 | MSK_CALLBACK_BEGIN_NONCONVEX |
The call-back function is called when the nonconvex optimizer is started. | |
56 | MSK_CALLBACK_NONCOVEX |
The call-back function is called from within the nonconvex optimizer after the information database has been updated. | |
61 | 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. | |
48 | 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. | |
30 | MSK_CALLBACK_END_NONCONVEX |
The call-back function is called when nonconvex optimizer is terminated. | |
7 | MSK_CALLBACK_BEGIN_INFEAS_ANA |
The call-back function is called when the infeasibility analyzer is started. | |
27 | MSK_CALLBACK_END_INFEAS_ANA |
The call-back function is called when the infeasibility analyzer is terminated. | |
51 | MSK_CALLBACK_IM_PRIMAL_SENSIVITY |
The call-back function is called at an intermediate stage of the primal sensitivity analysis. | |
41 | MSK_CALLBACK_IM_DUAL_SENSIVITY |
The call-back function is called at an intermediate stage of the dual sensitivity analysis. | |
46 | 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. | |
47 | 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. | |
45 | 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. | |
14 | MSK_CALLBACK_BEGIN_PRIMAL_SETUP_BI |
34 | MSK_CALLBACK_END_PRIMAL_SETUP_BI |
The call-back function is called when the primal BI phase is terminated. | |
5 | MSK_CALLBACK_BEGIN_DUAL_SETUP_BI |
The call-back function is called when the dual BI phase is started. | |
25 | MSK_CALLBACK_END_DUAL_SETUP_BI |
The call-back function is called when the dual BI phase is terminated. | |
1 | MSK_CALLBACK_BEGIN_CONCURRENT |
The call-back function is called when the concurrent optimizer is started. | |
21 | MSK_CALLBACK_END_CONCURRENT |
The call-back function is called when the concurrent optimizer is terminated. | |
13 | MSK_CALLBACK_BEGIN_PRIMAL_SENSITIVITY |
The call-back function is called when the primal sensitivity analyses is started. | |
33 | MSK_CALLBACK_END_PRIMAL_SENSITIVITY |
The call-back function is called when the primal sensitivity analyses is terminated. | |
4 | MSK_CALLBACK_BEGIN_DUAL_SENSITIVITY |
The call-back function is called when the primal sensitivity analyses is started. | |
24 | MSK_CALLBACK_END_DUAL_SENSITIVITY |
The call-back function is called when the primal sensitivity analyses is terminated. |
Value | Name |
Description | |
0 | MSK_CHECK_CONVEXITY_NONE |
No convexity check | |
1 | MSK_CHECK_CONVEXITY_SIMPLE |
Perform simple and fast convexity check |
Value | Name |
Description | |
0 | MSK_CT_QUAD |
The cone is a quadratic cone. | |
1 | MSK_CT_RQUAD |
The cone is a rotated quadratic cone. |
Value | Name |
Description | |
1 | MSK_DINF_BI_CPUTIME |
Time (in CPU seconds) spend within basis identification procedure since its invocation. | |
3 | MSK_DINF_BI_PRIMAL_CPUTIME |
Time (in CPU seconds) spend within primal phase of the basis identification procedure since its invocation. | |
2 | MSK_DINF_BI_DUAL_CPUTIME |
Time (in CPU seconds) spend within dual phase basis identification procedure since its invocation. | |
0 | MSK_DINF_BI_CLEAN_CPUTIME |
Time (in CPU seconds) spend within clean-up phase basis identification procedure since its invocation. | |
6 | MSK_DINF_INTPNT_CPUTIME |
Time (in CPU seconds) spend within the interior-point optimizer since its invocation. | |
14 | MSK_DINF_INTPNT_REALTIME |
Time (in wall-clock end within the interior-point optimizer since its invocation. | |
11 | MSK_DINF_INTPNT_ORDER_CPUTIME |
Order time (in CPU seconds). | |
13 | MSK_DINF_INTPNT_PRIMAL_OBJ |
Primal objective value reported by the interior-point or Qcone optimizer. | |
8 | MSK_DINF_INTPNT_DUAL_OBJ |
Dual objective value reported by the interior-point or Qcone optimizer. | |
12 | MSK_DINF_INTPNT_PRIMAL_FEAS |
Primal feasibility measure reported by the interior-point or 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_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.) | |
10 | MSK_DINF_INTPNT_KAP_DIV_TAU |
This measure should converge to zero if the problem has an primal-dual optimal solution. Whereas it should converge to infinity when the problem is (strictly) primal or dual infeasible. In the case the measure is converging towards a positive but bounded constant then the problem is usually ill-posed. | |
24 | MSK_DINF_SIM_CPUTIME |
Time (in CPU seconds) spend in the simplex optimizer since invoking it. | |
26 | MSK_DINF_SIM_OBJ |
Objective value reported by the simplex optimizer. | |
25 | MSK_DINF_SIM_FEAS |
Feasibility measure reported by the simplex optimizer. | |
15 | MSK_DINF_MIO_CPUTIME |
Time spend in the mixed integer optimizer. | |
17 | MSK_DINF_MIO_OBJ_INT |
The primal objective value corresponding to the best integer feasible solution located. Note at least one integer feasible solution must have located i.e. check MSK_IINF_MIO_NUM_INT_SOLUTIONS. | |
16 | MSK_DINF_MIO_OBJ_BOUND |
The best bound objective value corresponding to the best integer feasible solution located. Note at least one integer feasible solution must have located i.e. check MSK_IINF_MIO_NUM_INT_SOLUTIONS. | |
18 | MSK_DINF_OPTIMIZER_CPUTIME |
Total time (in CPU seconds) spend in the optimizer since it was invoked. | |
19 | MSK_DINF_OPTIMIZER_REALTIME |
Total time (in wall-clock seconds) spend in the optimizer since it was invoked. | |
20 | MSK_DINF_PRESOLVE_CPUTIME |
Total time (in CPU second) spend in the presolve since it was invoked. | |
21 | MSK_DINF_PRESOLVE_ELI_CPUTIME |
Total time (in CPU second) spend in the eliminator since the presolve was invoked. | |
22 | MSK_DINF_PRESOLVE_LINDEP_CPUTIME |
Total time (in CPU second) spend in the linear dependency checker since the presolve was invoked. | |
23 | MSK_DINF_RD_CPUTIME |
Time (in CPU seconds) spend reading the data file. | |
46 | MSK_DINF_SOL_ITR_PRIMAL_OBJ |
Primal objective value of interior point solution. Updated at the end of the optimization. | |
38 | MSK_DINF_SOL_ITR_DUAL_OBJ |
Dual objective value of interior point solution. Updated at the end of the optimization. | |
42 | MSK_DINF_SOL_ITR_MAX_PBI |
Maximal primal bound infeasibility in interior point solution. Updated at the end of the optimization. | |
45 | MSK_DINF_SOL_ITR_MAX_PINTI |
Maximal primal integer infeasibility in interior point solution. Updated at the end of the optimization. | |
43 | MSK_DINF_SOL_ITR_MAX_PCNI |
Maximal primal cone infeasibility in interior point solution. Updated at the end of the optimization. | |
44 | MSK_DINF_SOL_ITR_MAX_PEQI |
Maximal primal equality infeasibility in interior point solution. Updated at the end of the optimization. | |
39 | MSK_DINF_SOL_ITR_MAX_DBI |
Maximal dual bound infeasibility in interior point solution. Updated at the end of the optimization. | |
40 | MSK_DINF_SOL_ITR_MAX_DCNI |
Maximal dual cone infeasibility in interior point solution. Updated at the end of the optimization. | |
41 | MSK_DINF_SOL_ITR_MAX_DEQI |
Maximal dual equality infeasibility in interior point solution. Updated at the end of the optimization. | |
33 | MSK_DINF_SOL_BAS_PRIMAL_OBJ |
Primal objective value of the basis solution. Updated at the end of the optimization. | |
27 | MSK_DINF_SOL_BAS_DUAL_OBJ |
Dual objective value of the basis solution. Updated at the end of the optimization. | |
30 | MSK_DINF_SOL_BAS_MAX_PBI |
Maximal primal bound infeasibility in the basis solution. Updated at the end of the optimization. | |
32 | MSK_DINF_SOL_BAS_MAX_PINTI |
Maximal primal integer infeasibility in the basis solution. Updated at the end of the optimization. | |
31 | MSK_DINF_SOL_BAS_MAX_PEQI |
Maximal primal equality infeasibility in the basis solution. Updated at the end of the optimization. | |
28 | MSK_DINF_SOL_BAS_MAX_DBI |
Maximal dual bound infeasibility in the basis solution. Updated at the end of the optimization. | |
29 | MSK_DINF_SOL_BAS_MAX_DEQI |
Maximal dual equality infeasibility in the basis solution. Updated at the end of the optimization. | |
37 | MSK_DINF_SOL_INT_PRIMAL_OBJ |
Primal objective value of the integer solution. Updated at the end of the optimization. | |
34 | MSK_DINF_SOL_INT_MAX_PBI |
Maximal primal bound infeasibility in the integer solution. Updated at the end of the optimization. | |
36 | MSK_DINF_SOL_INT_MAX_PINTI |
Maximal primal integer infeasibility in the integer solution. Updated at the end of the optimization. | |
35 | MSK_DINF_SOL_INT_MAX_PEQI |
Maximal primal equality infeasibility in the basis solution. Updated at the end of the optimization. | |
9 | MSK_DINF_INTPNT_FACTOR_NUM_FLOPS |
An estimate of the number of flops used in factorization. | |
4 | MSK_DINF_CONCURRENT_CPUTIME |
Time (in CPU seconds) spend within the concurrent optimizer since its invocation. | |
5 | MSK_DINF_CONCURRENT_REALTIME |
Time (in wall-clock seconds) within the concurrent optimizer since its invocation. |
Value | Name |
Description | |
9 | MSK_DPAR_DATA_TOL_CJ_LARGE |
An element in ![]() |
|
10 | MSK_DPAR_DATA_TOL_C_HUGE |
An element in ![]() |
|
5 | MSK_DPAR_DATA_TOL_AIJ |
Absolute zero tolerance for elements in ![]() |
|
6 | MSK_DPAR_DATA_TOL_AIJ_LARGE |
An element in ![]() |
|
7 | MSK_DPAR_DATA_TOL_BOUND_INF |
Any bound which in absolute value is greater than this parameter is considered infinite. | |
8 | MSK_DPAR_DATA_TOL_BOUND_WRN |
If a bound value is larger than this value in absolute size, then a warning message is issued. | |
11 | MSK_DPAR_DATA_TOL_QIJ |
Absolute zero tolerance for elements in
![]() |
|
12 | 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. | |
51 | MSK_DPAR_OPTIMIZER_MAX_TIME |
Maximum amount of time the optimizer is allowed to spend on the optimization. A negative number means infinity. | |
36 | MSK_DPAR_LOWER_OBJ_CUT |
If a feasible solution having and objective value outside, the interval [MSK_DPAR_LOWER_OBJ_CUT, MSK_DPAR_UPPER_OBJ_CUT], then MOSEK is terminated. | |
57 | MSK_DPAR_UPPER_OBJ_CUT |
If a feasible solution having and objective value outside, the interval [MSK_DPAR_LOWER_OBJ_CUT, MSK_DPAR_UPPER_OBJ_CUT], then MOSEK is terminated. | |
58 | 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 ![]() |
|
37 | 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 ![]() |
|
34 | MSK_DPAR_INTPNT_TOL_REL_GAP |
Relative gap termination tolerance. | |
25 | MSK_DPAR_INTPNT_NL_TOL_REL_GAP |
Relative gap termination tolerance for nonlinear problems. | |
3 | MSK_DPAR_BI_LU_TOL_REL_PIV |
Relative pivot tolerance used in the LU factorization in the basis identification procedure. | |
35 | MSK_DPAR_INTPNT_TOL_REL_STEP |
Relative step size to the boundary for linear and quadratic optimization problems. | |
26 | MSK_DPAR_INTPNT_NL_TOL_REL_STEP |
Relative step size to the boundary for general nonlinear optimization problems. | |
20 | MSK_DPAR_INTPNT_NL_MERIT_BAL |
Controls if the complementarity and infeasibility is converging to zero at about equal rates. | |
31 | 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 might worthwhile to increase this parameter. | |
32 | MSK_DPAR_INTPNT_TOL_PFEAS |
Primal feasibility tolerance used for linear and quadratic optimization problems. | |
27 | MSK_DPAR_INTPNT_TOL_DFEAS |
Dual feasibility tolerance used for linear and quadratic optimization problems. | |
30 | MSK_DPAR_INTPNT_TOL_MU_RED |
Relative complementarity gap tolerance. | |
24 | MSK_DPAR_INTPNT_NL_TOL_PFEAS |
Primal feasibility tolerance used when a nonlinear model is solved. | |
21 | MSK_DPAR_INTPNT_NL_TOL_DFEAS |
Dual feasibility tolerance used when a nonlinear model is solved. | |
22 | MSK_DPAR_INTPNT_NL_TOL_MU_RED |
Relative complementarity gap tolerance. | |
23 | MSK_DPAR_INTPNT_NL_TOL_NEAR_REL |
If 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. | |
29 | 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. | |
19 | MSK_DPAR_INTPNT_CO_TOL_REL_GAP |
Relative gap termination tolerance used by the conic interior-point optimizer. | |
18 | MSK_DPAR_INTPNT_CO_TOL_PFEAS |
Primal feasibility tolerance used by the conic interior-point optimizer. | |
14 | MSK_DPAR_INTPNT_CO_TOL_DFEAS |
Dual feasibility tolerance used by the conic interior-point optimizer. | |
16 | MSK_DPAR_INTPNT_CO_TOL_MU_RED |
Relative complementarity gap tolerance feasibility tolerance used by the conic interior-point optimizer. | |
17 | 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. | |
15 | 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. | |
33 | MSK_DPAR_INTPNT_TOL_PSAFE |
Controls the initial primal starting point used by the interior-point optimizer. If the interior-point optimizer converge slowly and/or the constraint or variable bounds are very large, then it might be worthwhile to increase this value. | |
28 | MSK_DPAR_INTPNT_TOL_DSAFE |
Controls the initial primal starting point used by the interior-point optimizer. If the interior-point optimizer converge slowly. | |
39 | MSK_DPAR_MIO_MAX_TIME |
This parameter limits the maximum time spend by the mixed integer optimizer. A negative number means infinity. | |
38 | MSK_DPAR_MIO_HEURISTIC_TIME |
Maximum time allowed to be used in the heuristic search for an optimal integer solution. A negative values implies that the optimizer decides the amount of time to be spend in the heuristic. | |
40 | MSK_DPAR_MIO_MAX_TIME_APRX_OPT |
Number of seconds spend by the mixed integer optimizer before the MSK_DPAR_MIO_TOL_REL_RELAX_INT is applied. | |
46 | MSK_DPAR_MIO_TOL_REL_GAP |
Relative optimality tolerance employed by the mixed integer optimizer. | |
42 | MSK_DPAR_MIO_NEAR_TOL_REL_GAP |
The mixed integer optimizer is terminated when this tolerance is satisfied. | |
44 | MSK_DPAR_MIO_TOL_ABS_GAP |
Absolute optimality tolerance employed by the mixed integer optimizer. | |
41 | MSK_DPAR_MIO_NEAR_TOL_ABS_GAP |
Relaxed absolute optimality tolerance employed by the mixed integer optimizer. | |
47 | MSK_DPAR_MIO_TOL_REL_RELAX_INT |
Relative relaxation tolerance of the integer constraints. I.e.
![]() ![]() |
|
45 | MSK_DPAR_MIO_TOL_ABS_RELAX_INT |
Absolute relaxation tolerance of the integer constraints. I.e.
![]() |
|
43 | MSK_DPAR_MIO_REL_ADD_CUT_LIMITED |
Controls how many cuts the mixed integer optimizer is allowed to add to the problem.
Let ![]() ![]() ![]() |
|
48 | MSK_DPAR_MIO_TOL_X |
Absolute solution tolerance used in mixed-integer optimizer. | |
2 | MSK_DPAR_BASIS_TOL_X |
Maximum absolute primal bound violation allowed in an optimal basic solution. | |
1 | MSK_DPAR_BASIS_TOL_S |
Maximum absolute dual bound violation in an optimal basic solution. | |
0 | MSK_DPAR_BASIS_REL_TOL_S |
Maximum relative dual bound violation allowed in an optimal basic solution. | |
55 | MSK_DPAR_PRESOLVE_TOL_X |
54 | MSK_DPAR_PRESOLVE_TOL_S |
52 | MSK_DPAR_PRESOLVE_TOL_AIJ |
Absolute zero tolerance employed for ![]() |
|
53 | MSK_DPAR_PRESOLVE_TOL_LIN_DEP |
Controls when a constraint is determined to be linearly dependent. | |
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. |
|
49 | MSK_DPAR_NONCONVEX_TOL_FEAS |
Feasibility tolerance used by the nonconvex optimizer. | |
50 | MSK_DPAR_NONCONVEX_TOL_OPT |
Optimality tolerance used by the nonconvex optimizer. | |
13 | MSK_DPAR_FEASREPAIR_TOL |
Tolerance for constraint enforcing upper bound on sum of weighted violations. | |
56 | MSK_DPAR_SIMPLEX_ABS_TOL_PIV |
Absolute pivot tolerance employed by the simplex optimizers. |
Value | Name |
Description | |
0 | MSK_FEASREPAIR_OPTIMIZE_NONE |
1 | MSK_FEASREPAIR_OPTIMIZE_PENALTY |
2 | MSK_FEASREPAIR_OPTIMIZE_COMBINED |
Value | Name |
Description | |
0 | MSK_INF_DOU_TYPE |
Is a double information type. | |
1 | MSK_INF_INT_TYPE |
Is an integer. |
Value | Name | ||||||||||||||||||||||
Description | |||||||||||||||||||||||
28 | MSK_IPAR_INTPNT_NUM_THREADS | ||||||||||||||||||||||
Controls the number of threads employed by the interior-point optimizer. | |||||||||||||||||||||||
8 | 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. | |||||||||||||||||||||||
9 | 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. | |||||||||||||||||||||||
17 | MSK_IPAR_CPU_TYPE | ||||||||||||||||||||||
Specifies the CPU type. | |||||||||||||||||||||||
11 | MSK_IPAR_CHECK_CTRL_C | ||||||||||||||||||||||
Specifies whether MOSEK should check
whether <ctrl>+<c> has been pressed.
In the case it has, then control is returned
to the user program.
In the case a user defined ctrl-c function is defined then that is used to check for ctrl-c. Otherwise the system procedure signal is used. |
|||||||||||||||||||||||
62 | MSK_IPAR_MAX_NUM_WARNINGS | ||||||||||||||||||||||
Waning level. A higher value implies more warnings. | |||||||||||||||||||||||
142 | MSK_IPAR_WARNING_LEVEL | ||||||||||||||||||||||
Warning level. | |||||||||||||||||||||||
90 | MSK_IPAR_OPTIMIZER | ||||||||||||||||||||||
Controls which optimizer is used to optimize the task. | |||||||||||||||||||||||
80 | MSK_IPAR_OBJECTIVE_SENSE | ||||||||||||||||||||||
Controls whether the problem is minimized or maximized. | |||||||||||||||||||||||
7 | MSK_IPAR_BI_MAX_ITERATIONS | ||||||||||||||||||||||
Controls the maximum number of simplex iterations allowed to optimize a basis after the basis identification. | |||||||||||||||||||||||
42 | MSK_IPAR_LOG_BI | ||||||||||||||||||||||
Controls amount of output printed by the basis identification procedure. | |||||||||||||||||||||||
6 | MSK_IPAR_BI_LOG_FREQ | ||||||||||||||||||||||
Controls how frequent the optimizer outputs information about the basis identification and how frequent the user defined call-back function is called. | |||||||||||||||||||||||
5 | MSK_IPAR_BI_CLEAN_OPTIMIZER | ||||||||||||||||||||||
Controls which simplex optimizer that is used in the clean up phase. | |||||||||||||||||||||||
34 | MSK_IPAR_INTPNT_STARTING_POINT | ||||||||||||||||||||||
Starting used by the interior-point optimizer. | |||||||||||||||||||||||
26 | MSK_IPAR_INTPNT_DIFF_STEP | ||||||||||||||||||||||
Controls whether different step sizes are allowed in the primal and dual space. | |||||||||||||||||||||||
32 | MSK_IPAR_INTPNT_SCALING | ||||||||||||||||||||||
Controls how the problem is scaled before the interior-point optimizer is used. | |||||||||||||||||||||||
33 | MSK_IPAR_INTPNT_SOLVE_FORM | ||||||||||||||||||||||
Controls whether the primal or the dual problem is solved. | |||||||||||||||||||||||
49 | MSK_IPAR_LOG_INTPNT | ||||||||||||||||||||||
Controls amount of output printed by the interior-point optimizer. | |||||||||||||||||||||||
27 | MSK_IPAR_INTPNT_MAX_ITERATIONS | ||||||||||||||||||||||
Controls the maximum number of iterations allowed in the interior-point optimizer. | |||||||||||||||||||||||
29 | MSK_IPAR_INTPNT_OFF_COL_TRH | ||||||||||||||||||||||
Controls how many offending there are located in the Jacobian the constraint matrix. 0 means no offending columns will be detected. 1 means many offending columns will be detected. In general by increasing the number fewer offending columns will be detected. | |||||||||||||||||||||||
30 | MSK_IPAR_INTPNT_ORDER_METHOD | ||||||||||||||||||||||
Controls the ordering strategy used by the interior-point optimizer when factorizing the Newton equation system. | |||||||||||||||||||||||
25 | MSK_IPAR_INTPNT_BASIS | ||||||||||||||||||||||
Controls whether the interior-point optimizer also computes an optimal basis. | |||||||||||||||||||||||
97 | MSK_IPAR_PRESOLVE_USE | ||||||||||||||||||||||
Controls whether presolve is performed. | |||||||||||||||||||||||
55 | MSK_IPAR_LOG_PRESOLVE | ||||||||||||||||||||||
Controls amount of output printed by the presolve procedure. | |||||||||||||||||||||||
95 | MSK_IPAR_PRESOLVE_LINDEP_USE | ||||||||||||||||||||||
Controls whether the linear constraints is checked for linear dependencies. | |||||||||||||||||||||||
93 | MSK_IPAR_PRESOLVE_ELIMINATOR_USE | ||||||||||||||||||||||
Controls whether free or implied free variables are eliminator from the problem. | |||||||||||||||||||||||
92 | MSK_IPAR_PRESOLVE_ELIMINATOR_TYPE | ||||||||||||||||||||||
Controls the type of eliminator used. | |||||||||||||||||||||||
94 | MSK_IPAR_PRESOLVE_ELIM_FILL | ||||||||||||||||||||||
Controls the maximum amount of fill-in that can be created during the eliminations phase of the presolve. This parameter times (numcon+numvar) denotes the amount of fill in. | |||||||||||||||||||||||
131 | MSK_IPAR_SIM_PRIMAL_CRASH | ||||||||||||||||||||||
Controls whether crashing is performed in the primal simplex optimizer.
In general if a basis consists of more that (100-this parameter value)% fixed variables, then a crash will be performed. |
|||||||||||||||||||||||
58 | MSK_IPAR_LOG_SIM | ||||||||||||||||||||||
Controls amount of output printed by the simplex optimizer. | |||||||||||||||||||||||
128 | MSK_IPAR_SIM_LOG_FREQ | ||||||||||||||||||||||
Controls how frequent the simplex optimizer outputs information about the optimization and how frequent the user defined call-back function is called. | |||||||||||||||||||||||
132 | MSK_IPAR_SIM_PRIMAL_SELECTION | ||||||||||||||||||||||
Controls the choice of the incoming variable known as the selection strategy in the primal simplex optimizer. | |||||||||||||||||||||||
126 | MSK_IPAR_SIM_DUAL_SELECTION | ||||||||||||||||||||||
Controls the choice of the incoming variable known as the selection strategy in the dual simplex optimizer. | |||||||||||||||||||||||
129 | MSK_IPAR_SIM_MAX_ITERATIONS | ||||||||||||||||||||||
Maximum number of iterations that can used by a simplex optimizer. | |||||||||||||||||||||||
133 | MSK_IPAR_SIM_REFACTOR_FREQ | ||||||||||||||||||||||
Controls how frequent the basis is refactorized. The value 0 means that the optimizer determines when the best point of refactorization is. | |||||||||||||||||||||||
71 | MSK_IPAR_MIO_MODE | ||||||||||||||||||||||
Controls whether the optimizer includes the integer restrictions when solving a (mixed) integer optimization problem. | |||||||||||||||||||||||
50 | MSK_IPAR_LOG_MIO | ||||||||||||||||||||||
Controls the print level for the mixed integer optimizer | |||||||||||||||||||||||
76 | MSK_IPAR_MIO_PRINT_FREQ | ||||||||||||||||||||||
Controls how frequent the mixed integer optimizer prints the log line. It will print line every time MSK_IPAR_MIO_PRINT_FREQ relaxations have been solved. | |||||||||||||||||||||||
70 | MSK_IPAR_MIO_MAX_NUM_RELAXS | ||||||||||||||||||||||
Maximum number relaxations allowed during the branch and bound search. A negative value means infinite. | |||||||||||||||||||||||
69 | MSK_IPAR_MIO_MAX_NUM_BRANCHES | ||||||||||||||||||||||
Maximum number branches allowed during the branch and bound search. A negative value means infinite. | |||||||||||||||||||||||
73 | MSK_IPAR_MIO_NODE_SELECTION | ||||||||||||||||||||||
Controls the node selection strategy employed by the mixed integer optimizer. | |||||||||||||||||||||||
66 | MSK_IPAR_MIO_CUT_LEVEL | ||||||||||||||||||||||
Controls the cut level employed by the mixed integer optimizer.
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.
|
|||||||||||||||||||||||
67 | MSK_IPAR_MIO_HEURISTIC_LEVEL | ||||||||||||||||||||||
Controls the heuristic employed by the mixed integer optimizer to locate an integer feasible solution. A value of zero means no heuristic us used. A large value than 0 means a gradually more sophisticated heuristic is used which is computationally more expensive. A negative value implies that the optimizer chooses the heuristic to be used. | |||||||||||||||||||||||
78 | MSK_IPAR_MIO_STRONG_BRANCH | ||||||||||||||||||||||
The value specifies the depth from the root in which strong branching is used. A negative value means the optimizer chooses a default value automatically. | |||||||||||||||||||||||
63 | MSK_IPAR_MIO_BRANCH_DIR | ||||||||||||||||||||||
Controls whether the mixed integer optimizer is branching up or down by default. | |||||||||||||||||||||||
77 | MSK_IPAR_MIO_ROOT_OPTIMIZER | ||||||||||||||||||||||
Controls which optimizer that is employed at the root node in the mixed integer optimizer. | |||||||||||||||||||||||
72 | MSK_IPAR_MIO_NODE_OPTIMIZER | ||||||||||||||||||||||
Controls which optimizer that is employed non root nodes in the mixed integer optimizer. | |||||||||||||||||||||||
68 | 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. | |||||||||||||||||||||||
65 | MSK_IPAR_MIO_CONT_SOL | ||||||||||||||||||||||
Controls which problem the interior and basis solutions are solutions too when the problem is optimized using the mixed integer optimizer. | |||||||||||||||||||||||
1 | MSK_IPAR_ALLOC_ADD_CON | ||||||||||||||||||||||
Additional number of constraints that is made room when numcon exceeds maxnumcon when adding constraints. | |||||||||||||||||||||||
4 | MSK_IPAR_ALLOC_ADD_VAR | ||||||||||||||||||||||
Additional number of variables that is made room when numvar exceeds maxnumvar when adding constraints. | |||||||||||||||||||||||
0 | MSK_IPAR_ALLOC_ADD_ANZ | ||||||||||||||||||||||
This parameter is no longer used. | |||||||||||||||||||||||
3 | MSK_IPAR_ALLOC_ADD_QNZ | ||||||||||||||||||||||
Additional number of ![]() ![]() |
|||||||||||||||||||||||
2 | MSK_IPAR_ALLOC_ADD_CONE | ||||||||||||||||||||||
Additional number of cone constraints that are made room when the number of cone constraints are increased. | |||||||||||||||||||||||
107 | MSK_IPAR_READ_DATA_FORMAT | ||||||||||||||||||||||
Format of the data file to be read. | |||||||||||||||||||||||
106 | MSK_IPAR_READ_DATA_COMPRESSED | ||||||||||||||||||||||
If the this option is turned on, then it is assumed the data file is compressed. | |||||||||||||||||||||||
108 | MSK_IPAR_READ_KEEP_FREE_CON | ||||||||||||||||||||||
Controls whether the free constraints are included in the problem. | |||||||||||||||||||||||
119 | MSK_IPAR_READ_Q_MODE | ||||||||||||||||||||||
Controls how the Q matrices are read from the MPS file. | |||||||||||||||||||||||
112 | MSK_IPAR_READ_MPS_FORMAT | ||||||||||||||||||||||
Controls how strict the MPS file reader is regarding the MPS format. | |||||||||||||||||||||||
117 | MSK_IPAR_READ_MPS_WIDTH | ||||||||||||||||||||||
Controls the maximal number of chars allowed in one line of the MPS file. | |||||||||||||||||||||||
116 | MSK_IPAR_READ_MPS_RELAX | ||||||||||||||||||||||
MOSEK cannot solve integer programming problems, but only the continuous relaxation. If this option is turned on, then the relaxation will be read. | |||||||||||||||||||||||
115 | MSK_IPAR_READ_MPS_QUOTED_NAMES | ||||||||||||||||||||||
If a name is in quotes, when reading an MPS file, then the quotes will be removed. | |||||||||||||||||||||||
114 | MSK_IPAR_READ_MPS_OBJSENSE | ||||||||||||||||||||||
If turned on, then the MPS reader uses the objective sense section. Otherwise it ignores it. | |||||||||||||||||||||||
113 | MSK_IPAR_READ_MPS_KEEP_INT | ||||||||||||||||||||||
Controls whether MOSEK should keep the integer restrictions on the variables while reading the MPS file. | |||||||||||||||||||||||
104 | MSK_IPAR_READ_CON | ||||||||||||||||||||||
Expected maximum number of constraints to be read. The option is only used by fast MPS and lp file readers. | |||||||||||||||||||||||
121 | MSK_IPAR_READ_VAR | ||||||||||||||||||||||
Expected maximum number of variable to be read. The option is only used by fast MPS and lp file readers. | |||||||||||||||||||||||
103 | MSK_IPAR_READ_ANZ | ||||||||||||||||||||||
Expected maximum number of ![]() |
|||||||||||||||||||||||
118 | MSK_IPAR_READ_QNZ | ||||||||||||||||||||||
Expected maximum number of ![]() |
|||||||||||||||||||||||
105 | MSK_IPAR_READ_CONE | ||||||||||||||||||||||
Expected maximum number of conic constraints to be read. The option is only used by fast MPS and lp file readers. | |||||||||||||||||||||||
99 | MSK_IPAR_READ_ADD_CON | ||||||||||||||||||||||
Additional number of constraints that is made room for in the problem. | |||||||||||||||||||||||
102 | MSK_IPAR_READ_ADD_VAR | ||||||||||||||||||||||
Additional number of variables that is made room for in the problem. | |||||||||||||||||||||||
98 | MSK_IPAR_READ_ADD_ANZ | ||||||||||||||||||||||
Additional number of non-zeros in ![]() |
|||||||||||||||||||||||
101 | MSK_IPAR_READ_ADD_QNZ | ||||||||||||||||||||||
Additional number of non-zeros in the ![]() |
|||||||||||||||||||||||
100 | MSK_IPAR_READ_ADD_CONE | ||||||||||||||||||||||
Additional number of constraints that is made room for in the problem. | |||||||||||||||||||||||
111 | MSK_IPAR_READ_LP_QUOTED_NAMES | ||||||||||||||||||||||
If a name is in quotes, when reading an LP file, then the quotes will be removed. | |||||||||||||||||||||||
110 | MSK_IPAR_READ_LP_LINE_WIDTH | ||||||||||||||||||||||
Maximum width of line in a LP file read by MOSEK. | |||||||||||||||||||||||
147 | MSK_IPAR_WRITE_DATA_FORMAT | ||||||||||||||||||||||
Controls which format the data file has when a task is written to a file using MSK_writedata. |
|||||||||||||||||||||||
148 | MSK_IPAR_WRITE_DATA_PARAM | ||||||||||||||||||||||
If this option is turned, then the parameter settings is written to the data file as parameters. | |||||||||||||||||||||||
149 | MSK_IPAR_WRITE_FREE_CON | ||||||||||||||||||||||
Controls whether the free constraints is written to the data file. | |||||||||||||||||||||||
150 | MSK_IPAR_WRITE_GENERIC_NAMES | ||||||||||||||||||||||
Controls whether generic names or the user defined names are used in the data file. | |||||||||||||||||||||||
151 | MSK_IPAR_WRITE_GENERIC_NAMES_IO | ||||||||||||||||||||||
Index origin used in generic names. | |||||||||||||||||||||||
146 | MSK_IPAR_WRITE_DATA_COMPRESSED | ||||||||||||||||||||||
Controls whether the data file is compressed while it is written. 0 means no compression and higher values means more compression. | |||||||||||||||||||||||
161 | MSK_IPAR_WRITE_MPS_QUOTED_NAMES | ||||||||||||||||||||||
If a name contain spaces (blanks) when writing an MPS file, then the quotes will be removed. | |||||||||||||||||||||||
162 | MSK_IPAR_WRITE_MPS_STRICT | ||||||||||||||||||||||
Controls whether the written MPS file satisfies the MPS format strictly or not. | |||||||||||||||||||||||
160 | MSK_IPAR_WRITE_MPS_OBJSENSE | ||||||||||||||||||||||
If turned on, the object sense section is not written to the MPS file. | |||||||||||||||||||||||
159 | MSK_IPAR_WRITE_MPS_INT | ||||||||||||||||||||||
Controls whether marker records are written to the MPS file to indicate whether variables are integer restricted. | |||||||||||||||||||||||
157 | MSK_IPAR_WRITE_LP_STRICT_FORMAT | ||||||||||||||||||||||
Controls whether LP formated output files satisfies the LP format strictly. | |||||||||||||||||||||||
156 | MSK_IPAR_WRITE_LP_QUOTED_NAMES | ||||||||||||||||||||||
If this option is turned on, then MOSEK will quote invalid LP names when writing an LP file. | |||||||||||||||||||||||
155 | MSK_IPAR_WRITE_LP_LINE_WIDTH | ||||||||||||||||||||||
Maximum width of line in a LP file written by MOSEK. | |||||||||||||||||||||||
158 | 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. | |||||||||||||||||||||||
163 | MSK_IPAR_WRITE_PRECISION | ||||||||||||||||||||||
Controls the precision with which double numbers are printed in the data file. In general it is not worthwhile to use a value higher than 15. | |||||||||||||||||||||||
165 | MSK_IPAR_WRITE_SOL_HEAD | ||||||||||||||||||||||
Controls whether the header section is written to the solution file. | |||||||||||||||||||||||
164 | MSK_IPAR_WRITE_SOL_CONSTRAINTS | ||||||||||||||||||||||
Controls whether the constraint section is written to the solution file. | |||||||||||||||||||||||
166 | MSK_IPAR_WRITE_SOL_VARIABLES | ||||||||||||||||||||||
Controls whether the variables section is written to the solution file. | |||||||||||||||||||||||
144 | MSK_IPAR_WRITE_BAS_HEAD | ||||||||||||||||||||||
Controls whether the header section is written to the basis solution file. | |||||||||||||||||||||||
143 | MSK_IPAR_WRITE_BAS_CONSTRAINTS | ||||||||||||||||||||||
Controls whether the constraint section is written to the basis solution file. | |||||||||||||||||||||||
145 | MSK_IPAR_WRITE_BAS_VARIABLES | ||||||||||||||||||||||
Controls whether the variables section is written to the basis solution file. | |||||||||||||||||||||||
153 | MSK_IPAR_WRITE_INT_HEAD | ||||||||||||||||||||||
Controls whether the header section is written to the integer solution file. | |||||||||||||||||||||||
152 | MSK_IPAR_WRITE_INT_CONSTRAINTS | ||||||||||||||||||||||
Controls whether the constraint section is written to the integer solution file. | |||||||||||||||||||||||
154 | MSK_IPAR_WRITE_INT_VARIABLES | ||||||||||||||||||||||
Controls whether the variables section is written to the integer solution file. | |||||||||||||||||||||||
139 | 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 a it will strip off a leading and trailing quote. | |||||||||||||||||||||||
140 | 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. | |||||||||||||||||||||||
141 | MSK_IPAR_SOL_READ_WIDTH | ||||||||||||||||||||||
Controls the maximal acceptable width of line in the solution solutions when read by MOSEK. | |||||||||||||||||||||||
23 | MSK_IPAR_INFEAS_REPORT_AUTO | ||||||||||||||||||||||
Controls whether an infeasibility report is automatically produced after the optimization if the problem is primal or dual infeasible. | |||||||||||||||||||||||
24 | MSK_IPAR_INFEAS_REPORT_LEVEL | ||||||||||||||||||||||
Controls the amount info presented in an infeasibility report. Higher values implies more information. | |||||||||||||||||||||||
21 | MSK_IPAR_INFEAS_GENERIC_NAMES | ||||||||||||||||||||||
Controls whether generic names are used when an infeasible subproblem is created. | |||||||||||||||||||||||
48 | MSK_IPAR_LOG_INFEAS_ANA | ||||||||||||||||||||||
Controls amount of output printed by the infeasibility analyzer procedures. | |||||||||||||||||||||||
40 | MSK_IPAR_LICENSE_WAIT | ||||||||||||||||||||||
If all licenses are in use MOSEK returns with an error code. However, this parameter can used to turn on that MOSEK will wait for a license until becomes available i.e. MOSEK queue for a license. | |||||||||||||||||||||||
39 | MSK_IPAR_LICENSE_SUPPRESS_EXPIRE_WRNS | ||||||||||||||||||||||
Controls whether license features expire warnings are suppressed. | |||||||||||||||||||||||
38 | MSK_IPAR_LICENSE_PAUSE_TIME | ||||||||||||||||||||||
If MSK_IPAR_LICENSE_WAIT=MSK_ON and no license is available, then MOSEK sleeps a number of micro seconds between each check of whether a license as become free. | |||||||||||||||||||||||
37 | MSK_IPAR_LICENSE_DEBUG | ||||||||||||||||||||||
This option is used to turn on debugging of the incense manager. | |||||||||||||||||||||||
137 | 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. | |||||||||||||||||||||||
138 | 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. | |||||||||||||||||||||||
41 | MSK_IPAR_LOG | ||||||||||||||||||||||
If turned on, then the log lines are printed. | |||||||||||||||||||||||
46 | MSK_IPAR_LOG_FILE | ||||||||||||||||||||||
If turned on, then some log info is printed when a file is written or read. | |||||||||||||||||||||||
47 | MSK_IPAR_LOG_HEAD | ||||||||||||||||||||||
If turned on, then a header line is added to the log. | |||||||||||||||||||||||
52 | MSK_IPAR_LOG_OPTIMIZER | ||||||||||||||||||||||
If turned on, then optimizer lines are added to the log. | |||||||||||||||||||||||
44 | MSK_IPAR_LOG_FACTOR | ||||||||||||||||||||||
If turned on, then factor lines are added to the log. | |||||||||||||||||||||||
53 | MSK_IPAR_LOG_ORDER | ||||||||||||||||||||||
If turned on, then factor lines are added to the log. | |||||||||||||||||||||||
56 | 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. | |||||||||||||||||||||||
57 | 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. | |||||||||||||||||||||||
20 | MSK_IPAR_FLUSH_STREAM_FREQ | ||||||||||||||||||||||
Controls how frequent the message and log streams are flushed. A value of 0 means it is never flushed. Otherwise a larger value implies less frequent flushes. | |||||||||||||||||||||||
120 | 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. | |||||||||||||||||||||||
167 | MSK_IPAR_WRITE_TASK_INC_SOL | ||||||||||||||||||||||
Controls whether the solutions are also stored in the task file. | |||||||||||||||||||||||
54 | MSK_IPAR_LOG_PARAM | ||||||||||||||||||||||
Controls the amount of information printed out about parameter changes. | |||||||||||||||||||||||
91 | MSK_IPAR_PARAM_READ_CASE_NAME | ||||||||||||||||||||||
If turned on, then names in the parameter file are considered to be case sensitive. | |||||||||||||||||||||||
79 | MSK_IPAR_NONCONVEX_MAX_ITERATIONS | ||||||||||||||||||||||
Maximum number iterations that can be used by the nonconvex optimizer. | |||||||||||||||||||||||
136 | MSK_IPAR_SOLUTION_CALLBACK | ||||||||||||||||||||||
Indicates whether solution callbacks will be performed during the optimization. | |||||||||||||||||||||||
134 | MSK_IPAR_SIM_SCALING | ||||||||||||||||||||||
Controls how the problem is scaled before a simplex optimizer is used. | |||||||||||||||||||||||
130 | MSK_IPAR_SIM_MAX_NUM_SETBACKS | ||||||||||||||||||||||
Controls how many setbacks that are allowed within a simplex optimizer. A setback is an event where the optimizer moves in the wrong direction. This is impossible in theory but may happen due to numerical problems. | |||||||||||||||||||||||
127 | MSK_IPAR_SIM_HOTSTART | ||||||||||||||||||||||
Controls whether he simplex optimizer will do hotstart if possible. | |||||||||||||||||||||||
125 | MSK_IPAR_SIM_DUAL_CRASH | ||||||||||||||||||||||
Controls whether crashing is performed in the dual simplex optimizer.
In general if a basis consists of more that (100-this parameter value)% fixed variables, then a crash will be performed. |
|||||||||||||||||||||||
59 | MSK_IPAR_LOG_STORAGE | ||||||||||||||||||||||
When turned on MOSEK prints messages regarding the storage usage and allocation. | |||||||||||||||||||||||
22 | MSK_IPAR_INFEAS_PREFER_PRIMAL | ||||||||||||||||||||||
If both a primal and dual infeasibility certificate is supplied then only the primal is used when this option is turned on. | |||||||||||||||||||||||
61 | MSK_IPAR_MAXNUMANZ_DOUBLE_TRH | ||||||||||||||||||||||
Whenever MOSEK runs out of storage for the ![]() |
|||||||||||||||||||||||
109 | 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. | |||||||||||||||||||||||
81 | MSK_IPAR_OPF_MAX_TERMS_PER_LINE | ||||||||||||||||||||||
The maximum number of terms (linear and quadratic) per line when an OPF file is written. | |||||||||||||||||||||||
83 | MSK_IPAR_OPF_WRITE_HINTS | ||||||||||||||||||||||
Write a hint section with problem dimensions in the beginning of an OPF file. | |||||||||||||||||||||||
84 | MSK_IPAR_OPF_WRITE_PARAMETERS | ||||||||||||||||||||||
Write a parameter section in an OPF file. | |||||||||||||||||||||||
85 | MSK_IPAR_OPF_WRITE_PROBLEM | ||||||||||||||||||||||
Write objective, constraints, bounds etc. to an OPF file. | |||||||||||||||||||||||
82 | MSK_IPAR_OPF_WRITE_HEADER | ||||||||||||||||||||||
Write a text header with date and MOSEK version in an OPF file. | |||||||||||||||||||||||
86 | MSK_IPAR_OPF_WRITE_SOLUTIONS | ||||||||||||||||||||||
Enable inclusion of solutions in OPF files. | |||||||||||||||||||||||
87 | MSK_IPAR_OPF_WRITE_SOL_BAS | ||||||||||||||||||||||
If MSK_IPAR_OPF_WRITE_SOLUTIONS is MSK_ON and a basis solution is defined, include the basis solution in OPF files. | |||||||||||||||||||||||
88 | 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. | |||||||||||||||||||||||
89 | 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. | |||||||||||||||||||||||
19 | MSK_IPAR_FEASREPAIR_OPTIMIZE | ||||||||||||||||||||||
Controls which type of feasibility analysis is to be performed. | |||||||||||||||||||||||
75 | MSK_IPAR_MIO_PRESOLVE_USE | ||||||||||||||||||||||
Controls whether presolve is performed by the mixed integer optimizer. | |||||||||||||||||||||||
74 | MSK_IPAR_MIO_PRESOLVE_AGGREGATE | ||||||||||||||||||||||
Controls whether the presolve used by the mixed integer optimizer tries to aggregate the constraints. | |||||||||||||||||||||||
124 | MSK_IPAR_SENSITIVITY_TYPE | ||||||||||||||||||||||
Controls which type of sensitivity analysis is to be performed. | |||||||||||||||||||||||
64 | MSK_IPAR_MIO_CONSTRUCT_SOL | ||||||||||||||||||||||
If set to MSK_ON and all integer variables has been given a value for which a feasible MIP solution exists, then MOSEK generates an initial solution to the MIP by fixing all integer values and solving for the continues variables. | |||||||||||||||||||||||
15 | MSK_IPAR_CONCURRENT_PRIORITY_INTPNT | ||||||||||||||||||||||
Priority of the interior point algorithm when selecting solvers for concurrent optimization. | |||||||||||||||||||||||
16 | MSK_IPAR_CONCURRENT_PRIORITY_PRIMAL_SIMPLEX | ||||||||||||||||||||||
Priority of the primal simplex algorithm when selecting solvers for concurrent optimization. | |||||||||||||||||||||||
13 | MSK_IPAR_CONCURRENT_PRIORITY_DUAL_SIMPLEX | ||||||||||||||||||||||
Priority of the dual simplex algorithm when selecting solvers for concurrent optimization. | |||||||||||||||||||||||
14 | MSK_IPAR_CONCURRENT_PRIORITY_FREE_SIMPLEX | ||||||||||||||||||||||
Priority of free simplex optimizer when selecting solvers for concurrent optimization. | |||||||||||||||||||||||
12 | MSK_IPAR_CONCURRENT_NUM_OPTIMIZERS | ||||||||||||||||||||||
The maximum number of simultaneous optimizations that will be started by the concurrent optimizer. | |||||||||||||||||||||||
96 | MSK_IPAR_PRESOLVE_LINDEP_WORK_LIM | ||||||||||||||||||||||
Is used to limit the about work that can used to locate the linear dependencies.
In general the higher value this parameter is given the less work can be used.
However, a value of ![]() |
|||||||||||||||||||||||
122 | MSK_IPAR_SENSITIVITY_ALL | ||||||||||||||||||||||
If set to MSK_ON then MSK_sensitivityreport analyze all bounds and variables instead of reading a specification from file. |
|||||||||||||||||||||||
18 | MSK_IPAR_DATA_CHECK | ||||||||||||||||||||||
If this option is turned on, then extensive data checking is enabled. It will slow MOSEK down but on the other help locating bugs. | |||||||||||||||||||||||
43 | MSK_IPAR_LOG_CONCURRENT | ||||||||||||||||||||||
Controls amount of output printed by the concurrent optimizer. | |||||||||||||||||||||||
51 | MSK_IPAR_LOG_NONCONVEX | ||||||||||||||||||||||
Controls amount of output printed by the nonconvex optimizer. | |||||||||||||||||||||||
45 | MSK_IPAR_LOG_FEASREPAIR | ||||||||||||||||||||||
Controls amount of output printed when performing feasibility repair. | |||||||||||||||||||||||
35 | MSK_IPAR_LICENSE_CACHE_TIME | ||||||||||||||||||||||
Controls whether a license should be cached in the MOSEK environment for later reuse rather than checking
it into the license server. Checking out a license is a relative expensive task.
Therefore, if a large number of optimizations are performed within a small amount of time, then it is useful (read efficient)
to cache the license in the MOSEK environment for later use. That way a number of license check outs and check ins are avoided.
If a license has not been used significant amount of time, then MOSEK will automatically check in the license. |
|||||||||||||||||||||||
36 | MSK_IPAR_LICENSE_CHECK_TIME | ||||||||||||||||||||||
The parameter specifies the number seconds between all the active license are checked. | |||||||||||||||||||||||
31 | MSK_IPAR_INTPNT_REGULARIZATION_USE | ||||||||||||||||||||||
Controls whether regularization is allowed. | |||||||||||||||||||||||
135 | MSK_IPAR_SIM_SOLVE_FORM | ||||||||||||||||||||||
Controls whether the primal or the dual problem is solved by the simplex optimizers. | |||||||||||||||||||||||
60 | MSK_IPAR_LP_WRITE_IGNORE_INCOMPATIBLE_ITEMS | ||||||||||||||||||||||
Controls the result of writing a problem containing incompatible items to an LP file. | |||||||||||||||||||||||
10 | MSK_IPAR_CHECK_CONVEXITY | ||||||||||||||||||||||
Specify the level of convexity check on quadratic problems | |||||||||||||||||||||||
123 | MSK_IPAR_SENSITIVITY_OPTIMIZER | ||||||||||||||||||||||
Controls which optimizer is used for optimal partition sensitivity analysis. |
Value | Name |
Description | |
1000 | MSK_MSG_READING_FILE |
1001 | MSK_MSG_WRITING_FILE |
1100 | MSK_MSG_MPS_SELECTED |
Value | Name |
Description | |
0 | MSK_OBJECTIVE_SENSE_MIN |
The problem should be minimized. | |
1 | MSK_OBJECTIVE_SENSE_MAX |
The problem should be maximized. |
Value | Name |
Description | |
0 | MSK_PAR_INVALID_TYPE |
Not a valid parameter. | |
1 | MSK_PAR_DOU_TYPE |
Is a double parameter. | |
2 | MSK_PAR_INT_TYPE |
Is an integer parameter. | |
3 | MSK_PAR_STR_TYPE |
Is a string parameter. |
Value | Name |
Description | |
0 | MSK_PI_VAR |
Item is a variable. | |
1 | MSK_PI_CON |
Item is a constraint. | |
2 | MSK_PI_CONE |
Item is a cone. |
Value | Name |
Description | |
0 | MSK_RES_OK |
No error occurred. | |
50 | MSK_RES_WRN_OPEN_PARAM_FILE |
The parameter file could not be opened. | |
51 | MSK_RES_WRN_LARGE_BOUND |
A very large bound in absolute value has been specified. | |
52 | MSK_RES_WRN_LARGE_LO_BOUND |
A large but finite lower bound in absolute value has been specified. | |
53 | MSK_RES_WRN_LARGE_UP_BOUND |
A large but finite upper bound in absolute value has been specified. | |
57 | MSK_RES_WRN_LARGE_CJ |
A large value in absolute size is specified for one ![]() |
|
62 | MSK_RES_WRN_LARGE_AIJ |
A large value in absolute size is specified for one ![]() |
|
63 | MSK_RES_WRN_ZERO_AIJ |
One or more zero elements are specified in A. | |
65 | MSK_RES_WRN_NAME_MAX_LEN |
A name is longer than the buffer that is supposed to hold it. | |
66 | MSK_RES_WRN_SPAR_MAX_LEN |
A value for string parameter is longer than the buffer that is supposed to hold it. | |
70 | MSK_RES_WRN_MPS_SPLIT_RHS_VECTOR |
A RHS vector is split into several nonadjacent parts in a MPS file. | |
71 | MSK_RES_WRN_MPS_SPLIT_RAN_VECTOR |
A RANGE vector is split into several nonadjacent parts in a MPS file. | |
72 | MSK_RES_WRN_MPS_SPLIT_BOU_VECTOR |
A BOUNDS vector is split into several nonadjacent parts in a MPS file. | |
80 | MSK_RES_WRN_LP_OLD_QUAD_FORMAT |
Missing '/2' after quadratic expressions in bound or objective. | |
85 | MSK_RES_WRN_LP_DROP_VARIABLE |
Ignore a variable because the variable has not been previously defined. Usually this implies a variable has been deigned in the bound section but not in the objective or the constraints. | |
200 | MSK_RES_WRN_NZ_IN_UPR_TRI |
Nonzero elements is specified in the upper triangle of a matrix which is ignored by the code. | |
201 | MSK_RES_WRN_DROPPED_NZ_QOBJ |
One or more nonzero elements are dropped from the Q matrix in the objective. | |
250 | MSK_RES_WRN_IGNORE_INTEGER |
Ignored integer constraints. | |
251 | MSK_RES_WRN_NO_GLOBAL_OPTIMIZER |
No global optimizer is available. | |
270 | MSK_RES_WRN_MIO_INFEASIBLE_FINAL |
When the MOSEK mixed integer optimizer reoptimizes a mixed integer problem with all the integer variables fixed at their ``optimal value'' the then problem becomes infeasible. | |
280 | MSK_RES_WRN_FIXED_BOUND_VALUES |
A fixed constraint/variable has been specified using the bound keys but the numerical bounds are different. The variable is fixed at the lower bound. | |
300 | MSK_RES_WRN_SOL_FILTER |
Invalid solution filter is specified. | |
350 | MSK_RES_WRN_UNDEF_SOL_FILE_NAME |
Undefined name occurred in a solution. | |
400 | MSK_RES_WRN_TOO_FEW_BASIS_VARS |
An incomplete basis has been specified. Too few basis variables are specified. | |
405 | MSK_RES_WRN_TOO_MANY_BASIS_VARS |
A basis with too many variables has been specified. Too few basis variables are specified. | |
500 | MSK_RES_WRN_LICENSE_EXPIRE |
The license expires. | |
501 | MSK_RES_WRN_LICENSE_SERVER |
The license server is not responding. | |
502 | MSK_RES_WRN_EMPTY_NAME |
A variable or constraint name is empty. The output file may be invalid. | |
505 | MSK_RES_WRN_LICENSE_FEATURE_EXPIRE |
The license expires. | |
700 | MSK_RES_WRN_ZEROS_IN_SPARSE_DATA |
One or more almost zero elements are specified in sparse input data. | |
800 | MSK_RES_WRN_NONCOMPLETE_LINEAR_DEPENDENCY_CHECK |
The linear dependency check(s) never completed so the ![]() |
|
1000 | MSK_RES_ERR_LICENSE |
Invalid license. | |
1001 | MSK_RES_ERR_LICENSE_EXPIRED |
The license has expired. | |
1002 | MSK_RES_ERR_LICENSE_VERSION |
The license is valid for another version of MOSEK. | |
1005 | MSK_RES_ERR_SIZE_LICENSE |
The problem is bigger than the license. | |
1006 | MSK_RES_ERR_PROB_LICENSE |
The software is not licensed to solve the problem. | |
1007 | MSK_RES_ERR_FILE_LICENSE |
Invalid license. | |
1008 | MSK_RES_ERR_MISSING_LICENSE_FILE |
A license file is missing. | |
1009 | MSK_RES_ERR_PLATFORM_LICENSE |
MOSEK is not licensed to run this platform. | |
1010 | MSK_RES_ERR_SIZE_LICENSE_CON |
The problem has too many constraints to be solved with the available license. | |
1011 | MSK_RES_ERR_SIZE_LICENSE_VAR |
The problem has too many variables to be solved with the available license. | |
1012 | MSK_RES_ERR_SIZE_LICENSE_INTVAR |
The problem contains too many integer variables to be solved with the available license. | |
1013 | MSK_RES_ERR_OPTIMIZER_LICENSE |
The optimizer required is not licensed. | |
1014 | MSK_RES_ERR_FLEXLM |
The FLEXlm license manager reported an error. | |
1015 | MSK_RES_ERR_LICENSE_SERVER |
The license server is not responding. | |
1016 | MSK_RES_ERR_LICENSE_MAX |
Maximum number of licenses are reached. | |
1017 | MSK_RES_ERR_LICENSE_MOSEKLM_DAEMON |
The MOSEKLM license manager daemon is not up and running. | |
1018 | MSK_RES_ERR_LICENSE_FEATURE |
A feature is not available in the license file(s). This is mosek likely due to an incorrect setup of the license system. | |
1019 | MSK_RES_ERR_PLATFORM_NOT_LICENSED |
The required platform is not licensed. | |
1020 | MSK_RES_ERR_LICENSE_CANNOT_ALLOCATE |
The license system cannot allocate the memory it requires. | |
1021 | MSK_RES_ERR_LICENSE_CANNOT_CONNECT |
MOSEK cannot connect to the license server. Most likely the license server is not up and running. | |
1025 | MSK_RES_ERR_LICENSE_INVALID_HOSTID |
The hostid specified in the license file does not match the hostid of the computer. | |
1030 | MSK_RES_ERR_OPEN_DL |
A dynamic link library could not be opened. | |
1035 | MSK_RES_ERR_OLDER_DLL |
The dynamic link library is older than the specified version. | |
1036 | MSK_RES_ERR_NEWER_DLL |
The dynamic link library is newer than the specified version. | |
1040 | MSK_RES_ERR_LINK_FILE_DLL |
A file cannot be linked to a stream in the DLL version. | |
1045 | MSK_RES_ERR_THREAD_MUTEX_INIT |
Could not initialize a mutex. | |
1046 | MSK_RES_ERR_THREAD_MUTEX_LOCK |
Could not lock a mutex. | |
1047 | MSK_RES_ERR_THREAD_MUTEX_UNLOCK |
Could not unlock a mutex. | |
1048 | MSK_RES_ERR_THREAD_CREATE |
Could not create a thread. | |
1049 | MSK_RES_ERR_THREAD_COND_INIT |
Could not initialize a condition. | |
1050 | MSK_RES_ERR_UNKNOWN |
Unknown error. | |
1051 | MSK_RES_ERR_SPACE |
Out of space. | |
1052 | MSK_RES_ERR_FILE_OPEN |
Error while opening a file. | |
1053 | MSK_RES_ERR_FILE_READ |
File read error. | |
1054 | MSK_RES_ERR_FILE_WRITE |
File write error. | |
1055 | MSK_RES_ERR_DATA_FILE_EXT |
The data file format cannot be determined from the file name. | |
1056 | MSK_RES_ERR_INVALID_FILE_NAME |
An invalid file name has been specified. | |
1057 | MSK_RES_ERR_INVALID_SOL_FILE_NAME |
An invalid file name has been specified. | |
1058 | MSK_RES_ERR_INVALID_MBT_FILE |
A MOSEK binary task file is invalid. | |
1059 | MSK_RES_ERR_END_OF_FILE |
End of file reached. | |
1060 | MSK_RES_ERR_NULL_ENV |
env is a NULL pointer. | |
1061 | MSK_RES_ERR_NULL_TASK |
task is a NULL pointer. | |
1062 | MSK_RES_ERR_INVALID_STREAM |
An invalid stream is referenced. | |
1063 | MSK_RES_ERR_NO_INIT_ENV |
env is not initialized. | |
1064 | MSK_RES_ERR_INVALID_TASK |
A task is invalid pointer. | |
1065 | MSK_RES_ERR_NULL_POINTER |
An argument to a function is unexpectedly a NULL pointer. | |
1070 | MSK_RES_ERR_NULL_NAME |
An all blank name has been specified. | |
1071 | MSK_RES_ERR_DUP_NAME |
An error occurred while reading a MPS file.. | |
1080 | MSK_RES_ERR_SPACE_LEAKING |
MOSEK is leaking memory. This can either be due to an incorrect use of MOSEK or a bug. | |
1081 | MSK_RES_ERR_SPACE_NO_INFO |
No information is available about the space usage. | |
1100 | MSK_RES_ERR_MPS_FILE |
An error occurred while reading a MPS file. | |
1101 | MSK_RES_ERR_MPS_INV_FIELD |
A field in the MPS file is invalid. Probably it is too wide. | |
1102 | MSK_RES_ERR_MPS_INV_MARKER |
An invalid marker has been specified in the MPS file. | |
1103 | MSK_RES_ERR_MPS_NULL_CON_NAME |
An empty constraint name is used in a MPS file. | |
1104 | MSK_RES_ERR_MPS_NULL_VAR_NAME |
An empty variable name is used in a MPS file. | |
1105 | MSK_RES_ERR_MPS_UNDEF_CON_NAME |
An undefined constraint name occurred in a MPS file. | |
1106 | MSK_RES_ERR_MPS_UNDEF_VAR_NAME |
An undefined variable name occurred in a MPS file. | |
1107 | MSK_RES_ERR_MPS_INV_CON_KEY |
An invalid constraint key occurred in a MPS file. | |
1108 | MSK_RES_ERR_MPS_INV_BOUND_KEY |
An invalid bound key occurred in a MPS file. | |
1109 | MSK_RES_ERR_MPS_INV_SEC_NAME |
An invalid section name occurred in a MPS file. | |
1110 | MSK_RES_ERR_MPS_NO_OBJECTIVE |
No objective is defined in a MPS file. | |
1111 | MSK_RES_ERR_MPS_SPLITTED_VAR |
A variable is split in a MPS data file. | |
1112 | MSK_RES_ERR_MPS_MUL_CON_NAME |
A constraint name was specified multiple times in the ROWS section. | |
1113 | MSK_RES_ERR_MPS_MUL_QSEC |
Multiple QSECTIONs are specified for a constraint in the MPS data file. | |
1114 | MSK_RES_ERR_MPS_MUL_QOBJ |
The Q term in the objective is specified multiple times in the MPS data file. | |
1115 | MSK_RES_ERR_MPS_INV_SEC_ORDER |
The sections in the MPS data file is not in the correct order. | |
1116 | MSK_RES_ERR_MPS_MUL_CSEC |
Multiple CSECTIONs are given the same name. | |
1117 | MSK_RES_ERR_MPS_CONE_TYPE |
Invalid cone type specified in a CSECTION. | |
1118 | MSK_RES_ERR_MPS_CONE_OVERLAP |
A variable is specified to be member of several cones. | |
1119 | MSK_RES_ERR_MPS_CONE_REPEAT |
A variable is repeated within the CSECTION. | |
1122 | MSK_RES_ERR_MPS_INVALID_OBJSENSE |
An invalid objective sense is specified.. | |
1125 | MSK_RES_ERR_MPS_TAB_IN_FIELD2 |
A tab char occurred in field 2. | |
1126 | MSK_RES_ERR_MPS_TAB_IN_FIELD3 |
A tab char occurred in field 3. | |
1127 | MSK_RES_ERR_MPS_TAB_IN_FIELD5 |
A tab char occurred in field 5. | |
1150 | MSK_RES_ERR_LP_INCOMPATIBLE |
The problem cannot be written to an LP formatted file. | |
1152 | MSK_RES_ERR_LP_DUP_SLACK_NAME |
The name of the slack variable added to a ranged constraint already exists. | |
1153 | MSK_RES_ERR_WRITE_MPS_INVALID_NAME |
An invalid names is created while writing an MPS file. This will usually make the MPS file unreadable. | |
1154 | MSK_RES_ERR_LP_INVALID_VAR_NAME |
A variable name is invalid when used in an LP formatted file. | |
1155 | MSK_RES_ERR_LP_FREE_CONSTRAINT |
Free constraints cannot be written in LP file format. | |
1156 | MSK_RES_ERR_WRITE_OPF_INVALID_VAR_NAME |
Empty variable names cannot be written to OPF files. | |
1157 | MSK_RES_ERR_LP_FILE_FORMAT |
Syntax error in LP file. | |
1160 | MSK_RES_ERR_LP_FORMAT |
Syntax error in LP file. | |
1161 | MSK_RES_ERR_WRITE_LP_NON_UNIQUE_NAME |
An auto generated name is not unique. | |
1162 | MSK_RES_ERR_READ_LP_NONEXISTING_NAME |
A variable never occurred in objective or constraints. | |
1163 | MSK_RES_ERR_LP_WRITE_CONIC_PROBLEM |
The problem contains cones that cannot be written to a LP formatted file. | |
1164 | MSK_RES_ERR_LP_WRITE_GECO_PROBLEM |
The problem contains general convex terms that cannot be written to a LP formatted file. | |
1165 | MSK_RES_ERR_NAME_MAX_LEN |
A name is longer than the buffer that is supposed to hold it. | |
1168 | MSK_RES_ERR_OPF_FORMAT |
Syntax error in OPF file | |
1170 | MSK_RES_ERR_INVALID_NAME_IN_SOL_FILE |
An invalid name occurred in a solution file. | |
1197 | MSK_RES_ERR_ARGUMENT_LENNEQ |
Wrong length of arguments. | |
1198 | MSK_RES_ERR_ARGUMENT_TYPE |
Wrong argument type. | |
1199 | MSK_RES_ERR_NR_ARGUMENTS |
Nr. of function arguments are wrong. | |
1200 | MSK_RES_ERR_IN_ARGUMENT |
A function argument is incorrect. | |
1201 | MSK_RES_ERR_ARGUMENT_DIMENSION |
A function argument is of incorrect dimension. | |
1203 | MSK_RES_ERR_INDEX_IS_TOO_SMALL |
An index in an argument is too small. | |
1204 | MSK_RES_ERR_INDEX_IS_TOO_LARGE |
An index in an argument is too large. | |
1205 | MSK_RES_ERR_PARAM_NAME |
The parameter name is not correct. | |
1206 | MSK_RES_ERR_PARAM_NAME_DOU |
The parameter name is not correct for a double parameter. | |
1207 | MSK_RES_ERR_PARAM_NAME_INT |
The parameter name is not correct for a integer parameter. | |
1208 | MSK_RES_ERR_PARAM_NAME_STR |
The parameter name is not correct for a string parameter. | |
1210 | MSK_RES_ERR_PARAM_INDEX |
Parameter index is out of range. | |
1215 | MSK_RES_ERR_PARAM_IS_TOO_LARGE |
The parameter value is too large. | |
1216 | MSK_RES_ERR_PARAM_IS_TOO_SMALL |
The parameter value is too small. | |
1217 | MSK_RES_ERR_PARAM_VALUE_STR |
The parameter value string is incorrect. | |
1218 | MSK_RES_ERR_PARAM_TYPE |
The parameter type is invalid. | |
1219 | MSK_RES_ERR_INF_DOU_INDEX |
A double information index is out of range for the specified type. | |
1220 | MSK_RES_ERR_INF_INT_INDEX |
An integer information index is out of range for the specified type. | |
1221 | MSK_RES_ERR_INDEX_ARR_IS_TOO_SMALL |
An index in an array argument is too small. | |
1222 | MSK_RES_ERR_INDEX_ARR_IS_TOO_LARGE |
An index in an array argument is too large. | |
1230 | MSK_RES_ERR_INF_DOU_NAME |
A double information name is invalid. | |
1231 | MSK_RES_ERR_INF_INT_NAME |
A integer information name is invalid. | |
1232 | MSK_RES_ERR_INF_TYPE |
The information type is invalid. | |
1235 | MSK_RES_ERR_INDEX |
An index is out of range. | |
1236 | MSK_RES_ERR_WHICHSOL |
The solution number whichsol does not exists. | |
1237 | MSK_RES_ERR_SOLITEM |
The solution item number solitem is invalid. Note for example MSK_SOL_ITEM_SNX is invalid for the basis solution. | |
1238 | MSK_RES_ERR_WHICHITEM_NOT_ALLOWED |
whichitem is unacceptable. | |
1240 | MSK_RES_ERR_MAXNUMCON |
The maximum number of constraints specified is smaller than the number of constants in the task. | |
1241 | MSK_RES_ERR_MAXNUMVAR |
The maximum number of variables specified is smaller than the number of variables in the task. | |
1242 | MSK_RES_ERR_MAXNUMANZ |
The maximum number of nonzeros specified for ![]() ![]() |
|
1243 | MSK_RES_ERR_MAXNUMQNZ |
The maximum number of nonzeros specified for the ![]() ![]() |
|
1250 | MSK_RES_ERR_NUMCONLIM |
Maximum number of constraints limit is exceeded. | |
1251 | MSK_RES_ERR_NUMVARLIM |
Maximum number of variables limit is exceeded. | |
1252 | MSK_RES_ERR_TOO_SMALL_MAXNUMANZ |
Maximum number of non zeros allowed in ![]() |
|
1253 | MSK_RES_ERR_INV_APTRE |
aptre[j] is strictly smaller than aptrb[j] for some j. | |
1254 | MSK_RES_ERR_MUL_A_ELEMENT |
An element in ![]() |
|
1255 | MSK_RES_ERR_INV_BK |
Invalid bound key. | |
1256 | MSK_RES_ERR_INV_BKC |
Invalid bound key is specified for a constraint. | |
1257 | MSK_RES_ERR_INV_BKX |
An invalid bound key is specified for a variable. | |
1258 | MSK_RES_ERR_INV_VAR_TYPE |
An in invalid variable type is specified for a variable. | |
1259 | MSK_RES_ERR_SOLVER_PROBTYPE |
Problem type does not match the chosen optimizer. | |
1260 | MSK_RES_ERR_OBJECTIVE_RANGE |
Empty objective range. | |
1261 | MSK_RES_ERR_FIRST |
Invalid first. | |
1262 | MSK_RES_ERR_LAST |
Invalid last. | |
1263 | MSK_RES_ERR_NEGATIVE_SURPLUS |
Negative surplus. | |
1264 | MSK_RES_ERR_NEGATIVE_APPEND |
Cannot append a negative number. | |
1265 | MSK_RES_ERR_UNDEF_SOLUTION |
The required solution is not defined. | |
1266 | MSK_RES_ERR_BASIS |
An invalid basis is specified. Either too many or too few basis variables are specified. | |
1267 | MSK_RES_ERR_INV_SKC |
Invalid value in skc. | |
1268 | MSK_RES_ERR_INV_SKX |
Invalid value in skx. | |
1274 | MSK_RES_ERR_INV_SKN |
Invalid value in skn. | |
1269 | MSK_RES_ERR_INV_SK_STR |
Invalid status key string encountered. | |
1270 | MSK_RES_ERR_INV_SK |
Invalid status key code. | |
1271 | MSK_RES_ERR_INV_CONE_TYPE_STR |
Invalid cone type string encountered. | |
1272 | MSK_RES_ERR_INV_CONE_TYPE |
Invalid cone type code is encountered. | |
1280 | MSK_RES_ERR_INV_NAME_ITEM |
An invalid name item code is used. | |
1281 | MSK_RES_ERR_PRO_ITEM |
An invalid problem is used. | |
1283 | MSK_RES_ERR_INVALID_FORMAT_TYPE |
Invalid format type. | |
1285 | MSK_RES_ERR_FIRSTI |
Invalid firsti. | |
1286 | MSK_RES_ERR_LASTI |
Invalid lasti. | |
1287 | MSK_RES_ERR_FIRSTJ |
Invalid firstj. | |
1288 | MSK_RES_ERR_LASTJ |
Invalid lastj. | |
1299 | MSK_RES_ERR_ARGUMENT_PERM_ARRAY |
An invalid permutation array is specified. | |
1290 | MSK_RES_ERR_NL_EQUALITY |
The model contains a nonlinear equality which by definition defines a nonconvex set. | |
1291 | MSK_RES_ERR_NONCONVEX |
The optimization problem is nonconvex. | |
1292 | MSK_RES_ERR_NL_RANGED |
The model contains a nonlinear ranged constraint which by definition defines a nonconvex set. | |
1300 | MSK_RES_ERR_CONE_INDEX |
An index of a non existing cone has been specified. | |
1301 | MSK_RES_ERR_CONE_SIZE |
A cone with too few members are specified. | |
1302 | MSK_RES_ERR_CONE_OVERLAP |
A new cone which variables overlap with an existing cone has been specified. | |
1303 | MSK_RES_ERR_CONE_REP_VAR |
A variable is included multiple times in the cone. | |
1304 | MSK_RES_ERR_MAXNUMCONE |
The value specified for maxnumcone is too small. | |
1305 | MSK_RES_ERR_CONE_TYPE |
Invalid cone type specified. | |
1306 | MSK_RES_ERR_CONE_TYPE_STR |
Invalid cone type specified. | |
1310 | MSK_RES_ERR_REMOVE_CONE_VARIABLE |
A variable cannot be removed because it will make a cone invalid. | |
1350 | MSK_RES_ERR_SOL_FILE_NUMBER |
An invalid number is specified in a solution file. | |
1375 | MSK_RES_ERR_HUGE_C |
A huge value in absolute size is specified for one ![]() |
|
1400 | MSK_RES_ERR_INFINITE_BOUND |
A finite bound value is too large in absolute value. | |
1401 | MSK_RES_ERR_INV_QOBJ_SUBI |
Invalid value in qosubi encountered. | |
1402 | MSK_RES_ERR_INV_QOBJ_SUBJ |
Invalid value in qosubj. | |
1403 | MSK_RES_ERR_INV_QOBJ_VAL |
Invalid value in qoval. | |
1404 | MSK_RES_ERR_INV_QCON_SUBK |
Invalid value in qcsubk. | |
1405 | MSK_RES_ERR_INV_QCON_SUBI |
Invalid value in qcsubi. | |
1406 | MSK_RES_ERR_INV_QCON_SUBJ |
Invalid value in qcsubj. | |
1407 | MSK_RES_ERR_INV_QCON_VAL |
Invalid value in qcval. | |
1408 | MSK_RES_ERR_QCON_SUBI_TOO_SMALL |
Invalid value in qcsubi. | |
1409 | MSK_RES_ERR_QCON_SUBI_TOO_LARGE |
Invalid value in qcsubi. | |
1410 | MSK_RES_ERR_USER_FUNC_RET |
An user function reported an error. | |
1411 | MSK_RES_ERR_USER_FUNC_RET_DATA |
An user function returned invalid data. | |
1412 | MSK_RES_ERR_USER_NLO_FUNC |
The user defined nonlinear function reported an error. | |
1413 | MSK_RES_ERR_USER_NLO_EVAL |
The user defined nonlinear function reported an error. | |
1420 | MSK_RES_ERR_USER_NLO_EVAL_HESSUBI |
The user defined nonlinear function reported an Hessian an invalid subscript. | |
1421 | MSK_RES_ERR_USER_NLO_EVAL_HESSUBJ |
The user defined nonlinear function reported an invalid subscript in the Hessian. | |
1430 | MSK_RES_ERR_Y_IS_UNDEFINED |
The solution item ![]() |
|
1450 | MSK_RES_ERR_NAN_IN_DOUBLE_DATA |
A invalid floating value was used in some double data. | |
1500 | MSK_RES_ERR_INV_PROBLEM |
Invalid problem type. Properly a non-convex problem has been specified. | |
1501 | MSK_RES_ERR_MIXED_PROBLEM |
The problem contains both conic and nonlinear constraints. | |
1550 | MSK_RES_ERR_INV_OPTIMIZER |
An invalid optimizer has been chosen for the problem. This happens if the simplex or conic optimizer is chosen to optimize a nonlinear problem. | |
1551 | MSK_RES_ERR_MIO_NO_OPTIMIZER |
No optimizer is available for the current class of integer optimization problems. | |
1552 | MSK_RES_ERR_NO_OPTIMIZER_VAR_TYPE |
No optimizer is available for this class of optimization problems. | |
1553 | MSK_RES_ERR_MIO_NOT_LOADED |
The mixed-integer optimizer is not loaded. | |
1600 | MSK_RES_ERR_NO_BASIS_SOL |
No basis solution is defined as expected. | |
1610 | MSK_RES_ERR_BASIS_FACTOR |
The factorization of the basis is invalid. | |
1615 | MSK_RES_ERR_BASIS_SINGULAR |
The basis is singular and hence cannot be factored. | |
1700 | MSK_RES_ERR_FEASREPAIR_CANNOT_RELAX |
An optimization problem cannot be relaxed. This is for instance the case for general nonlinear optimization problems. | |
1701 | MSK_RES_ERR_FEASREPAIR_SOLVING_RELAXED |
The relaxed problem could not be solved to optimality. Consult the log file for further details. | |
1702 | MSK_RES_ERR_FEASREPAIR_INCONSISTENT_BOUND |
A ranged constraint on a bound or variable has a lower bound that is larger than its upper bound. Pleas fix this before running feasibility repair. | |
1800 | MSK_RES_ERR_INVALID_COMPRESSION |
Invalid compression type. | |
1801 | MSK_RES_ERR_INVALID_IOMODE |
Invalid io mode. | |
2000 | MSK_RES_ERR_NO_PRIMAL_INFEAS_CER |
A primal infeasibility certificate is not available. | |
2001 | MSK_RES_ERR_NO_DUAL_INFEAS_CER |
A dual infeasibility certificate is not available. | |
2500 | MSK_RES_ERR_NO_SOLUTION_IN_CALLBACK |
The required solution is not available. | |
2501 | MSK_RES_ERR_INV_MARKI |
Invalid value in marki. | |
2502 | MSK_RES_ERR_INV_MARKJ |
Invalid value in markj. | |
2503 | MSK_RES_ERR_INV_NUMI |
Invalid numi. | |
2504 | MSK_RES_ERR_INV_NUMJ |
Invalid numj. | |
2505 | MSK_RES_ERR_CANNOT_CLONE_NL |
A task that has a nonlinear function callback cannot be cloned. | |
2506 | MSK_RES_ERR_CANNOT_HANDLE_NL |
A function cannot handle a task with nonlinear function callbacks. | |
2550 | MSK_RES_ERR_MBT_INCOMPATIBLE |
The MBT file is incompatible withe this platform. This results from reading a file on a 32 bit platform generated on a 64 bit platform. | |
2800 | MSK_RES_ERR_LU_MAX_NUM_TRIES |
Could not compute the LU factors of matrix within the maximum number of allowed tries. | |
3000 | MSK_RES_ERR_INTERNAL |
An internal error occurred. Please report this problem. | |
3001 | MSK_RES_ERR_API_ARRAY_TOO_SMALL |
An input array was too short. | |
3002 | MSK_RES_ERR_API_CB_CONNECT |
3003 | MSK_RES_ERR_API_NL_DATA |
3004 | MSK_RES_ERR_API_CALLBACK |
3005 | MSK_RES_ERR_API_FATAL_ERROR |
An internal error occurred in the API. Please report this problem. | |
3999 | MSK_RES_ERR_API_INTERNAL |
3050 | MSK_RES_ERR_SEN_FORMAT |
Syntax error in sensitivity analysis file. | |
3051 | MSK_RES_ERR_SEN_UNDEF_NAME |
An undefined name was encountered in the sensitivity analysis file. | |
3052 | MSK_RES_ERR_SEN_INDEX_RANGE |
Index out of range in the sensitivity analysis file. | |
3053 | MSK_RES_ERR_SEN_BOUND_INVALID_UP |
Analysis of upper bound requested for an index, where no upper bound exists. | |
3054 | MSK_RES_ERR_SEN_BOUND_INVALID_LO |
Analysis of lower bound requested for an index, where no upper bound exists. | |
3055 | MSK_RES_ERR_SEN_INDEX_INVALID |
Invalid range given in sensitivity file. | |
3056 | MSK_RES_ERR_SEN_INVALID_REGEXP |
Syntax error in regexp or regexp longer than 1024 | |
3057 | MSK_RES_ERR_SEN_SOLUTION_STATUS |
No optimal solution found to the original problem given for sensitivity analysis. | |
3058 | MSK_RES_ERR_SEN_NUMERICAL |
Numerical difficulties encountered doing sensitivity analysis. | |
3059 | MSK_RES_ERR_CONCURRENT_OPTIMIZER |
An unsupported optimizer was chosen for use with the concurrent optimizer. | |
3100 | MSK_RES_ERR_UNB_STEP_SIZE |
A step size in an optimizer was unexpectedly unbounded. For instance if the stepsize becomes unbounded in phase 1 of the simplex algorithm becomes unbounded then this is an error. | |
3101 | MSK_RES_ERR_IDENTICAL_TASKS |
Some tasks related to this function call was identical. Unique tasks were expected. | |
4000 | MSK_RES_TRM_MAX_ITERATIONS |
The optimizer was terminated on maximum number of iterations. | |
4001 | MSK_RES_TRM_MAX_TIME |
The optimizer was terminated on maximum amount of time. | |
4002 | MSK_RES_TRM_OBJECTIVE_RANGE |
The optimizer was terminated on the objective range. | |
4003 | MSK_RES_TRM_MIO_NEAR_REL_GAP |
The mixed-integer optimizer was terminated because the near optimal relative gap tolerance was satisfied. | |
4004 | MSK_RES_TRM_MIO_NEAR_ABS_GAP |
The mixed-integer optimizer was terminated because the near optimal absolute gap tolerance was satisfied. | |
4008 | MSK_RES_TRM_MIO_NUM_RELAXS |
The mixed-integer optimizer was terminated due to the maximum number relaxations was reached. | |
4009 | MSK_RES_TRM_MIO_NUM_BRANCHES |
The mixed-integer optimizer was terminated due to the maximum number branches was reached. | |
4005 | MSK_RES_TRM_USER_BREAK |
The optimizer was terminated on a user break. | |
4006 | MSK_RES_TRM_STALL |
The optimizer terminated due to slow progress. | |
4007 | MSK_RES_TRM_USER_CALLBACK |
The optimizer terminated due to the return of the user defined call-back function. | |
4020 | MSK_RES_TRM_MAX_NUM_SETBACKS |
The optimizer terminated due to the maximum number of setbacks is reached. This indicates serious numerical problems and a possibly badly formulated problem. | |
4025 | MSK_RES_TRM_NUMERICAL_PROBLEM |
The optimizer terminated due to a numerical problem. This indicates serious numerical problems and a possibly badly formulated problem. | |
4030 | MSK_RES_TRM_INTERNAL |
The optimizer terminated due to some internal reason. |
Value | Name |
Description | |
1 | MSK_SOL_BAS |
The basic solution. | |
0 | MSK_SOL_ITR |
The interior solution. | |
2 | MSK_SOL_ITG |
The integer solution. |
Value | Name |
Description | |
1 | MSK_SPAR_DATA_FILE_NAME |
Data are read and written to this file. | |
9 | MSK_SPAR_PARAM_READ_FILE_NAME |
Modifications to the parameter database is read from this file. | |
10 | MSK_SPAR_PARAM_WRITE_FILE_NAME |
The parameter database is written to this file. | |
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. | |
2 | MSK_SPAR_DEBUG_FILE_NAME |
MOSEK debug file. | |
0 | MSK_SPAR_BAS_SOL_FILE_NAME |
Name of the bas solution file. | |
7 | MSK_SPAR_ITR_SOL_FILE_NAME |
Name of the itr solution file. | |
6 | MSK_SPAR_INT_SOL_FILE_NAME |
Name of the int solution file. | |
17 | MSK_SPAR_SOL_FILTER_XC_LOW |
A filter that used to determine which constraints that should be listed in the solution file. A value of ``0.5'' means all constraints that has xc[i]>0.5 should be printed. Whereas ``+0.5'' means all constraints that has xc[i]>=blc[i]+0.5 should be listed. An empty filter means no filter is applied. | |
18 | MSK_SPAR_SOL_FILTER_XC_UPR |
A filter that is used to determine which constraints that should be listed in the solution file. A value of ``0.5'' means all constraints that has xc[i]<0.5 should be printed. Whereas ``-0.5'' means all constraints that has xc[i]<=buc[i]-0.5 should be listed. An empty filter means no filter is applied. | |
19 | MSK_SPAR_SOL_FILTER_XX_LOW |
A filter that is used to determine which variables that should be listed in the solution file. A value of ``0.5'' means all constraints that has xx[j]>=0.5 should be printed. Whereas ``+0.5'' means all constraints that has xx[j]>=blx[j]+0.5 should be listed. An empty filter means no filter is applied. | |
20 | MSK_SPAR_SOL_FILTER_XX_UPR |
A filter that is used to determine which variables that should be listed in the solution file. A value of ``0.5'' means all constraints that has xx[j]<0.5 should be printed. Whereas ``-0.5'' means all constraints that has xx[j]<=bux[j]-0.5 should be listed. An empty filter means no filter is applied. | |
12 | MSK_SPAR_READ_MPS_OBJ_NAME |
Name of the free constraint that is used as objective function. An empty name means the first constraint is used as objective function. | |
13 | MSK_SPAR_READ_MPS_RAN_NAME |
Name of the RANGE vector that is used. An empty name means the first RANGE vector is used. | |
14 | MSK_SPAR_READ_MPS_RHS_NAME |
Name of the RHS that is used. An empty name means the first RHS vector is used. | |
11 | MSK_SPAR_READ_MPS_BOU_NAME |
Name of the BOUNDS vector that is used. An empty name means the first BOUNDS vector is used. | |
21 | MSK_SPAR_STAT_FILE_NAME |
Statistics file name. | |
23 | MSK_SPAR_STAT_NAME |
Named used when writing the statistics file. | |
22 | MSK_SPAR_STAT_KEY |
Key used when writing the summary file. | |
24 | MSK_SPAR_WRITE_LP_GEN_VAR_NAME |
Sometimes when an LP file is written then additional variables must be inserted. They will have the prefix denoted by this parameter. | |
4 | MSK_SPAR_FEASREPAIR_NAME_SEPARATOR |
Separator string for names of constraints and variables generated by MSK_relaxprimal. |
|
3 | MSK_SPAR_FEASREPAIR_NAME_PREFIX |
If the function MSK_relaxprimal adds new constraints to the problem, then they are prefixed by the value of this parameter. |
|
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. | |
16 | MSK_SPAR_SENSITIVITY_RES_FILE_NAME |
If this is nonempty string, then MSK_sensitivityreport write results to this file. |
|
15 | MSK_SPAR_SENSITIVITY_FILE_NAME |
If defined MSK_sensitivityreport read this file as sensitivity analysis data file specifying the type of analysis to be done. |
Value | Name |
Description | |
0 | MSK_STREAM_LOG |
Log stream. | |
1 | MSK_STREAM_MSG |
Message stream. | |
2 | MSK_STREAM_ERR |
Error stream. | |
3 | MSK_STREAM_WRN |
Warning stream. |
Value | Name |
Description | |
0 | MSK_VAR_TYPE_CONT |
Is a continuous variable. | |
1 | MSK_VAR_TYPE_INT |
Is an integer variable. |