To set these directives, assign a string specifying their values to the AMPL option mosek_options
. For example:
ampl: option mosek_options 'outlev=3 msk_dpar_intpnt_tol_pfeas=1.0e-8';
Possible values: Any positive number.
Description: Maximum relative dual bound violation allowed in an optimal basic solution.
Possible values: Any positive number.
Description: Maximum absolute dual bound violation in an optimal basic solution.
Possible values: Any positive number.
Description: Maximum absolute primal bound violation allowed in an optimal basic solution.
Possible values: Any number.
Description: 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.
Possible values: Any positive value.
Description: Absolute zero tolerance for elements in \(A\).
Possible values: Any positive value.
Description: An element in \(A\) which is larger than this value in absolute size causes a warning message to be printed.
Possible values: Any positive number.
Description: Any bound which in absolute value is greater than this parameter is considered infinite.
Possible values: Any positive number.
Description: If a bound value is larger than this value in absolute size, then a warning message is issued.
Possible values: Any positive number.
Description: Absolute zero tolerance for elements in \(Q\) matrices.
Possible values: Any positive number.
Description: 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.
Possible values: Any positive number.
Description: Dual feasibility tolerance used by the conic interior-point optimizer.
Possible values: Any positive number
Description: 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.
Possible values: Any positive number.
Description: Relative complementarity gap tolerance feasibility tolerance used by the conic interior-point optimizer.
Possible values: Any positive number.
Description: Primal feasibility tolerance used by the conic interior-point optimizer.
Possible values: Any positive number.
Description: Relative gap termination tolerance used by the conic interior-point optimizer.
Possible values: Any positive number.
Description: Dual feasibility tolerance used when a nonlinear model is solved.
Possible values: Any positive number.
Description: Relative complementarity gap tolerance.
Possible values: Any positive number.
Description: Primal feasibility tolerance used when a nonlinear model is solved.
Possible values: Any positive number.
Description: Relative gap termination tolerance for nonlinear problems.
Possible values: Any positive number less than 0.999999.
Description: Relative step size to the boundary for general nonlinear optimization problems.
Possible values: Any positive number.
Description: Dual feasibility tolerance used for linear and quadratic optimization problems.
Possible values: Any positive value greater then 1.0e-4.
Description: Controls the initial primal starting point used by the interior-point optimizer. If the interior-point optimizer converge slowly.
Possible values: Any positive number
Description: 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.
Possible values: Any positive number.
Description: Relative complementarity gap tolerance.
Possible values: Any positive number less than 0.5.
Description: 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.
Possible values: Any positive number.
Description: Primal feasibility tolerance used for linear and quadratic optimization problems.
Possible values: Any positive number greater than 0.01.
Description: 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.
Possible values: Any positive number.
Description: Relative gap termination tolerance.
Possible values: Any positive number less than 0.999999.
Description: Relative step size to the boundary for linear and quadratic optimization problems.
Possible values: Any value greater than 1.
Description: Length of the pause in the seconds between two checks of whether a license is available.
Possible values: Any nonnegative value.
Description: Absolute relaxation tolerance of the integer constraints. I.e. \(\min(\vert x\vert-\lfloor x \rfloor,\lceil x \rceil – \vert x\vert)\) is less than the tolerance then the integer restrictions assumed to be satisfied.
Possible values: Any number
Description: This parameter limits the maximum time spend by the mixed integer optimizer. A negative number means infinity.
Possible values: Any nonnegative value.
Description: Number of seconds spend by the mixed integer optimizer before the
MSK_DPAR_MIO_TOL_REL_RELAX_INT is applied.
Possible values: Any nonnegative value
Description: Absolute optimality tolerance employed by the mixed integer optimizer.
Possible values: Any nonnegative value.
Description: Absolute relaxation tolerance of the integer constraints. I.e. \(\min(\vert x\vert-\lfloor x \rfloor,\lceil x \rceil – \vert x\vert)\) is less than the tolerance then the integer restrictions assumed to be satisfied.
Possible values: Any nonnegative value.
Description: Relative optimality tolerance employed by the mixed integer optimizer.
Possible values: Any nonnegative value.
Description: Relative relaxation tolerance of the integer constraints. I.e. \(\min(\vert x\vert-\lfloor x \rfloor,\lceil x \rceil – \vert x\vert)\) is less than the tolerance times \(\vert x\vert\) then the integer restrictions assumed to be satisfied.
Possible values: Any nonnegative integer.
Description: Additional number of non-zeros that are made room for in \(A\) when numanz exceeds maxnumanz during the addition of new \(A\) entries.
Possible values: Any nonnegative integer.
Description: Additional number of constraints that is made room when numcon exceeds maxnumcon when adding constraints.
Possible values: Any nonnegative integer.
Description: Additional number of cone constraints that are made room when the number of cone constraints are increased.
Possible values: Any nonnegative integer.
Description: Additional number of \(Q\) non-zeros that are made room for when numanz exceeds maxnumqnz during addition of new \(Q\) entries.
Possible values: Any nonnegative integer.
Description: Additional number of variables that is made room when numvar exceeds maxnumvar when adding constraints.
Possible values: Any integer.
Description: 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.
Possible values: Any integer.
Description: 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.
Possible values:
(1) MSK_ON | Switch the option on. |
(0) MSK_OFF | Switch the option off. |
Description: 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.
Possible values:
(1) MSK_ON | Switch the option on. |
(0) MSK_OFF | Switch the option off. |
Description: If turned on, then ranged constraints and variables are written to the solution file independent of the filter setting.
Possible values:
(1) MSK_ON | Switch the option on. |
(0) MSK_OFF | Switch the option off. |
Description: If turned on, then basic and super basic constraints and variables are written to the solution file independent of the filter setting.
Possible values:
(1) MSK_ON | Switch the option on. |
(0) MSK_OFF | Switch the option off. |
Description: Controls whether an infeasibility report is automatically produced after the optimization if the problem is primal or dual infeasible.
Possible values: Any nonnegative value.
Description: Controls the amount info presented in an infeasibility report. Higher values implies more information.
Possible values:
(1) MSK_ON | An optimal basis is computed. |
(0) MSK_OFF | An optimal basis is not computed. |
Description: Controls whether the interior-point optimizer also computes an optimal basis.
Possible values:
(0) MSK_OFF | Different step sizes are not allowed. |
(1) MSK_ON | Different step sizes are allowed. |
Description: Controls whether different step sizes are allowed in the primal and dual space.
Possible values: Any nonnegative integer.
Description: Controls the maximum number of iterations allowed in the interior-point optimizer.
Possible values: Any nonnegative integer.
Description: 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.
Possible values:
(0) MSK_ORDER_METHOD_FREE | The ordering method is automatically chosen. |
(1) MSK_ORDER_METHOD_APPMINLOC1 | Approximate minimum local-fill-in ordering is used. |
(2) MSK_ORDER_METHOD_APPMINLOC2 | A variant of the approximate minimum local-fill-in ordering is used. |
(3) MSK_ORDER_METHOD_GRAPHPAR | Graph partitioning based ordering. |
(4) MSK_ORDER_METHOD_EXTERNAL | An ordering method provided by an external algorithm is used. This option is currently only available on the SGI platform. |
(5) MSK_ORDER_METHOD_NONE | No ordering is used. |
Description: Controls the ordering strategy used by the interior-point optimizer when factorizing the Newton equation system.
Possible values: Either 0 or 1.
Description: Controls amount of output printed by the interior-point optimizer.
Possible values:
(0) MSK_SCALING_FREE | The optimizer choose the scaling heuristic. |
(1) MSK_SCALING_NONE | No scaling is performed. |
(2) MSK_SCALING_MODERATE | A conservative scaling is performed. |
(3) MSK_SCALING_AGGRESIVE | A very aggressive scaling is performed. |
Description: Controls how the problem is scaled before the interior-point optimizer is used.
Possible values:
(0) MSK_SOLVE_FREE | The optimizer is free to solve either the primal or the dual problem. |
(1) MSK_SOLVE_PRIMAL | The optimizer should solve the primal problem. |
(2) MSK_SOLVE_DUAL | The optimizer should solve the dual problem. |
Description: Controls whether the primal or the dual problem is solved.
Possible values: Any nonnegative integer.
Description: Maximum number of warnings that is echoed.
Possible values:
(0) MSK_MIO_BRANCH_FREE | The mixed optimizer decides which branch to choose. |
(1) MSK_MIO_BRANCH_DOWN | The mixed integer optimizer always chooses the up branch. |
(2) MSK_MIO_BRANCH_UP | The mixed integer optimizer always chooses the down branch. |
Description: Controls whether the mixed integer optimizer is branching up or down by default.
Possible values:
(0) MSK_MIO_CONT_SOL_NONE | No interior or basis solutions are reported when the mixed integer optimizer is used. |
(1) MSK_MIO_CONT_SOL_ROOT | The reported interior-point and basis solutions are a solution to the root node problem when mixed integer optimizer is used. |
(2) MSK_MIO_CONT_SOL_INT | The reported interior-point and basis solutions are a solution to the problem with all integer variables fixed at their optimal values. |
Description: Controls which problem the interior and basis solutions are solutions too when the problem is optimized using the mixed integer optimizer.
Possible values: Any value.
Description: 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.
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 |
Possible values: Any value.
Description: Controls the heuristic employed by the mixed integer optimizer to locate an integer feasible solution. A negative value means the default heuristic is used. 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.
Possible values:
(1) MSK_ON | Switch the option on. |
(0) MSK_OFF | Switch the option off. |
Description: Controls whether the integer presolve keeps bases in memory. This speeds on the solution process at cost of bigger memory consumption.
Possible values: Any positive integer.
Description: This option is currently used.
Possible values:
(0) MSK_MIO_MODE_IGNORED | Integer restrictions should be ignored. |
(1) MSK_MIO_MODE_SATISFIED | Integer restrictions should be satisfied. |
(2) MSK_MIO_MODE_LAZY | Integer restrictions should be satisfied if an optimizer is variable for the problem. |
Description: Controls whether the optimizer includes the integer restrictions when solving a (mixed) integer optimization problem.
Possible values:
(0) MSK_OPTIMIZER_FREE | The choice is made automatically. |
(1) MSK_OPTIMIZER_INTPNT | The interior-point optimizer is used. |
(3) MSK_OPTIMIZER_PRIMAL_SIMPLEX | The primal simplex optimizer is used. |
(5) MSK_OPTIMIZER_DUAL_SIMPLEX | The dual simplex optimizer is used. |
Description: Controls which optimizer that is employed non root nodes in the mixed integer optimizer.
Possible values:
(0) MSK_MIO_NODE_SELECTION_FREE | The optimizer decides the node selection strategy. |
(1) MSK_MIO_NODE_SELECTION_FIRST | The optimizer employs a depth first node selection strategy. |
(2) MSK_MIO_NODE_SELECTION_BEST | The optimizer employs a best bound node selection strategy. |
(3) MSK_MIO_NODE_SELECTION_WORST | The optimizer employs a worst bound node selection strategy. |
(4) MSK_MIO_NODE_SELECTION_HYBRID | The optimizer employs a hybrid strategy. |
(5) MSK_MIO_NODE_SELECTION_PSEUDO | The optimizer employs selects the node based on a pseudo cost estimate. |
Description: Controls the node selection strategy employed by the mixed integer optimizer.
Possible values: Any positive integer.
Description: Controls the presolve level employed by the mixed integer optimizer.
Possible values: .
Description: 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.
Possible values: Any positive integer.
Description: Controls the print level for the mixed integer optimizer
Possible values:
(0) MSK_OPTIMIZER_FREE | The choice is made automatically. |
(1) MSK_OPTIMIZER_INTPNT | The interior-point optimizer is used. |
(3) MSK_OPTIMIZER_PRIMAL_SIMPLEX | The primal simplex optimizer is used. |
(5) MSK_OPTIMIZER_DUAL_SIMPLEX | The dual simplex optimizer is used. |
Description: Controls which optimizer that is employed at the root node in the mixed integer optimizer.
Possible values: Any positive integer.
Description:
Possible values: Any integer value.
Description: 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.
Possible values:
(1) MSK_ON | Switch the option on. |
(0) MSK_OFF | Switch the option off. |
Description: MOSEK has two MPS file readers. The fast takes about 50% of the slow one. Moreover, the slow one requires less space.
Possible values:
(1) MSK_ON | Keep the integer restrictions. |
(0) MSK_OFF | Drops the integer restrictions. |
Description: Controls whether MOSEK should keep the integer restrictions on the variables while reading the MPS file.
Possible values:
(1) MSK_ON | Reads the continuous relaxation. |
(0) MSK_OFF | Reads the integer problem. |
Description: MOSEK cannot solve integer programming problems, but only the continuous relaxation. If this option is turned on, then the relaxation will be read.
Possible values: Any integer larger than 0.
Description: Controls the number of processors employed by the parallel version of MOSEK.
Possible values:
(1) MSK_OBJECTIVE_SENSE_MAX | The problem should be maximized. |
(0) MSK_OBJECTIVE_SENSE_MIN | The problem should be minimized. |
Description: Controls whether the problem is minimized or maximized.
Possible values:
(0) MSK_OPTIMIZER_FREE | The choice is made automatically. |
(1) MSK_OPTIMIZER_INTPNT | The interior-point optimizer is used. |
(2) MSK_OPTIMIZER_QCONE | The Qcone optimizer is used. |
(4) MSK_OPTIMIZER_CONIC | Another cone optimizer. |
(3) MSK_OPTIMIZER_PRIMAL_SIMPLEX | The primal simplex optimizer is used. |
Description: Controls which optimizer is used to optimize the task.
Possible values:
(1) MSK_ON | Turns the check on. |
(0) MSK_OFF | Turns the check off. |
Description: Controls whether the linear constraints is checked for linear dependencies.
Possible values:
(1) MSK_ON | Turns the eliminator on. |
(0) MSK_OFF | Turns the eliminator off. |
Description: Controls whether free or implied free variables are eliminator from the problem.
Possible values:
Description: 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.
Possible values:
(1) MSK_ON | Turns the presolve on. |
(0) MSK_OFF | Turns the presolve off. |
Description: Controls whether presolve is performed.
Possible values: Any nonnegative integer.
Description: Additional number of non-zeros in \(A\) that is made room for in the problem.
Possible values: Any nonnegative integer.
Description: Additional number of constraints that is made room for in the problem.
Possible values: Any nonnegative integer.
Description: Additional number of constraints that is made room for in the problem.
Possible values: Any nonnegative integer.
Description: Additional number of non-zeros in the \(Q\) matrices that is made room for in the problem.
Possible values: Any nonnegative integer.
Description: Additional number of variables that is made room for in the problem.
Possible values:
(1) MSK_ON | The free constraints are kept. |
(0) MSK_OFF | The free constraints are discarded. |
Description: Controls whether the free constraints are included in the problem.
Possible values:
(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 the input file satisfies the free MPS format. This implies spaces are not allowed names. On the other hand the format is free. |
Description: Controls how strict the MPS file reader is regarding the MPS format.
Possible values: Any positive number greater than 80.
Description: Controls the maximal number of chars allowed in one line of the MPS file.
Possible values:
(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. |
Description: Controls how the Q matrices are read from the MPS file.
Possible values: Any positive number greater than 80.
Description: Controls the maximal acceptable width of line in the solution solutions when read by MOSEK.
Possible values:
(1) MSK_ON | Crashing is performed. |
(0) MSK_OFF | Crashing is not performed. |
Description: Controls whether crashing is performed before the optimization is performed by an simplex optimizer.
Possible values: Any positive integer.
Description: Controls how frequent the simplex optimizer outputs information about the optimization and how frequent the user defined call-back function is called.
Possible values: Any positive integer.
Description: Maximum number of iterations that can used by a simplex optimizer.
Possible values:
(0) MSK_SIM_SELECTION_FREE | The optimizer choose the pricing strategy. |
(1) MSK_SIM_SELECTION_FULL | The optimizer uses full pricing. |
(2) MSK_SIM_SELECTION_ASE | The optimizer uses approximate steepest-edge pricing. |
Description: Controls the choice of the incoming variable known as the pricing strategy in the primal simplex optimizer.
Possible values: Either 0 or 1.
Description: Controls amount of output printed by the simplex optimizer.
Possible values: Any positive integer.
Description: Controls how frequent the basis is refactorized. The value 0 means that the optimizer determines when the best point of refactorization is.
Possible values:
(1) MSK_ON | Switch the option on. |
(0) MSK_OFF | Switch the option off. |
Description: Controls whether MOSEK waits for free license.
Possible values:
(1) MSK_ON | Switch the option on. |
(0) MSK_OFF | Switch the option off. |
Description: Controls whether the constraint section is written to the basis solution file.
Possible values:
(1) MSK_ON | Switch the option on. |
(0) MSK_OFF | Switch the option off. |
Description: Controls whether the header section is written to the basis solution file.
Possible values:
(1) MSK_ON | Switch the option on. |
(0) MSK_OFF | Switch the option off. |
Description: Controls whether the variables section is written to the basis solution file.
Possible values: Only the symbolic values are allowed.
Description: Controls whether the MPS file is written in compressed form.
Possible values:
(1) MSK_ON | The free constraints are written. |
(0) MSK_OFF | The free constraints are discarded. |
Description: Controls whether the free constraints is written to the data file.
Possible values:
(1) MSK_ON | Generic names are used. |
(0) MSK_OFF | Generic names are not used. |
Description: Controls whether generic names or the user defined names are used in the data file.
Possible values:
(1) MSK_ON | Switch the option on. |
(0) MSK_OFF | Switch the option off. |
Description: Controls whether the constraint section is written to the integer solution file.
Possible values:
(1) MSK_ON | Switch the option on. |
(0) MSK_OFF | Switch the option off. |
Description: Controls whether the header section is written to the integer solution file.
Possible values:
(1) MSK_ON | Marker records are written. |
(0) MSK_OFF | Marker records are not written. |
Description: Controls whether marker records are written to the MPS file to indicate whether variables are integer restricted.
Possible values:
(1) MSK_ON | Switch the option on. |
(0) MSK_OFF | Switch the option off. |
Description: Controls whether the variables section is written to the integer solution file.
Possible values: Any positive integer.
Description: 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.
Possible values:
(1) MSK_ON | Switch the option on. |
(0) MSK_OFF | Switch the option off. |
Description: Controls whether the constraint section is written to the solution file.
Possible values:
(1) MSK_ON | Switch the option on. |
(0) MSK_OFF | Switch the option off. |
Description: Controls whether the header section is written to the solution file.
Possible values:
(1) MSK_ON | Switch the option on. |
(0) MSK_OFF | Switch the option off. |
Description: Controls whether the variables section is written to the solution file.
Possible values:
(1) MSK_ON | The written data file satisfies the MPS file format strictly. |
(0) MSK_OFF | The written data file may not satisfies the MPS file format strictly. |
Description: Controls whether the written MPS file satisfies the MPS format strictly or not.
Possible values: Any valid file name.
Description: Name of the bas solution file.
Possible values: Any valid file name.
Description: Data are read and written to this file.
Possible values: Any valid file name.
Description: MOSEK debug file.
Possible values: Any valid file name.
Description: Name of the int solution file.
Possible values: Any valid file name.
Description: Name of the itr solution file.
Possible values: Any valid file name.
Description: Modifications to the parameter database is read from this file.
Possible values: Any valid filter.
Description: 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.
Possible values: Any valid filter.
Description: 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.
Possible values: Any valid filter.
Description: 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.
Possible values: Any valid file name.
Description: 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.
Possible values: Any valid file name.
Description: MOSEK statistics file.
Possible values: Any nonnegative integer.
Description: Controls the amount of output generated by MOSEK. A value of 0 causes no output to be generated, and higher values result in progressively more output.
Possible values: Any nonnegative integer.
Description: Controls the solution information that MOSEK generates when run in standalone mode (called without the argument -AMPL). It should be constructed as the sum of
1 | to write a .sol file |
2 | to print the primal variable values |
4 | to print the dual variable values |
8 | to suppress printing the solution message |