15.8 Enumerations¶

Basindtype¶

Basis identification

Basindtype::NEVER¶: Never do basis identification.

Basindtype::ALWAYS¶: Basis identification is always performed even if the interior-point optimizer terminates abnormally.

Basindtype::NO_ERROR¶: Basis identification is performed if the interior-point optimizer terminates without an error.

Basindtype::IF_FEASIBLE¶: Basis identification is not performed if the interior-point optimizer terminates with a problem status saying that the problem is primal or dual infeasible.

Basindtype::RESERVERED¶: Not currently in use.

Boundkey¶

Bound keys

Boundkey::LO¶: The constraint or variable has a finite lower bound and an infinite upper bound.

Boundkey::UP¶: The constraint or variable has an infinite lower bound and an finite upper bound.

Boundkey::FX¶: The constraint or variable is fixed.

Boundkey::FR¶: The constraint or variable is free.

Boundkey::RA¶: The constraint or variable is ranged.

Mark¶

Mark

Mark::LO¶: The lower bound is selected for sensitivity analysis.

Mark::UP¶: The upper bound is selected for sensitivity analysis.

Simprecision¶

Exprimental. Usage not recommended.

Simprecision::NORMAL¶: Exprimental. Usage not recommended.

Simprecision::EXTENDED¶: Exprimental. Usage not recommended.

Simdegen¶

Degeneracy strategies

Simdegen::NONE¶: The simplex optimizer should use no degeneration strategy.

Simdegen::FREE¶: The simplex optimizer chooses the degeneration strategy.

Simdegen::AGGRESSIVE¶: The simplex optimizer should use an aggressive degeneration strategy.

Simdegen::MODERATE¶: The simplex optimizer should use a moderate degeneration strategy.

Simdegen::MINIMUM¶: The simplex optimizer should use a minimum degeneration strategy.

Transpose¶

Transposed matrix.

Transpose::NO¶: No transpose is applied.

Transpose::YES¶: A transpose is applied.

Uplo¶

Triangular part of a symmetric matrix.

Uplo::LO¶: Lower part.

Uplo::UP¶: Upper part.

Simreform¶

Problem reformulation.

Simreform::ON¶: Allow the simplex optimizer to reformulate the problem.

Simreform::OFF¶: Disallow the simplex optimizer to reformulate the problem.

Simreform::FREE¶: The simplex optimizer can choose freely.

Simreform::AGGRESSIVE¶: The simplex optimizer should use an aggressive reformulation strategy.

Simdupvec¶

Exploit duplicate columns.

Simdupvec::ON¶: Allow the simplex optimizer to exploit duplicated columns.

Simdupvec::OFF¶: Disallow the simplex optimizer to exploit duplicated columns.

Simdupvec::FREE¶: The simplex optimizer can choose freely.

Simhotstart¶

Hot-start type employed by the simplex optimizer

Simhotstart::NONE¶: The simplex optimizer performs a coldstart.

Simhotstart::FREE¶: The simplex optimize chooses the hot-start type.

Simhotstart::STATUS_KEYS¶: Only the status keys of the constraints and variables are used to choose the type of hot-start.

Intpnthotstart¶

Hot-start type employed by the interior-point optimizers.

Intpnthotstart::NONE¶: The interior-point optimizer performs a coldstart.

Intpnthotstart::PRIMAL¶: The interior-point optimizer exploits the primal solution only.

Intpnthotstart::DUAL¶: The interior-point optimizer exploits the dual solution only.

Intpnthotstart::PRIMAL_DUAL¶: The interior-point optimizer exploits both the primal and dual solution.

Callbackcode¶

Progress callback codes

Callbackcode::BEGIN_BI¶: The basis identification procedure has been started.

Callbackcode::BEGIN_CONIC¶: The callback function is called when the conic optimizer is started.

Callbackcode::BEGIN_DUAL_BI¶: The callback function is called from within the basis identification procedure when the dual phase is started.

Callbackcode::BEGIN_DUAL_SENSITIVITY¶: Dual sensitivity analysis is started.

Callbackcode::BEGIN_DUAL_SETUP_BI¶: The callback function is called when the dual BI phase is started.

Callbackcode::BEGIN_DUAL_SIMPLEX¶: The callback function is called when the dual simplex optimizer started.

Callbackcode::BEGIN_DUAL_SIMPLEX_BI¶: The callback function is called from within the basis identification procedure when the dual simplex clean-up phase is started.

Callbackcode::BEGIN_FOLDING¶: The calback function is called at the beginning of folding.

Callbackcode::BEGIN_FOLDING_BI¶: TBD

Callbackcode::BEGIN_FOLDING_BI_DUAL¶: TBD

Callbackcode::BEGIN_FOLDING_BI_INITIALIZE¶: TBD

Callbackcode::BEGIN_FOLDING_BI_OPTIMIZER¶: TBD

Callbackcode::BEGIN_FOLDING_BI_PRIMAL¶: TBD

Callbackcode::BEGIN_INFEAS_ANA¶: The callback function is called when the infeasibility analyzer is started.

Callbackcode::BEGIN_INITIALIZE_BI¶: The callback function is called from within the basis identification procedure when the initialization phase is started.

Callbackcode::BEGIN_INTPNT¶: The callback function is called when the interior-point optimizer is started.

Callbackcode::BEGIN_LICENSE_WAIT¶: Begin waiting for license.

Callbackcode::BEGIN_MIO¶: The callback function is called when the mixed-integer optimizer is started.

Callbackcode::BEGIN_OPTIMIZE_BI¶: TBD.

Callbackcode::BEGIN_OPTIMIZER¶: The callback function is called when the optimizer is started.

Callbackcode::BEGIN_PRESOLVE¶: The callback function is called when the presolve is started.

Callbackcode::BEGIN_PRIMAL_BI¶: The callback function is called from within the basis identification procedure when the primal phase is started.

Callbackcode::BEGIN_PRIMAL_REPAIR¶: Begin primal feasibility repair.

Callbackcode::BEGIN_PRIMAL_SENSITIVITY¶: Primal sensitivity analysis is started.

Callbackcode::BEGIN_PRIMAL_SETUP_BI¶: The callback function is called when the primal BI setup is started.

Callbackcode::BEGIN_PRIMAL_SIMPLEX¶: The callback function is called when the primal simplex optimizer is started.

Callbackcode::BEGIN_PRIMAL_SIMPLEX_BI¶: The callback function is called from within the basis identification procedure when the primal simplex clean-up phase is started.

Callbackcode::BEGIN_QCQO_REFORMULATE¶: Begin QCQO reformulation.

Callbackcode::BEGIN_READ¶: MOSEK has started reading a problem file.

Callbackcode::BEGIN_ROOT_CUTGEN¶: The callback function is called when root cut generation is started.

Callbackcode::BEGIN_SIMPLEX¶: The callback function is called when the simplex optimizer is started.

Callbackcode::BEGIN_SOLVE_ROOT_RELAX¶: The callback function is called when solution of root relaxation is started.

Callbackcode::BEGIN_TO_CONIC¶: Begin conic reformulation.

Callbackcode::BEGIN_WRITE¶: MOSEK has started writing a problem file.

Callbackcode::CONIC¶: The callback function is called from within the conic optimizer after the information database has been updated.

Callbackcode::DECOMP_MIO¶: The callback function is called when the dedicated algorithm for independent blocks inside the mixed-integer solver is started.

Callbackcode::DUAL_SIMPLEX¶: The callback function is called from within the dual simplex optimizer.

Callbackcode::END_BI¶: The callback function is called when the basis identification procedure is terminated.

Callbackcode::END_CONIC¶: The callback function is called when the conic optimizer is terminated.

Callbackcode::END_DUAL_BI¶: The callback function is called from within the basis identification procedure when the dual phase is terminated.

Callbackcode::END_DUAL_SENSITIVITY¶: Dual sensitivity analysis is terminated.

Callbackcode::END_DUAL_SETUP_BI¶: The callback function is called when the dual BI phase is terminated.

Callbackcode::END_DUAL_SIMPLEX¶: The callback function is called when the dual simplex optimizer is terminated.

Callbackcode::END_DUAL_SIMPLEX_BI¶: The callback function is called from within the basis identification procedure when the dual clean-up phase is terminated.

Callbackcode::END_FOLDING¶: The calback function is called at the end of folding.

Callbackcode::END_FOLDING_BI¶: TBD

Callbackcode::END_FOLDING_BI_DUAL¶: TBD

Callbackcode::END_FOLDING_BI_INITIALIZE¶: TBD

Callbackcode::END_FOLDING_BI_OPTIMIZER¶: TBD

Callbackcode::END_FOLDING_BI_PRIMAL¶: TBD

Callbackcode::END_INFEAS_ANA¶: The callback function is called when the infeasibility analyzer is terminated.

Callbackcode::END_INITIALIZE_BI¶: The callback function is called from within the basis identification procedure when the initialization phase is terminated.

Callbackcode::END_INTPNT¶: The callback function is called when the interior-point optimizer is terminated.

Callbackcode::END_LICENSE_WAIT¶: End waiting for license.

Callbackcode::END_MIO¶: The callback function is called when the mixed-integer optimizer is terminated.

Callbackcode::END_OPTIMIZE_BI¶: TBD.

Callbackcode::END_OPTIMIZER¶: The callback function is called when the optimizer is terminated.

Callbackcode::END_PRESOLVE¶: The callback function is called when the presolve is completed.

Callbackcode::END_PRIMAL_BI¶: The callback function is called from within the basis identification procedure when the primal phase is terminated.

Callbackcode::END_PRIMAL_REPAIR¶: End primal feasibility repair.

Callbackcode::END_PRIMAL_SENSITIVITY¶: Primal sensitivity analysis is terminated.

Callbackcode::END_PRIMAL_SETUP_BI¶: The callback function is called when the primal BI setup is terminated.

Callbackcode::END_PRIMAL_SIMPLEX¶: The callback function is called when the primal simplex optimizer is terminated.

Callbackcode::END_PRIMAL_SIMPLEX_BI¶: The callback function is called from within the basis identification procedure when the primal clean-up phase is terminated.

Callbackcode::END_QCQO_REFORMULATE¶: End QCQO reformulation.

Callbackcode::END_READ¶: MOSEK has finished reading a problem file.

Callbackcode::END_ROOT_CUTGEN¶: The callback function is called when root cut generation is terminated.

Callbackcode::END_SIMPLEX¶: The callback function is called when the simplex optimizer is terminated.

Callbackcode::END_SIMPLEX_BI¶: The callback function is called from within the basis identification procedure when the simplex clean-up phase is terminated.

Callbackcode::END_SOLVE_ROOT_RELAX¶: The callback function is called when solution of root relaxation is terminated.

Callbackcode::END_TO_CONIC¶: End conic reformulation.

Callbackcode::END_WRITE¶: MOSEK has finished writing a problem file.

Callbackcode::FOLDING_BI_DUAL¶: TBD

Callbackcode::FOLDING_BI_OPTIMIZER¶: TBD

Callbackcode::FOLDING_BI_PRIMAL¶: TBD

Callbackcode::HEARTBEAT¶: A heartbeat callback.

Callbackcode::IM_DUAL_SENSIVITY¶: The callback function is called at an intermediate stage of the dual sensitivity analysis.

Callbackcode::IM_DUAL_SIMPLEX¶: The callback function is called at an intermediate point in the dual simplex optimizer.

Callbackcode::IM_LICENSE_WAIT¶: MOSEK is waiting for a license.

Callbackcode::IM_LU¶: The callback function is called from within the LU factorization procedure at an intermediate point.

Callbackcode::IM_MIO¶: The callback function is called at an intermediate point in the mixed-integer optimizer.

Callbackcode::IM_MIO_DUAL_SIMPLEX¶: The callback function is called at an intermediate point in the mixed-integer optimizer while running the dual simplex optimizer.

Callbackcode::IM_MIO_INTPNT¶: The callback function is called at an intermediate point in the mixed-integer optimizer while running the interior-point optimizer.

Callbackcode::IM_MIO_PRIMAL_SIMPLEX¶: The callback function is called at an intermediate point in the mixed-integer optimizer while running the primal simplex optimizer.

Callbackcode::IM_ORDER¶: The callback function is called from within the matrix ordering procedure at an intermediate point.

Callbackcode::IM_PRIMAL_SENSIVITY¶: The callback function is called at an intermediate stage of the primal sensitivity analysis.

Callbackcode::IM_PRIMAL_SIMPLEX¶: The callback function is called at an intermediate point in the primal simplex optimizer.

Callbackcode::IM_READ¶: Intermediate stage in reading.

Callbackcode::IM_ROOT_CUTGEN¶: The callback is called from within root cut generation at an intermediate stage.

Callbackcode::IM_SIMPLEX¶: The callback function is called from within the simplex optimizer at an intermediate point.

Callbackcode::INTPNT¶: The callback function is called from within the interior-point optimizer after the information database has been updated.

Callbackcode::NEW_INT_MIO¶: The callback function is called after a new integer solution has been located by the mixed-integer optimizer.

Callbackcode::OPTIMIZE_BI¶: TBD.

Callbackcode::PRIMAL_SIMPLEX¶: The callback function is called from within the primal simplex optimizer.

Callbackcode::QO_REFORMULATE¶: The callback function is called at an intermediate stage of the conic quadratic reformulation.

Callbackcode::READ_OPF¶: The callback function is called from the OPF reader.

Callbackcode::READ_OPF_SECTION¶: A chunk of \(Q\) non-zeros has been read from a problem file.

Callbackcode::RESTART_MIO¶: The callback function is called when the mixed-integer optimizer is restarted.

Callbackcode::SOLVING_REMOTE¶: The callback function is called while the task is being solved on a remote server.

Callbackcode::UPDATE_DUAL_BI¶: The callback function is called from within the basis identification procedure at an intermediate point in the dual phase.

Callbackcode::UPDATE_DUAL_SIMPLEX¶: The callback function is called in the dual simplex optimizer.

Callbackcode::UPDATE_DUAL_SIMPLEX_BI¶: The callback function is called from within the basis identification procedure at an intermediate point in the dual simplex clean-up phase. The frequency of the callbacks is controlled by the Iparam::LOG_SIM_FREQ parameter.

Callbackcode::UPDATE_PRESOLVE¶: The callback function is called from within the presolve procedure.

Callbackcode::UPDATE_PRIMAL_BI¶: The callback function is called from within the basis identification procedure at an intermediate point in the primal phase.

Callbackcode::UPDATE_PRIMAL_SIMPLEX¶: The callback function is called in the primal simplex optimizer.

Callbackcode::UPDATE_PRIMAL_SIMPLEX_BI¶: The callback function is called from within the basis identification procedure at an intermediate point in the primal simplex clean-up phase. The frequency of the callbacks is controlled by the Iparam::LOG_SIM_FREQ parameter.

Callbackcode::UPDATE_SIMPLEX¶: The callback function is called from simplex optimizer.

Callbackcode::WRITE_OPF¶: The callback function is called from the OPF writer.

Compresstype¶

Compression types

Compresstype::NONE¶: No compression is used.

Compresstype::FREE¶: The type of compression used is chosen automatically.

Compresstype::GZIP¶: The type of compression used is gzip compatible.

Compresstype::ZSTD¶: The type of compression used is zstd compatible.

Conetype¶

Cone types

Conetype::QUAD¶: The cone is a quadratic cone.

Conetype::RQUAD¶: The cone is a rotated quadratic cone.

Conetype::PEXP¶: A primal exponential cone.

Conetype::DEXP¶: A dual exponential cone.

Conetype::PPOW¶: A primal power cone.

Conetype::DPOW¶: A dual power cone.

Conetype::ZERO¶: The zero cone.

Domaintype¶

Cone types

Domaintype::R¶

Domaintype::RZERO¶: The zero vector.

Domaintype::RPLUS¶: The positive orthant.

Domaintype::RMINUS¶: The negative orthant.

Domaintype::QUADRATIC_CONE¶: The quadratic cone.

Domaintype::RQUADRATIC_CONE¶: The rotated quadratic cone.

Domaintype::PRIMAL_EXP_CONE¶: The primal exponential cone.

Domaintype::DUAL_EXP_CONE¶: The dual exponential cone.

Domaintype::PRIMAL_POWER_CONE¶: The primal power cone.

Domaintype::DUAL_POWER_CONE¶: The dual power cone.

Domaintype::PRIMAL_GEO_MEAN_CONE¶: The primal geometric mean cone.

Domaintype::DUAL_GEO_MEAN_CONE¶: The dual geometric mean cone.

Domaintype::SVEC_PSD_CONE¶: The vectorized positive semidefinite cone.

Nametype¶

Name types

Nametype::GEN¶: General names. However, no duplicate and blank names are allowed.

Nametype::MPS¶: MPS type names.

Nametype::LP¶: LP type names.

Symmattype¶

Cone types

Symmattype::SPARSE¶: Sparse symmetric matrix.

Dataformat¶

Data format types

Dataformat::EXTENSION¶: The file extension is used to determine the data file format.

Dataformat::MPS¶: The data file is MPS formatted.

Dataformat::LP¶: The data file is LP formatted.

Dataformat::OP¶: The data file is an optimization problem formatted file.

Dataformat::FREE_MPS¶: The data a free MPS formatted file.

Dataformat::TASK¶: Generic task dump file.

Dataformat::PTF¶: (P)retty (T)ext (F)format.

Dataformat::CB¶: Conic benchmark format,

Dataformat::JSON_TASK¶: JSON based task format.

Solformat¶

Data format types

Solformat::EXTENSION¶: The file extension is used to determine the data file format.

Solformat::B¶: Simple binary format

Solformat::TASK¶: Tar based format.

Solformat::JSON_TASK¶: JSON based format.

Dinfitem¶

Double information items

Dinfitem::ANA_PRO_SCALARIZED_CONSTRAINT_MATRIX_DENSITY¶: Density percentage of the scalarized constraint matrix.

Dinfitem::BI_CLEAN_TIME¶: Time spent within the clean-up phase of the basis identification procedure since its invocation (in seconds).

Dinfitem::BI_DUAL_TIME¶: Time spent within the dual phase basis identification procedure since its invocation (in seconds).

Dinfitem::BI_PRIMAL_TIME¶: Time spent within the primal phase of the basis identification procedure since its invocation (in seconds).

Dinfitem::BI_TIME¶: Time spent within the basis identification procedure since its invocation (in seconds).

Dinfitem::FOLDING_BI_OPTIMIZE_TIME¶: TBD

Dinfitem::FOLDING_BI_UNFOLD_DUAL_TIME¶: TBD

Dinfitem::FOLDING_BI_UNFOLD_INITIALIZE_TIME¶: TBD

Dinfitem::FOLDING_BI_UNFOLD_PRIMAL_TIME¶: TBD

Dinfitem::FOLDING_BI_UNFOLD_TIME¶: TBD

Dinfitem::FOLDING_FACTOR¶: Problem size after folding as a fraction of the original size.

Dinfitem::FOLDING_TIME¶: Total time spent in folding for continuous problems (in seconds).

Dinfitem::INTPNT_DUAL_FEAS¶: Dual feasibility measure reported by the interior-point optimizer. (For the interior-point optimizer this measure is not directly related to the original problem because a homogeneous model is employed.)

Dinfitem::INTPNT_DUAL_OBJ¶: Dual objective value reported by the interior-point optimizer.

Dinfitem::INTPNT_FACTOR_NUM_FLOPS¶: An estimate of the number of flops used in the factorization.

Dinfitem::INTPNT_OPT_STATUS¶: A measure of optimality of the solution. It should converge to \(+1\) if the problem has a primal-dual optimal solution, and converge to \(-1\) if the problem is (strictly) primal or dual infeasible. If the measure converges to another constant, or fails to settle, the problem is usually ill-posed.

Dinfitem::INTPNT_ORDER_TIME¶: Order time (in seconds).

Dinfitem::INTPNT_PRIMAL_FEAS¶: Primal feasibility measure reported by the interior-point optimizer. (For the interior-point optimizer this measure is not directly related to the original problem because a homogeneous model is employed).

Dinfitem::INTPNT_PRIMAL_OBJ¶: Primal objective value reported by the interior-point optimizer.

Dinfitem::INTPNT_TIME¶: Time spent within the interior-point optimizer since its invocation (in seconds).

Dinfitem::MIO_CLIQUE_SELECTION_TIME¶: Selection time for clique cuts (in seconds).

Dinfitem::MIO_CLIQUE_SEPARATION_TIME¶: Separation time for clique cuts (in seconds).

Dinfitem::MIO_CMIR_SELECTION_TIME¶: Selection time for CMIR cuts (in seconds).

Dinfitem::MIO_CMIR_SEPARATION_TIME¶: Separation time for CMIR cuts (in seconds).

Dinfitem::MIO_CONSTRUCT_SOLUTION_OBJ¶: If MOSEK has successfully constructed an integer feasible solution, then this item contains the optimal objective value corresponding to the feasible solution.

Dinfitem::MIO_DUAL_BOUND_AFTER_PRESOLVE¶: Value of the dual bound after presolve but before cut generation.

Dinfitem::MIO_GMI_SELECTION_TIME¶: Selection time for GMI cuts (in seconds).

Dinfitem::MIO_GMI_SEPARATION_TIME¶: Separation time for GMI cuts (in seconds).

Dinfitem::MIO_IMPLIED_BOUND_SELECTION_TIME¶: Selection time for implied bound cuts (in seconds).

Dinfitem::MIO_IMPLIED_BOUND_SEPARATION_TIME¶: Separation time for implied bound cuts (in seconds).

Dinfitem::MIO_INITIAL_FEASIBLE_SOLUTION_OBJ¶: If the user provided solution was found to be feasible this information item contains it’s objective value.

Dinfitem::MIO_KNAPSACK_COVER_SELECTION_TIME¶: Selection time for knapsack cover (in seconds).

Dinfitem::MIO_KNAPSACK_COVER_SEPARATION_TIME¶: Separation time for knapsack cover (in seconds).

Dinfitem::MIO_LIPRO_SELECTION_TIME¶: Selection time for lift-and-project cuts (in seconds).

Dinfitem::MIO_LIPRO_SEPARATION_TIME¶: Separation time for lift-and-project cuts (in seconds).

Dinfitem::MIO_OBJ_ABS_GAP¶

Given the mixed-integer optimizer has computed a feasible solution and a bound on the optimal objective value, then this item contains the absolute gap defined by

\[|\mbox{(objective value of feasible solution)}-\mbox{(objective bound)}|.\]

Otherwise it has the value -1.0.

Dinfitem::MIO_OBJ_BOUND¶: The best known bound on the objective function. This value is undefined until at least one relaxation has been solved: To see if this is the case check that Iinfitem::MIO_NUM_RELAX is strictly positive.

Dinfitem::MIO_OBJ_INT¶: The primal objective value corresponding to the best integer feasible solution. Please note that at least one integer feasible solution must have been located i.e. check Iinfitem::MIO_NUM_INT_SOLUTIONS.

Dinfitem::MIO_OBJ_REL_GAP¶

Given that the mixed-integer optimizer has computed a feasible solution and a bound on the optimal objective value, then this item contains the relative gap defined by

\[\frac{| \mbox{(objective value of feasible solution)}-\mbox{(objective bound)} | }{\max(\delta,|\mbox{(objective value of feasible solution)}|)}.\]

where \(\delta\) is given by the parameter Dparam::MIO_REL_GAP_CONST. Otherwise it has the value \(-1.0\).

Dinfitem::MIO_PROBING_TIME¶: Total time for probing (in seconds).

Dinfitem::MIO_ROOT_CUT_SELECTION_TIME¶: Total time for cut selection (in seconds).

Dinfitem::MIO_ROOT_CUT_SEPARATION_TIME¶: Total time for cut separation (in seconds).

Dinfitem::MIO_ROOT_OPTIMIZER_TIME¶: Time spent in the contiuous optimizer while processing the root node relaxation (in seconds).

Dinfitem::MIO_ROOT_PRESOLVE_TIME¶: Time spent presolving the problem at the root node (in seconds).

Dinfitem::MIO_ROOT_TIME¶: Time spent processing the root node (in seconds).

Dinfitem::MIO_SYMMETRY_DETECTION_TIME¶: Total time for symmetry detection (in seconds).

Dinfitem::MIO_SYMMETRY_FACTOR¶: Degree to which the problem is affected by detected symmetry.

Dinfitem::MIO_TIME¶: Time spent in the mixed-integer optimizer (in seconds).

Dinfitem::MIO_USER_OBJ_CUT¶: If the objective cut is used, then this information item has the value of the cut.

Dinfitem::OPTIMIZER_TICKS¶: Total number of ticks spent in the optimizer since it was invoked. It is strictly negative if it is not available.

Dinfitem::OPTIMIZER_TIME¶: Total time spent in the optimizer since it was invoked (in seconds).

Dinfitem::PRESOLVE_ELI_TIME¶: Total time spent in the eliminator since the presolve was invoked (in seconds).

Dinfitem::PRESOLVE_LINDEP_TIME¶: Total time spent in the linear dependency checker since the presolve was invoked (in seconds).

Dinfitem::PRESOLVE_TIME¶: Total time spent in the presolve since it was invoked (in seconds).

Dinfitem::PRESOLVE_TOTAL_PRIMAL_PERTURBATION¶: Total perturbation of the bounds of the primal problem.

Dinfitem::PRIMAL_REPAIR_PENALTY_OBJ¶: The optimal objective value of the penalty function.

Dinfitem::QCQO_REFORMULATE_MAX_PERTURBATION¶: Maximum absolute diagonal perturbation occurring during the QCQO reformulation.

Dinfitem::QCQO_REFORMULATE_TIME¶: Time spent with conic quadratic reformulation (in seconds).

Dinfitem::QCQO_REFORMULATE_WORST_CHOLESKY_COLUMN_SCALING¶: Worst Cholesky column scaling.

Dinfitem::QCQO_REFORMULATE_WORST_CHOLESKY_DIAG_SCALING¶: Worst Cholesky diagonal scaling.

Dinfitem::READ_DATA_TIME¶: Time spent reading the data file (in seconds).

Dinfitem::REMOTE_TIME¶: The total real time in seconds spent when optimizing on a server by the process performing the optimization on the server (in seconds).

Dinfitem::SIM_DUAL_TIME¶: Time spent in the dual simplex optimizer since invoking it (in seconds).

Dinfitem::SIM_FEAS¶: Feasibility measure reported by the simplex optimizer.

Dinfitem::SIM_OBJ¶: Objective value reported by the simplex optimizer.

Dinfitem::SIM_PRIMAL_TIME¶: Time spent in the primal simplex optimizer since invoking it (in seconds).

Dinfitem::SIM_TIME¶: Time spent in the simplex optimizer since invoking it (in seconds).

Dinfitem::SOL_BAS_DUAL_OBJ¶: Dual objective value of the basic solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_BAS_DVIOLCON¶: Maximal dual bound violation for \(x^c\) in the basic solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_BAS_DVIOLVAR¶: Maximal dual bound violation for \(x^x\) in the basic solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_BAS_NRM_BARX¶: Infinity norm of \(\barX\) in the basic solution.

Dinfitem::SOL_BAS_NRM_SLC¶: Infinity norm of \(s_l^c\) in the basic solution.

Dinfitem::SOL_BAS_NRM_SLX¶: Infinity norm of \(s_l^x\) in the basic solution.

Dinfitem::SOL_BAS_NRM_SUC¶: Infinity norm of \(s_u^c\) in the basic solution.

Dinfitem::SOL_BAS_NRM_SUX¶: Infinity norm of \(s_u^X\) in the basic solution.

Dinfitem::SOL_BAS_NRM_XC¶: Infinity norm of \(x^c\) in the basic solution.

Dinfitem::SOL_BAS_NRM_XX¶: Infinity norm of \(x^x\) in the basic solution.

Dinfitem::SOL_BAS_NRM_Y¶: Infinity norm of \(y\) in the basic solution.

Dinfitem::SOL_BAS_PRIMAL_OBJ¶: Primal objective value of the basic solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_BAS_PVIOLCON¶: Maximal primal bound violation for \(x^c\) in the basic solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_BAS_PVIOLVAR¶: Maximal primal bound violation for \(x^x\) in the basic solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_ITG_NRM_BARX¶: Infinity norm of \(\barX\) in the integer solution.

Dinfitem::SOL_ITG_NRM_XC¶: Infinity norm of \(x^c\) in the integer solution.

Dinfitem::SOL_ITG_NRM_XX¶: Infinity norm of \(x^x\) in the integer solution.

Dinfitem::SOL_ITG_PRIMAL_OBJ¶: Primal objective value of the integer solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_ITG_PVIOLACC¶: Maximal primal violation for affine conic constraints in the integer solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_ITG_PVIOLBARVAR¶: Maximal primal bound violation for \(\barX\) in the integer solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_ITG_PVIOLCON¶: Maximal primal bound violation for \(x^c\) in the integer solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_ITG_PVIOLCONES¶: Maximal primal violation for primal conic constraints in the integer solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_ITG_PVIOLDJC¶: Maximal primal violation for disjunctive constraints in the integer solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_ITG_PVIOLITG¶: Maximal violation for the integer constraints in the integer solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_ITG_PVIOLVAR¶: Maximal primal bound violation for \(x^x\) in the integer solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_ITR_DUAL_OBJ¶: Dual objective value of the interior-point solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_ITR_DVIOLACC¶: Maximal dual violation for the affine conic constraints in the interior-point solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_ITR_DVIOLBARVAR¶: Maximal dual bound violation for \(\barX\) in the interior-point solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_ITR_DVIOLCON¶: Maximal dual bound violation for \(x^c\) in the interior-point solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_ITR_DVIOLCONES¶: Maximal dual violation for conic constraints in the interior-point solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_ITR_DVIOLVAR¶: Maximal dual bound violation for \(x^x\) in the interior-point solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_ITR_NRM_BARS¶: Infinity norm of \(\barS\) in the interior-point solution.

Dinfitem::SOL_ITR_NRM_BARX¶: Infinity norm of \(\barX\) in the interior-point solution.

Dinfitem::SOL_ITR_NRM_SLC¶: Infinity norm of \(s_l^c\) in the interior-point solution.

Dinfitem::SOL_ITR_NRM_SLX¶: Infinity norm of \(s_l^x\) in the interior-point solution.

Dinfitem::SOL_ITR_NRM_SNX¶: Infinity norm of \(s_n^x\) in the interior-point solution.

Dinfitem::SOL_ITR_NRM_SUC¶: Infinity norm of \(s_u^c\) in the interior-point solution.

Dinfitem::SOL_ITR_NRM_SUX¶: Infinity norm of \(s_u^X\) in the interior-point solution.

Dinfitem::SOL_ITR_NRM_XC¶: Infinity norm of \(x^c\) in the interior-point solution.

Dinfitem::SOL_ITR_NRM_XX¶: Infinity norm of \(x^x\) in the interior-point solution.

Dinfitem::SOL_ITR_NRM_Y¶: Infinity norm of \(y\) in the interior-point solution.

Dinfitem::SOL_ITR_PRIMAL_OBJ¶: Primal objective value of the interior-point solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_ITR_PVIOLACC¶: Maximal primal violation for affine conic constraints in the interior-point solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_ITR_PVIOLBARVAR¶: Maximal primal bound violation for \(\barX\) in the interior-point solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_ITR_PVIOLCON¶: Maximal primal bound violation for \(x^c\) in the interior-point solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_ITR_PVIOLCONES¶: Maximal primal violation for conic constraints in the interior-point solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::SOL_ITR_PVIOLVAR¶: Maximal primal bound violation for \(x^x\) in the interior-point solution. Updated if Iparam::AUTO_UPDATE_SOL_INFO is set or by the method Task.update_solution_info.

Dinfitem::TO_CONIC_TIME¶: Time spent in the last to conic reformulation (in seconds).

Dinfitem::WRITE_DATA_TIME¶: Time spent writing the data file (in seconds).

Feature¶

License feature

Feature::PTS¶: Base system.

Feature::PTON¶: Conic extension.

Liinfitem¶

Long integer information items.

Liinfitem::ANA_PRO_SCALARIZED_CONSTRAINT_MATRIX_NUM_COLUMNS¶: Number of columns in the scalarized constraint matrix.

Liinfitem::ANA_PRO_SCALARIZED_CONSTRAINT_MATRIX_NUM_NZ¶: Number of non-zero entries in the scalarized constraint matrix.

Liinfitem::ANA_PRO_SCALARIZED_CONSTRAINT_MATRIX_NUM_ROWS¶: Number of rows in the scalarized constraint matrix.

Liinfitem::BI_CLEAN_ITER¶: Number of clean iterations performed in the basis identification.

Liinfitem::BI_DUAL_ITER¶: Number of dual pivots performed in the basis identification.

Liinfitem::BI_PRIMAL_ITER¶: Number of primal pivots performed in the basis identification.

Liinfitem::FOLDING_BI_DUAL_ITER¶: TBD

Liinfitem::FOLDING_BI_OPTIMIZER_ITER¶: TBD

Liinfitem::FOLDING_BI_PRIMAL_ITER¶: TBD

Liinfitem::INTPNT_FACTOR_NUM_NZ¶: Number of non-zeros in factorization.

Liinfitem::MIO_ANZ¶: Number of non-zero entries in the constraint matrix of the problem to be solved by the mixed-integer optimizer.

Liinfitem::MIO_FINAL_ANZ¶: Number of non-zero entries in the constraint matrix of the mixed-integer optimizer’s final problem.

Liinfitem::MIO_INTPNT_ITER¶: Number of interior-point iterations performed by the mixed-integer optimizer.

Liinfitem::MIO_NUM_DUAL_ILLPOSED_CER¶: Number of dual illposed certificates encountered by the mixed-integer optimizer.

Liinfitem::MIO_NUM_PRIM_ILLPOSED_CER¶: Number of primal illposed certificates encountered by the mixed-integer optimizer.

Liinfitem::MIO_PRESOLVED_ANZ¶: Number of non-zero entries in the constraint matrix of the problem after the mixed-integer optimizer’s presolve.

Liinfitem::MIO_SIMPLEX_ITER¶: Number of simplex iterations performed by the mixed-integer optimizer.

Liinfitem::RD_NUMACC¶: Number of affince conic constraints.

Liinfitem::RD_NUMANZ¶: Number of non-zeros in A that is read.

Liinfitem::RD_NUMDJC¶: Number of disjuncive constraints.

Liinfitem::RD_NUMQNZ¶: Number of Q non-zeros.

Liinfitem::SIMPLEX_ITER¶: Number of iterations performed by the simplex optimizer.

Iinfitem¶

Integer information items.

Iinfitem::ANA_PRO_NUM_CON¶: Number of constraints in the problem. This value is set by Task.analyze_problem.

Iinfitem::ANA_PRO_NUM_CON_EQ¶: Number of equality constraints. This value is set by Task.analyze_problem.

Iinfitem::ANA_PRO_NUM_CON_FR¶: Number of unbounded constraints. This value is set by Task.analyze_problem.

Iinfitem::ANA_PRO_NUM_CON_LO¶: Number of constraints with a lower bound and an infinite upper bound. This value is set by Task.analyze_problem.

Iinfitem::ANA_PRO_NUM_CON_RA¶: Number of constraints with finite lower and upper bounds. This value is set by Task.analyze_problem.

Iinfitem::ANA_PRO_NUM_CON_UP¶: Number of constraints with an upper bound and an infinite lower bound. This value is set by Task.analyze_problem.

Iinfitem::ANA_PRO_NUM_VAR¶: Number of variables in the problem. This value is set by Task.analyze_problem.

Iinfitem::ANA_PRO_NUM_VAR_BIN¶: Number of binary (0-1) variables. This value is set by Task.analyze_problem.

Iinfitem::ANA_PRO_NUM_VAR_CONT¶: Number of continuous variables. This value is set by Task.analyze_problem.

Iinfitem::ANA_PRO_NUM_VAR_EQ¶: Number of fixed variables. This value is set by Task.analyze_problem.

Iinfitem::ANA_PRO_NUM_VAR_FR¶: Number of free variables. This value is set by Task.analyze_problem.

Iinfitem::ANA_PRO_NUM_VAR_INT¶: Number of general integer variables. This value is set by Task.analyze_problem.

Iinfitem::ANA_PRO_NUM_VAR_LO¶: Number of variables with a lower bound and an infinite upper bound. This value is set by Task.analyze_problem.

Iinfitem::ANA_PRO_NUM_VAR_RA¶: Number of variables with finite lower and upper bounds. This value is set by Task.analyze_problem.

Iinfitem::ANA_PRO_NUM_VAR_UP¶: Number of variables with an upper bound and an infinite lower bound. This value is set by Task.analyze_problem.

Iinfitem::FOLDING_APPLIED¶: Non-zero if folding was exploited.

Iinfitem::INTPNT_FACTOR_DIM_DENSE¶: Dimension of the dense sub system in factorization.

Iinfitem::INTPNT_ITER¶: Number of interior-point iterations since invoking the interior-point optimizer.

Iinfitem::INTPNT_NUM_THREADS¶: Number of threads that the interior-point optimizer is using.

Iinfitem::INTPNT_SOLVE_DUAL¶: Non-zero if the interior-point optimizer is solving the dual problem.

Iinfitem::MIO_ABSGAP_SATISFIED¶: Non-zero if absolute gap is within tolerances.

Iinfitem::MIO_CLIQUE_TABLE_SIZE¶: Size of the clique table.

Iinfitem::MIO_CONSTRUCT_SOLUTION¶

This item informs if MOSEK constructed an initial integer feasible solution.

-1: tried, but failed,
0: no partial solution supplied by the user,
1: constructed feasible solution.

Iinfitem::MIO_FINAL_NUMBIN¶: Number of binary variables in the mixed-integer optimizer’s final problem.

Iinfitem::MIO_FINAL_NUMBINCONEVAR¶: Number of binary cone variables in the mixed-integer optimizer’s final problem.

Iinfitem::MIO_FINAL_NUMCON¶: Number of constraints in the mixed-integer optimizer’s final problem.

Iinfitem::MIO_FINAL_NUMCONE¶: Number of cones in the mixed-integer optimizer’s final problem.

Iinfitem::MIO_FINAL_NUMCONEVAR¶: Number of cone variables in the mixed-integer optimizer’s final problem.

Iinfitem::MIO_FINAL_NUMCONT¶: Number of continuous variables in the mixed-integer optimizer’s final problem.

Iinfitem::MIO_FINAL_NUMCONTCONEVAR¶: Number of continuous cone variables in the mixed-integer optimizer’s final problem.

Iinfitem::MIO_FINAL_NUMDEXPCONES¶: Number of dual exponential cones in the mixed-integer optimizer’s final problem.

Iinfitem::MIO_FINAL_NUMDJC¶: Number of disjunctive constraints in the mixed-integer optimizer’s final problem.

Iinfitem::MIO_FINAL_NUMDPOWCONES¶: Number of dual power cones in the mixed-integer optimizer’s final problem.

Iinfitem::MIO_FINAL_NUMINT¶: Number of integer variables in the mixed-integer optimizer’s final problem.

Iinfitem::MIO_FINAL_NUMINTCONEVAR¶: Number of integer cone variables in the mixed-integer optimizer’s final problem.

Iinfitem::MIO_FINAL_NUMPEXPCONES¶: Number of primal exponential cones in the mixed-integer optimizer’s final problem.

Iinfitem::MIO_FINAL_NUMPPOWCONES¶: Number of primal power cones in the mixed-integer optimizer’s final problem.

Iinfitem::MIO_FINAL_NUMQCONES¶: Number of quadratic cones in the mixed-integer optimizer’s final problem.

Iinfitem::MIO_FINAL_NUMRQCONES¶: Number of rotated quadratic cones in the mixed-integer optimizer’s final problem.

Iinfitem::MIO_FINAL_NUMVAR¶: Number of variables in the mixed-integer optimizer’s final problem.

Iinfitem::MIO_INITIAL_FEASIBLE_SOLUTION¶

This item informs if MOSEK found the solution provided by the user to be feasible

0: solution provided by the user was not found to be feasible for the current problem,
1: user provided solution was found to be feasible.

Iinfitem::MIO_NODE_DEPTH¶: Depth of the last node solved.

Iinfitem::MIO_NUM_ACTIVE_NODES¶: Number of active branch and bound nodes.

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

Iinfitem::MIO_NUM_BLOCKS_SOLVED_IN_BB¶: Number of independent decomposition blocks solved though a dedicated algorithm.

Iinfitem::MIO_NUM_BLOCKS_SOLVED_IN_PRESOLVE¶: Number of independent decomposition blocks solved during presolve.

Iinfitem::MIO_NUM_BRANCH¶: Number of branches performed during the optimization.

Iinfitem::MIO_NUM_INT_SOLUTIONS¶: Number of integer feasible solutions that have been found.

Iinfitem::MIO_NUM_RELAX¶: Number of relaxations solved during the optimization.

Iinfitem::MIO_NUM_REPEATED_PRESOLVE¶: Number of times presolve was repeated at root.

Iinfitem::MIO_NUM_RESTARTS¶: Number of restarts performed during the optimization.

Iinfitem::MIO_NUM_ROOT_CUT_ROUNDS¶: Number of cut separation rounds at the root node of the mixed-integer optimizer.

Iinfitem::MIO_NUM_SELECTED_CLIQUE_CUTS¶: Number of clique cuts selected to be included in the relaxation.

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

Iinfitem::MIO_NUM_SELECTED_GOMORY_CUTS¶: Number of Gomory cuts selected to be included in the relaxation.

Iinfitem::MIO_NUM_SELECTED_IMPLIED_BOUND_CUTS¶: Number of implied bound cuts selected to be included in the relaxation.

Iinfitem::MIO_NUM_SELECTED_KNAPSACK_COVER_CUTS¶: Number of clique cuts selected to be included in the relaxation.

Iinfitem::MIO_NUM_SELECTED_LIPRO_CUTS¶: Number of lift-and-project cuts selected to be included in the relaxation.

Iinfitem::MIO_NUM_SEPARATED_CLIQUE_CUTS¶: Number of separated clique cuts.

Iinfitem::MIO_NUM_SEPARATED_CMIR_CUTS¶: Number of separated Complemented Mixed Integer Rounding (CMIR) cuts.

Iinfitem::MIO_NUM_SEPARATED_GOMORY_CUTS¶: Number of separated Gomory cuts.

Iinfitem::MIO_NUM_SEPARATED_IMPLIED_BOUND_CUTS¶: Number of separated implied bound cuts.

Iinfitem::MIO_NUM_SEPARATED_KNAPSACK_COVER_CUTS¶: Number of separated clique cuts.

Iinfitem::MIO_NUM_SEPARATED_LIPRO_CUTS¶: Number of separated lift-and-project cuts.

Iinfitem::MIO_NUM_SOLVED_NODES¶: Number of branch and bounds nodes solved in the main branch and bound tree.

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

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

Iinfitem::MIO_NUMCON¶: Number of constraints in the problem to be solved by the mixed-integer optimizer.

Iinfitem::MIO_NUMCONE¶: Number of cones in the problem to be solved by the mixed-integer optimizer.

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

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

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

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

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

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

Iinfitem::MIO_NUMINT¶: Number of integer variables in the problem to be solved by the mixed-integer optimizer.

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

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

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

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

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

Iinfitem::MIO_NUMVAR¶: Number of variables in the problem to be solved by the mixed-integer optimizer.

Iinfitem::MIO_OBJ_BOUND_DEFINED¶: Non-zero if a valid objective bound has been found, otherwise zero.

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

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

Iinfitem::MIO_PRESOLVED_NUMCON¶: Number of constraints in the problem after the mixed-integer optimizer’s presolve.

Iinfitem::MIO_PRESOLVED_NUMCONE¶: Number of cones in the problem after the mixed-integer optimizer’s presolve.

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

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

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

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

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

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

Iinfitem::MIO_PRESOLVED_NUMINT¶: Number of integer variables in the problem after the mixed-integer optimizer’s presolve.

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

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

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

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

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

Iinfitem::MIO_PRESOLVED_NUMVAR¶: Number of variables in the problem after the mixed-integer optimizer’s presolve.

Iinfitem::MIO_RELGAP_SATISFIED¶: Non-zero if relative gap is within tolerances.

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

Iinfitem::MIO_TOTAL_NUM_SEPARATED_CUTS¶: Total number of cuts separated by the mixed-integer optimizer.

Iinfitem::MIO_USER_OBJ_CUT¶: If it is non-zero, then the objective cut is used.

Iinfitem::OPT_NUMCON¶: Number of constraints in the problem solved when the optimizer is called.

Iinfitem::OPT_NUMVAR¶: Number of variables in the problem solved when the optimizer is called

Iinfitem::OPTIMIZE_RESPONSE¶: The response code returned by optimize.

Iinfitem::PRESOLVE_NUM_PRIMAL_PERTURBATIONS¶: Number perturbations to thhe bounds of the primal problem.

Iinfitem::PURIFY_DUAL_SUCCESS¶: Is nonzero if the dual solution is purified.

Iinfitem::PURIFY_PRIMAL_SUCCESS¶: Is nonzero if the primal solution is purified.

Iinfitem::RD_NUMBARVAR¶: Number of symmetric variables read.

Iinfitem::RD_NUMCON¶: Number of constraints read.

Iinfitem::RD_NUMCONE¶: Number of conic constraints read.

Iinfitem::RD_NUMINTVAR¶: Number of integer-constrained variables read.

Iinfitem::RD_NUMQ¶: Number of nonempty Q matrices read.

Iinfitem::RD_NUMVAR¶: Number of variables read.

Iinfitem::RD_PROTYPE¶: Problem type.

Iinfitem::SIM_DUAL_DEG_ITER¶: The number of dual degenerate iterations.

Iinfitem::SIM_DUAL_HOTSTART¶: If 1 then the dual simplex algorithm is solving from an advanced basis.

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

Iinfitem::SIM_DUAL_INF_ITER¶: The number of iterations taken with dual infeasibility.

Iinfitem::SIM_DUAL_ITER¶: Number of dual simplex iterations during the last optimization.

Iinfitem::SIM_NUMCON¶: Number of constraints in the problem solved by the simplex optimizer.

Iinfitem::SIM_NUMVAR¶: Number of variables in the problem solved by the simplex optimizer.

Iinfitem::SIM_PRIMAL_DEG_ITER¶: The number of primal degenerate iterations.

Iinfitem::SIM_PRIMAL_HOTSTART¶: If 1 then the primal simplex algorithm is solving from an advanced basis.

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

Iinfitem::SIM_PRIMAL_INF_ITER¶: The number of iterations taken with primal infeasibility.

Iinfitem::SIM_PRIMAL_ITER¶: Number of primal simplex iterations during the last optimization.

Iinfitem::SIM_SOLVE_DUAL¶: Is non-zero if dual problem is solved.

Iinfitem::SOL_BAS_PROSTA¶: Problem status of the basic solution. Updated after each optimization.

Iinfitem::SOL_BAS_SOLSTA¶: Solution status of the basic solution. Updated after each optimization.

Iinfitem::SOL_ITG_PROSTA¶: Problem status of the integer solution. Updated after each optimization.

Iinfitem::SOL_ITG_SOLSTA¶: Solution status of the integer solution. Updated after each optimization.

Iinfitem::SOL_ITR_PROSTA¶: Problem status of the interior-point solution. Updated after each optimization.

Iinfitem::SOL_ITR_SOLSTA¶: Solution status of the interior-point solution. Updated after each optimization.

Iinfitem::STO_NUM_A_REALLOC¶: Number of times the storage for storing \(A\) has been changed. A large value may indicates that memory fragmentation may occur.

Inftype¶

Information item types

Inftype::DOU_TYPE¶: Is a double information type.

Inftype::INT_TYPE¶: Is an integer.

Inftype::LINT_TYPE¶: Is a long integer.

Iomode¶

Input/output modes

Iomode::READ¶: The file is read-only.

Iomode::WRITE¶: The file is write-only. If the file exists then it is truncated when it is opened. Otherwise it is created when it is opened.

Iomode::READWRITE¶: The file is to read and write.

Branchdir¶

Specifies the branching direction.

Branchdir::FREE¶: The mixed-integer optimizer decides which branch to choose.

Branchdir::UP¶: The mixed-integer optimizer always chooses the up branch first.

Branchdir::DOWN¶: The mixed-integer optimizer always chooses the down branch first.

Branchdir::NEAR¶: Branch in direction nearest to selected fractional variable.

Branchdir::FAR¶: Branch in direction farthest from selected fractional variable.

Branchdir::ROOT_LP¶: Chose direction based on root lp value of selected variable.

Branchdir::GUIDED¶: Branch in direction of current incumbent.

Branchdir::PSEUDOCOST¶: Branch based on the pseudocost of the variable.

Miqcqoreformmethod¶

Specifies the reformulation method for mixed-integer quadratic problems.

Miqcqoreformmethod::FREE¶: The mixed-integer optimizer decides which reformulation method to apply.

Miqcqoreformmethod::NONE¶: No reformulation method is applied.

Miqcqoreformmethod::LINEARIZATION¶: A reformulation via linearization is applied.

Miqcqoreformmethod::EIGEN_VAL_METHOD¶: The eigenvalue method is applied.

Miqcqoreformmethod::DIAG_SDP¶: A perturbation of matrix diagonals via the solution of SDPs is applied.

Miqcqoreformmethod::RELAX_SDP¶: A Reformulation based on the solution of an SDP-relaxation of the problem is applied.

Miodatapermmethod¶

Specifies the problem data permutation method for mixed-integer problems.

Miodatapermmethod::NONE¶: No problem data permutation is applied.

Miodatapermmethod::CYCLIC_SHIFT¶: A random cyclic shift is applied to permute the problem data.

Miodatapermmethod::RANDOM¶: A random permutation is applied to the problem data.

Miocontsoltype¶

Continuous mixed-integer solution type

Miocontsoltype::NONE¶: No interior-point or basic solution are reported when the mixed-integer optimizer is used.

Miocontsoltype::ROOT¶: The reported interior-point and basic solutions are a solution to the root node problem when mixed-integer optimizer is used.

Miocontsoltype::ITG¶: The reported interior-point and basic solutions are a solution to the problem with all integer variables fixed at the value they have in the integer solution. A solution is only reported in case the problem has a primal feasible solution.

Miocontsoltype::ITG_REL¶: In case the problem is primal feasible then the reported interior-point and basic solutions are a solution to the problem with all integer variables fixed at the value they have in the integer solution. If the problem is primal infeasible, then the solution to the root node problem is reported.

Miomode¶

Integer restrictions

Miomode::IGNORED¶: The integer constraints are ignored and the problem is solved as a continuous problem.

Miomode::SATISFIED¶: Integer restrictions should be satisfied.

Mionodeseltype¶

Mixed-integer node selection types

Mionodeseltype::FREE¶: The optimizer decides the node selection strategy.

Mionodeseltype::FIRST¶: The optimizer employs a depth first node selection strategy.

Mionodeseltype::BEST¶: The optimizer employs a best bound node selection strategy.

Mionodeseltype::PSEUDO¶: The optimizer employs selects the node based on a pseudo cost estimate.

Miovarseltype¶

Mixed-integer variable selection types

Miovarseltype::FREE¶: The optimizer decides the variable selection strategy.

Miovarseltype::PSEUDOCOST¶: The optimizer employs pseudocost variable selection.

Miovarseltype::STRONG¶: The optimizer employs strong branching varfiable selection

Mpsformat¶

MPS file format type

Mpsformat::STRICT¶: It is assumed that the input file satisfies the MPS format strictly.

Mpsformat::RELAXED¶: It is assumed that the input file satisfies a slightly relaxed version of the MPS format.

Mpsformat::FREE¶: It is assumed that the input file satisfies the free MPS format. This implies that spaces are not allowed in names. Otherwise the format is free.

Mpsformat::CPLEX¶: The CPLEX compatible version of the MPS format is employed.

Objsense¶

Objective sense types

Objsense::MINIMIZE¶: The problem should be minimized.

Objsense::MAXIMIZE¶: The problem should be maximized.

Onoffkey¶

On/off

Onoffkey::ON¶: Switch the option on.

Onoffkey::OFF¶: Switch the option off.

Optimizertype¶

Optimizer types

Optimizertype::CONIC¶: The optimizer for problems having conic constraints.

Optimizertype::DUAL_SIMPLEX¶: The dual simplex optimizer is used.

Optimizertype::FREE¶: The optimizer is chosen automatically.

Optimizertype::FREE_SIMPLEX¶: One of the simplex optimizers is used.

Optimizertype::INTPNT¶: The interior-point optimizer is used.

Optimizertype::MIXED_INT¶: The mixed-integer optimizer.

Optimizertype::NEW_DUAL_SIMPLEX¶: The new dual simplex optimizer is used.

Optimizertype::NEW_PRIMAL_SIMPLEX¶: The new primal simplex optimizer is used. It is not recommended to use this option.

Optimizertype::PRIMAL_SIMPLEX¶: The primal simplex optimizer is used.

Orderingtype¶

Ordering strategies

Orderingtype::FREE¶: The ordering method is chosen automatically.

Orderingtype::APPMINLOC¶: Approximate minimum local fill-in ordering is employed.

Orderingtype::EXPERIMENTAL¶: This option should not be used.

Orderingtype::TRY_GRAPHPAR¶: Always try the graph partitioning based ordering.

Orderingtype::FORCE_GRAPHPAR¶: Always use the graph partitioning based ordering even if it is worse than the approximate minimum local fill ordering.

Orderingtype::NONE¶: No ordering is used. Note using this value almost always leads to a significantly slow down.

Presolvemode¶

Presolve method.

Presolvemode::OFF¶: The problem is not presolved before it is optimized.

Presolvemode::ON¶: The problem is presolved before it is optimized.

Presolvemode::FREE¶: It is decided automatically whether to presolve before the problem is optimized.

Foldingmode¶

Method of folding (symmetry detection for continuous problems).

Foldingmode::OFF¶: Disabled.

Foldingmode::FREE¶: The solver decides on the usage and amount of folding.

Foldingmode::FREE_UNLESS_BASIC¶: If only the interior-point solution is requested then the solver decides; if the basic solution is requested then folding is disabled.

Foldingmode::FORCE¶: Full folding is always performed regardless of workload.

Parametertype¶

Parameter type

Parametertype::INVALID_TYPE¶: Not a valid parameter.

Parametertype::DOU_TYPE¶: Is a double parameter.

Parametertype::INT_TYPE¶: Is an integer parameter.

Parametertype::STR_TYPE¶: Is a string parameter.

Problemitem¶

Problem data items

Problemitem::VAR¶: Item is a variable.

Problemitem::CON¶: Item is a constraint.

Problemitem::CONE¶: Item is a cone.

Problemtype¶

Problem types

Problemtype::LO¶: The problem is a linear optimization problem.

Problemtype::QO¶: The problem is a quadratic optimization problem.

Problemtype::QCQO¶: The problem is a quadratically constrained optimization problem.

Problemtype::CONIC¶: A conic optimization.

Problemtype::MIXED¶: General nonlinear constraints and conic constraints. This combination can not be solved by MOSEK.

Prosta¶

Problem status keys

Prosta::UNKNOWN¶: Unknown problem status.

Prosta::PRIM_AND_DUAL_FEAS¶: The problem is primal and dual feasible.

Prosta::PRIM_FEAS¶: The problem is primal feasible.

Prosta::DUAL_FEAS¶: The problem is dual feasible.

Prosta::PRIM_INFEAS¶: The problem is primal infeasible.

Prosta::DUAL_INFEAS¶: The problem is dual infeasible.

Prosta::PRIM_AND_DUAL_INFEAS¶: The problem is primal and dual infeasible.

Prosta::ILL_POSED¶: The problem is ill-posed. For example, it may be primal and dual feasible but have a positive duality gap.

Prosta::PRIM_INFEAS_OR_UNBOUNDED¶: The problem is either primal infeasible or unbounded. This may occur for mixed-integer problems.

Rescodetype¶

Response code type

Rescodetype::OK¶: The response code is OK.

Rescodetype::WRN¶: The response code is a warning.

Rescodetype::TRM¶: The response code is an optimizer termination status.

Rescodetype::ERR¶: The response code is an error.

Rescodetype::UNK¶: The response code does not belong to any class.

Scalingtype¶

Scaling type

Scalingtype::FREE¶: The optimizer chooses the scaling heuristic.

Scalingtype::NONE¶: No scaling is performed.

Scalingmethod¶

Scaling method

Scalingmethod::POW2¶: Scales only with power of 2 leaving the mantissa untouched.

Scalingmethod::FREE¶: The optimizer chooses the scaling heuristic.

Sensitivitytype¶

Sensitivity types

Sensitivitytype::BASIS¶: Basis sensitivity analysis is performed.

Simseltype¶

Simplex selection strategy

Simseltype::FREE¶: The optimizer chooses the pricing strategy.

Simseltype::FULL¶: The optimizer uses full pricing.

Simseltype::ASE¶: The optimizer uses approximate steepest-edge pricing.

Simseltype::DEVEX¶: The optimizer uses devex steepest-edge pricing (or if it is not available an approximate steep-edge selection).

Simseltype::SE¶: The optimizer uses steepest-edge selection (or if it is not available an approximate steep-edge selection).

Simseltype::PARTIAL¶: The optimizer uses a partial selection approach. The approach is usually beneficial if the number of variables is much larger than the number of constraints.

Solitem¶

Solution items

Solitem::XC¶: Solution for the constraints.

Solitem::XX¶: Variable solution.

Solitem::Y¶: Lagrange multipliers for equations.

Solitem::SLC¶: Lagrange multipliers for lower bounds on the constraints.

Solitem::SUC¶: Lagrange multipliers for upper bounds on the constraints.

Solitem::SLX¶: Lagrange multipliers for lower bounds on the variables.

Solitem::SUX¶: Lagrange multipliers for upper bounds on the variables.

Solitem::SNX¶: Lagrange multipliers corresponding to the conic constraints on the variables.

Solsta¶

Solution status keys

Solsta::UNKNOWN¶: Status of the solution is unknown.

Solsta::OPTIMAL¶: The solution is optimal.

Solsta::PRIM_FEAS¶: The solution is primal feasible.

Solsta::DUAL_FEAS¶: The solution is dual feasible.

Solsta::PRIM_AND_DUAL_FEAS¶: The solution is both primal and dual feasible.

Solsta::PRIM_INFEAS_CER¶: The solution is a certificate of primal infeasibility.

Solsta::DUAL_INFEAS_CER¶: The solution is a certificate of dual infeasibility.

Solsta::PRIM_ILLPOSED_CER¶: The solution is a certificate that the primal problem is illposed.

Solsta::DUAL_ILLPOSED_CER¶: The solution is a certificate that the dual problem is illposed.

Solsta::INTEGER_OPTIMAL¶: The primal solution is integer optimal.

Soltype¶

Solution types

Soltype::BAS¶: The basic solution.

Soltype::ITR¶: The interior solution.

Soltype::ITG¶: The integer solution.

Solveform¶

Solve primal or dual form

Solveform::FREE¶: The optimizer is free to solve either the primal or the dual problem.

Solveform::PRIMAL¶: The optimizer should solve the primal problem.

Solveform::DUAL¶: The optimizer should solve the dual problem.

Stakey¶

Status keys

Stakey::UNK¶: The status for the constraint or variable is unknown.

Stakey::BAS¶: The constraint or variable is in the basis.

Stakey::SUPBAS¶: The constraint or variable is super basic.

Stakey::LOW¶: The constraint or variable is at its lower bound.

Stakey::UPR¶: The constraint or variable is at its upper bound.

Stakey::FIX¶: The constraint or variable is fixed.

Stakey::INF¶: The constraint or variable is infeasible in the bounds.

Startpointtype¶

Starting point types

Startpointtype::FREE¶: The starting point is chosen automatically.

Startpointtype::GUESS¶: The optimizer guesses a starting point.

Startpointtype::CONSTANT¶: The optimizer constructs a starting point by assigning a constant value to all primal and dual variables. This starting point is normally robust.

Streamtype¶

Stream types

Streamtype::LOG¶: Log stream. Contains the aggregated contents of all other streams. This means that a message written to any other stream will also be written to this stream.

Streamtype::MSG¶: Message stream. Log information relating to performance and progress of the optimization is written to this stream.

Streamtype::ERR¶: Error stream. Error messages are written to this stream.

Streamtype::WRN¶: Warning stream. Warning messages are written to this stream.

Value¶

Integer values

Value::MAX_STR_LEN¶: Maximum string length allowed in MOSEK.

Value::LICENSE_BUFFER_LENGTH¶: The length of a license key buffer.

Variabletype¶

Variable types

Variabletype::TYPE_CONT¶: Is a continuous variable.

Variabletype::TYPE_INT¶: Is an integer variable.

15.8 Enumerations¶

Table of Contents

Download PDF

Modeling Cookbook

Cheatsheet