14.6 Constants¶
14.6.1 Language selection constants¶

"eng"
¶ English language selection

"dan"
¶ Danish language selection
14.6.2 Constraint or variable access modes. All functions using this enum are deprecated. Use separate functions for rows/columns instead.¶

"var"
¶ Access data by columns (variable oriented)

"con"
¶ Access data by rows (constraint oriented)
14.6.3 Basis identification¶

"never"
¶ Never do basis identification.

"always"
¶ Basis identification is always performed even if the interiorpoint optimizer terminates abnormally.

"noError"
¶ Basis identification is performed if the interiorpoint optimizer terminates without an error.

"ifFeasible"
¶ Basis identification is not performed if the interiorpoint optimizer terminates with a problem status saying that the problem is primal or dual infeasible.

"reservered"
¶ Not currently in use.
14.6.4 Bound keys¶

"lo"
¶ The constraint or variable has a finite lower bound and an infinite upper bound.

"up"
¶ The constraint or variable has an infinite lower bound and an finite upper bound.

"fx"
¶ The constraint or variable is fixed.

"fr"
¶ The constraint or variable is free.

"ra"
¶ The constraint or variable is ranged.
14.6.5 Mark¶

"lo"
¶ The lower bound is selected for sensitivity analysis.

"up"
¶ The upper bound is selected for sensitivity analysis.
14.6.6 Degeneracy strategies¶

"none"
¶ The simplex optimizer should use no degeneration strategy.

"free"
¶ The simplex optimizer chooses the degeneration strategy.

"aggressive"
¶ The simplex optimizer should use an aggressive degeneration strategy.

"moderate"
¶ The simplex optimizer should use a moderate degeneration strategy.

"minimum"
¶ The simplex optimizer should use a minimum degeneration strategy.
14.6.9 Problem reformulation.¶

"on"
¶ Allow the simplex optimizer to reformulate the problem.

"off"
¶ Disallow the simplex optimizer to reformulate the problem.

"free"
¶ The simplex optimizer can choose freely.

"aggressive"
¶ The simplex optimizer should use an aggressive reformulation strategy.
14.6.10 Exploit duplicate columns.¶

"on"
¶ Allow the simplex optimizer to exploit duplicated columns.

"off"
¶ Disallow the simplex optimizer to exploit duplicated columns.

"free"
¶ The simplex optimizer can choose freely.
14.6.11 Hotstart type employed by the simplex optimizer¶

"none"
¶ The simplex optimizer performs a coldstart.

"free"
¶ The simplex optimize chooses the hotstart type.

"statusKeys"
¶ Only the status keys of the constraints and variables are used to choose the type of hotstart.
14.6.12 Hotstart type employed by the interiorpoint optimizers.¶

"none"
¶ The interiorpoint optimizer performs a coldstart.

"primal"
¶ The interiorpoint optimizer exploits the primal solution only.

"dual"
¶ The interiorpoint optimizer exploits the dual solution only.

"primalDual"
¶ The interiorpoint optimizer exploits both the primal and dual solution.
14.6.13 Progress callback codes¶

"beginBi"
¶ The basis identification procedure has been started.

"beginConic"
¶ The callback function is called when the conic optimizer is started.

"beginDualBi"
¶ The callback function is called from within the basis identification procedure when the dual phase is started.

"beginDualSensitivity"
¶ Dual sensitivity analysis is started.

"beginDualSetupBi"
¶ The callback function is called when the dual BI phase is started.

"beginDualSimplex"
¶ The callback function is called when the dual simplex optimizer started.

"beginDualSimplexBi"
¶ The callback function is called from within the basis identification procedure when the dual simplex cleanup phase is started.

"beginFullConvexityCheck"
¶ Begin full convexity check.

"beginInfeasAna"
¶ The callback function is called when the infeasibility analyzer is started.

"beginIntpnt"
¶ The callback function is called when the interiorpoint optimizer is started.

"beginLicenseWait"
¶ Begin waiting for license.

"beginMio"
¶ The callback function is called when the mixedinteger optimizer is started.

"beginOptimizer"
¶ The callback function is called when the optimizer is started.

"beginPresolve"
¶ The callback function is called when the presolve is started.

"beginPrimalBi"
¶ The callback function is called from within the basis identification procedure when the primal phase is started.

"beginPrimalRepair"
¶ Begin primal feasibility repair.

"beginPrimalSensitivity"
¶ Primal sensitivity analysis is started.

"beginPrimalSetupBi"
¶ The callback function is called when the primal BI setup is started.

"beginPrimalSimplex"
¶ The callback function is called when the primal simplex optimizer is started.

"beginPrimalSimplexBi"
¶ The callback function is called from within the basis identification procedure when the primal simplex cleanup phase is started.

"beginQcqoReformulate"
¶ Begin QCQO reformulation.

"beginRead"
¶ MOSEK has started reading a problem file.

"beginRootCutgen"
¶ The callback function is called when root cut generation is started.

"beginSimplex"
¶ The callback function is called when the simplex optimizer is started.

"beginSimplexBi"
¶ The callback function is called from within the basis identification procedure when the simplex cleanup phase is started.

"beginToConic"
¶ Begin conic reformulation.

"beginWrite"
¶ MOSEK has started writing a problem file.

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

"dualSimplex"
¶ The callback function is called from within the dual simplex optimizer.

"endBi"
¶ The callback function is called when the basis identification procedure is terminated.

"endConic"
¶ The callback function is called when the conic optimizer is terminated.

"endDualBi"
¶ The callback function is called from within the basis identification procedure when the dual phase is terminated.

"endDualSensitivity"
¶ Dual sensitivity analysis is terminated.

"endDualSetupBi"
¶ The callback function is called when the dual BI phase is terminated.

"endDualSimplex"
¶ The callback function is called when the dual simplex optimizer is terminated.

"endDualSimplexBi"
¶ The callback function is called from within the basis identification procedure when the dual cleanup phase is terminated.

"endFullConvexityCheck"
¶ End full convexity check.

"endInfeasAna"
¶ The callback function is called when the infeasibility analyzer is terminated.

"endIntpnt"
¶ The callback function is called when the interiorpoint optimizer is terminated.

"endLicenseWait"
¶ End waiting for license.

"endMio"
¶ The callback function is called when the mixedinteger optimizer is terminated.

"endOptimizer"
¶ The callback function is called when the optimizer is terminated.

"endPresolve"
¶ The callback function is called when the presolve is completed.

"endPrimalBi"
¶ The callback function is called from within the basis identification procedure when the primal phase is terminated.

"endPrimalRepair"
¶ End primal feasibility repair.

"endPrimalSensitivity"
¶ Primal sensitivity analysis is terminated.

"endPrimalSetupBi"
¶ The callback function is called when the primal BI setup is terminated.

"endPrimalSimplex"
¶ The callback function is called when the primal simplex optimizer is terminated.

"endPrimalSimplexBi"
¶ The callback function is called from within the basis identification procedure when the primal cleanup phase is terminated.

"endQcqoReformulate"
¶ End QCQO reformulation.

"endRead"
¶ MOSEK has finished reading a problem file.

"endRootCutgen"
¶ The callback function is called when root cut generation is is terminated.

"endSimplex"
¶ The callback function is called when the simplex optimizer is terminated.

"endSimplexBi"
¶ The callback function is called from within the basis identification procedure when the simplex cleanup phase is terminated.

"endToConic"
¶ End conic reformulation.

"endWrite"
¶ MOSEK has finished writing a problem file.

"imBi"
¶ The callback function is called from within the basis identification procedure at an intermediate point.

"imConic"
¶ The callback function is called at an intermediate stage within the conic optimizer where the information database has not been updated.

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

"imDualSensivity"
¶ The callback function is called at an intermediate stage of the dual sensitivity analysis.

"imDualSimplex"
¶ The callback function is called at an intermediate point in the dual simplex optimizer.

"imFullConvexityCheck"
¶ The callback function is called at an intermediate stage of the full convexity check.

"imIntpnt"
¶ The callback function is called at an intermediate stage within the interiorpoint optimizer where the information database has not been updated.

"imLicenseWait"
¶ MOSEK is waiting for a license.

"imLu"
¶ The callback function is called from within the LU factorization procedure at an intermediate point.

"imMio"
¶ The callback function is called at an intermediate point in the mixedinteger optimizer.

"imMioDualSimplex"
¶ The callback function is called at an intermediate point in the mixedinteger optimizer while running the dual simplex optimizer.

"imMioIntpnt"
¶ The callback function is called at an intermediate point in the mixedinteger optimizer while running the interiorpoint optimizer.

"imMioPrimalSimplex"
¶ The callback function is called at an intermediate point in the mixedinteger optimizer while running the primal simplex optimizer.

"imOrder"
¶ The callback function is called from within the matrix ordering procedure at an intermediate point.

"imPresolve"
¶ The callback function is called from within the presolve procedure at an intermediate stage.

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

"imPrimalSensivity"
¶ The callback function is called at an intermediate stage of the primal sensitivity analysis.

"imPrimalSimplex"
¶ The callback function is called at an intermediate point in the primal simplex optimizer.

"imQoReformulate"
¶ The callback function is called at an intermediate stage of the conic quadratic reformulation.

"imRead"
¶ Intermediate stage in reading.

"imRootCutgen"
¶ The callback is called from within root cut generation at an intermediate stage.

"imSimplex"
¶ The callback function is called from within the simplex optimizer at an intermediate point.

"imSimplexBi"
¶ The callback function is called from within the basis identification procedure at an intermediate point in the simplex cleanup phase. The frequency of the callbacks is controlled by the
logSimFreq
parameter.

"intpnt"
¶ The callback function is called from within the interiorpoint optimizer after the information database has been updated.

"newIntMio"
¶ The callback function is called after a new integer solution has been located by the mixedinteger optimizer.

"primalSimplex"
¶ The callback function is called from within the primal simplex optimizer.

"readOpf"
¶ The callback function is called from the OPF reader.

"readOpfSection"
¶ A chunk of \(Q\) nonzeros has been read from a problem file.

"solvingRemote"
¶ The callback function is called while the task is being solved on a remote server.

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

"updateDualSimplex"
¶ The callback function is called in the dual simplex optimizer.

"updateDualSimplexBi"
¶ The callback function is called from within the basis identification procedure at an intermediate point in the dual simplex cleanup phase. The frequency of the callbacks is controlled by the
logSimFreq
parameter.

"updatePresolve"
¶ The callback function is called from within the presolve procedure.

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

"updatePrimalSimplex"
¶ The callback function is called in the primal simplex optimizer.

"updatePrimalSimplexBi"
¶ The callback function is called from within the basis identification procedure at an intermediate point in the primal simplex cleanup phase. The frequency of the callbacks is controlled by the
logSimFreq
parameter.

"writeOpf"
¶ The callback function is called from the OPF writer.
14.6.14 Types of convexity checks.¶

"none"
¶ No convexity check.

"simple"
¶ Perform simple and fast convexity check.

"full"
¶ Perform a full convexity check.
14.6.15 Compression types¶

"none"
¶ No compression is used.

"free"
¶ The type of compression used is chosen automatically.

"gzip"
¶ The type of compression used is gzip compatible.
14.6.16 Cone types¶

"quad"
¶ The cone is a quadratic cone.

"rquad"
¶ The cone is a rotated quadratic cone.
14.6.17 Name types¶

"gen"
¶ General names. However, no duplicate and blank names are allowed.

"mps"
¶ MPS type names.

"lp"
¶ LP type names.
14.6.19 Data format types¶

"extension"
¶ The file extension is used to determine the data file format.

"mps"
¶ The data file is MPS formatted.

"lp"
¶ The data file is LP formatted.

"op"
¶ The data file is an optimization problem formatted file.

"xml"
¶ The data file is an XML formatted file.

"freeMps"
¶ The data a free MPS formatted file.

"task"
¶ Generic task dump file.

"cb"
¶ Conic benchmark format,

"jsonTask"
¶ JSON based task format.
14.6.20 Double information items¶

"biCleanDualTime"
¶ Time spent within the dual cleanup optimizer of the basis identification procedure since its invocation.

"biCleanPrimalTime"
¶ Time spent within the primal cleanup optimizer of the basis identification procedure since its invocation.

"biCleanTime"
¶ Time spent within the cleanup phase of the basis identification procedure since its invocation.

"biDualTime"
¶ Time spent within the dual phase basis identification procedure since its invocation.

"biPrimalTime"
¶ Time spent within the primal phase of the basis identification procedure since its invocation.

"biTime"
¶ Time spent within the basis identification procedure since its invocation.

"intpntDualFeas"
¶ Dual feasibility measure reported by the interiorpoint optimizer. (For the interiorpoint optimizer this measure is not directly related to the original problem because a homogeneous model is employed.)

"intpntDualObj"
¶ Dual objective value reported by the interiorpoint optimizer.

"intpntFactorNumFlops"
¶ An estimate of the number of flops used in the factorization.

"intpntOptStatus"
¶ A measure of optimality of the solution. It should converge to \(+1\) if the problem has a primaldual 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 illposed.

"intpntOrderTime"
¶ Order time (in seconds).

"intpntPrimalFeas"
¶ Primal feasibility measure reported by the interiorpoint optimizer. (For the interiorpoint optimizer this measure is not directly related to the original problem because a homogeneous model is employed).

"intpntPrimalObj"
¶ Primal objective value reported by the interiorpoint optimizer.

"intpntTime"
¶ Time spent within the interiorpoint optimizer since its invocation.

"mioCliqueSeparationTime"
¶ Seperation time for clique cuts.

"mioCmirSeparationTime"
¶ Seperation time for CMIR cuts.

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

"mioDualBoundAfterPresolve"
¶ Value of the dual bound after presolve but before cut generation.

"mioGmiSeparationTime"
¶ Seperation time for GMI cuts.

"mioHeuristicTime"
¶ Total time spent in the optimizer.

"mioImpliedBoundTime"
¶ Seperation time for implied bound cuts.

"mioKnapsackCoverSeparationTime"
¶ Seperation time for knapsack cover.

"mioObjAbsGap"
¶ Given the mixedinteger 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.

"mioObjBound"
¶ 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
"mioNumRelax"
is strictly positive.

"mioObjInt"
¶ 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
"mioNumIntSolutions"
.

"mioObjRelGap"
¶ Given that the mixedinteger 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
mioRelGapConst
. Otherwise it has the value \(1.0\).

"mioOptimizerTime"
¶ Total time spent in the optimizer.

"mioProbingTime"
¶ Total time for probing.

"mioRootCutgenTime"
¶ Total time for cut generation.

"mioRootOptimizerTime"
¶ Time spent in the optimizer while solving the root relaxation.

"mioRootPresolveTime"
¶ Time spent in while presolving the root relaxation.

"mioTime"
¶ Time spent in the mixedinteger optimizer.

"mioUserObjCut"
¶ If the objective cut is used, then this information item has the value of the cut.

"optimizerTime"
¶ Total time spent in the optimizer since it was invoked.

"presolveEliTime"
¶ Total time spent in the eliminator since the presolve was invoked.

"presolveLindepTime"
¶ Total time spent in the linear dependency checker since the presolve was invoked.

"presolveTime"
¶ Total time (in seconds) spent in the presolve since it was invoked.

"primalRepairPenaltyObj"
¶ The optimal objective value of the penalty function.

"qcqoReformulateMaxPerturbation"
¶ Maximum absolute diagonal perturbation occuring during the QCQO reformulation.

"qcqoReformulateTime"
¶ Time spent with conic quadratic reformulation.

"qcqoReformulateWorstCholeskyColumnScaling"
¶ Worst Cholesky column scaling.

"qcqoReformulateWorstCholeskyDiagScaling"
¶ Worst Cholesky diagonal scaling.

"rdTime"
¶ Time spent reading the data file.

"simDualTime"
¶ Time spent in the dual simplex optimizer since invoking it.

"simFeas"
¶ Feasibility measure reported by the simplex optimizer.

"simObj"
¶ Objective value reported by the simplex optimizer.

"simPrimalTime"
¶ Time spent in the primal simplex optimizer since invoking it.

"simTime"
¶ Time spent in the simplex optimizer since invoking it.

"solBasDualObj"
¶ Dual objective value of the basic solution.

"solBasDviolcon"
¶ Maximal dual bound violation for \(x^c\) in the basic solution.

"solBasDviolvar"
¶ Maximal dual bound violation for \(x^x\) in the basic solution.

"solBasNrmBarx"
¶ Infinity norm of \(\barX\) in the basic solution.

"solBasNrmSlc"
¶ Infinity norm of \(s_l^c\) in the basic solution.

"solBasNrmSlx"
¶ Infinity norm of \(s_l^x\) in the basic solution.

"solBasNrmSuc"
¶ Infinity norm of \(s_u^c\) in the basic solution.

"solBasNrmSux"
¶ Infinity norm of \(s_u^X\) in the basic solution.

"solBasNrmXc"
¶ Infinity norm of \(x^c\) in the basic solution.

"solBasNrmXx"
¶ Infinity norm of \(x^x\) in the basic solution.

"solBasNrmY"
¶ Infinity norm of \(y\) in the basic solution.

"solBasPrimalObj"
¶ Primal objective value of the basic solution.

"solBasPviolcon"
¶ Maximal primal bound violation for \(x^c\) in the basic solution.

"solBasPviolvar"
¶ Maximal primal bound violation for \(x^x\) in the basic solution.

"solItgNrmBarx"
¶ Infinity norm of \(\barX\) in the integer solution.

"solItgNrmXc"
¶ Infinity norm of \(x^c\) in the integer solution.

"solItgNrmXx"
¶ Infinity norm of \(x^x\) in the integer solution.

"solItgPrimalObj"
¶ Primal objective value of the integer solution.

"solItgPviolbarvar"
¶ Maximal primal bound violation for \(\barX\) in the integer solution.

"solItgPviolcon"
¶ Maximal primal bound violation for \(x^c\) in the integer solution.

"solItgPviolcones"
¶ Maximal primal violation for primal conic constraints in the integer solution.

"solItgPviolitg"
¶ Maximal violation for the integer constraints in the integer solution.

"solItgPviolvar"
¶ Maximal primal bound violation for \(x^x\) in the integer solution.

"solItrDualObj"
¶ Dual objective value of the interiorpoint solution.

"solItrDviolbarvar"
¶ Maximal dual bound violation for \(\barX\) in the interiorpoint solution.

"solItrDviolcon"
¶ Maximal dual bound violation for \(x^c\) in the interiorpoint solution.

"solItrDviolcones"
¶ Maximal dual violation for dual conic constraints in the interiorpoint solution.

"solItrDviolvar"
¶ Maximal dual bound violation for \(x^x\) in the interiorpoint solution.

"solItrNrmBars"
¶ Infinity norm of \(\barS\) in the interiorpoint solution.

"solItrNrmBarx"
¶ Infinity norm of \(\barX\) in the interiorpoint solution.

"solItrNrmSlc"
¶ Infinity norm of \(s_l^c\) in the interiorpoint solution.

"solItrNrmSlx"
¶ Infinity norm of \(s_l^x\) in the interiorpoint solution.

"solItrNrmSnx"
¶ Infinity norm of \(s_n^x\) in the interiorpoint solution.

"solItrNrmSuc"
¶ Infinity norm of \(s_u^c\) in the interiorpoint solution.

"solItrNrmSux"
¶ Infinity norm of \(s_u^X\) in the interiorpoint solution.

"solItrNrmXc"
¶ Infinity norm of \(x^c\) in the interiorpoint solution.

"solItrNrmXx"
¶ Infinity norm of \(x^x\) in the interiorpoint solution.

"solItrNrmY"
¶ Infinity norm of \(y\) in the interiorpoint solution.

"solItrPrimalObj"
¶ Primal objective value of the interiorpoint solution.

"solItrPviolbarvar"
¶ Maximal primal bound violation for \(\barX\) in the interiorpoint solution.

"solItrPviolcon"
¶ Maximal primal bound violation for \(x^c\) in the interiorpoint solution.

"solItrPviolcones"
¶ Maximal primal violation for primal conic constraints in the interiorpoint solution.

"solItrPviolvar"
¶ Maximal primal bound violation for \(x^x\) in the interiorpoint solution.

"toConicTime"
¶ Time spent in the last to conic reformulation.
14.6.22 Long integer information items.¶

"biCleanDualDegIter"
¶ Number of dual degenerate clean iterations performed in the basis identification.

"biCleanDualIter"
¶ Number of dual clean iterations performed in the basis identification.

"biCleanPrimalDegIter"
¶ Number of primal degenerate clean iterations performed in the basis identification.

"biCleanPrimalIter"
¶ Number of primal clean iterations performed in the basis identification.

"biDualIter"
¶ Number of dual pivots performed in the basis identification.

"biPrimalIter"
¶ Number of primal pivots performed in the basis identification.

"intpntFactorNumNz"
¶ Number of nonzeros in factorization.

"mioIntpntIter"
¶ Number of interiorpoint iterations performed by the mixedinteger optimizer.

"mioPresolvedAnz"
¶ Number of nonzero entries in the constraint matrix of presolved problem.

"mioSimMaxiterSetbacks"
¶ Number of times the the simplex optimizer has hit the maximum iteration limit when reoptimizing.

"mioSimplexIter"
¶ Number of simplex iterations performed by the mixedinteger optimizer.

"rdNumanz"
¶ Number of nonzeros in A that is read.

"rdNumqnz"
¶ Number of Q nonzeros.
14.6.23 Integer information items.¶

"anaProNumCon"
¶ Number of constraints in the problem.

"anaProNumConEq"
¶ Number of equality constraints.

"anaProNumConFr"
¶ Number of unbounded constraints.

"anaProNumConLo"
¶ Number of constraints with a lower bound and an infinite upper bound.

"anaProNumConRa"
¶ Number of constraints with finite lower and upper bounds.

"anaProNumConUp"
¶ Number of constraints with an upper bound and an infinite lower bound.

"anaProNumVar"
¶ Number of variables in the problem.

"anaProNumVarBin"
¶ Number of binary (01) variables.

"anaProNumVarCont"
¶ Number of continuous variables.

"anaProNumVarEq"
¶ Number of fixed variables.

"anaProNumVarFr"
¶ Number of free variables.

"anaProNumVarInt"
¶ Number of general integer variables.

"anaProNumVarLo"
¶ Number of variables with a lower bound and an infinite upper bound.

"anaProNumVarRa"
¶ Number of variables with finite lower and upper bounds.

"anaProNumVarUp"
¶ Number of variables with an upper bound and an infinite lower bound. This value is set by

"intpntFactorDimDense"
¶ Dimension of the dense sub system in factorization.

"intpntIter"
¶ Number of interiorpoint iterations since invoking the interiorpoint optimizer.

"intpntNumThreads"
¶ Number of threads that the interiorpoint optimizer is using.

"intpntSolveDual"
¶ Nonzero if the interiorpoint optimizer is solving the dual problem.

"mioAbsgapSatisfied"
¶ Nonzero if absolute gap is within tolerances.

"mioCliqueTableSize"
¶ Size of the clique table.

"mioConstructNumRoundings"
¶ Number of values in the integer solution that is rounded to an integer value.

"mioConstructSolution"
¶ If this item has the value 0, then MOSEK did not try to construct an initial integer feasible solution. If the item has a positive value, then MOSEK successfully constructed an initial integer feasible solution.

"mioInitialSolution"
¶ Is nonzero if an initial integer solution is specified.

"mioNearAbsgapSatisfied"
¶ Nonzero if absolute gap is within relaxed tolerances.

"mioNearRelgapSatisfied"
¶ Nonzero if relative gap is within relaxed tolerances.

"mioNodeDepth"
¶ Depth of the last node solved.

"mioNumActiveNodes"
¶ Number of active branch bound nodes.

"mioNumBranch"
¶ Number of branches performed during the optimization.

"mioNumCliqueCuts"
¶ Number of clique cuts.

"mioNumCmirCuts"
¶ Number of Complemented Mixed Integer Rounding (CMIR) cuts.

"mioNumGomoryCuts"
¶ Number of Gomory cuts.

"mioNumImpliedBoundCuts"
¶ Number of implied bound cuts.

"mioNumIntSolutions"
¶ Number of integer feasible solutions that has been found.

"mioNumKnapsackCoverCuts"
¶ Number of clique cuts.

"mioNumRelax"
¶ Number of relaxations solved during the optimization.

"mioNumRepeatedPresolve"
¶ Number of times presolve was repeated at root.

"mioNumcon"
¶ Number of constraints in the problem solved by the mixedinteger optimizer.

"mioNumint"
¶ Number of integer variables in the problem solved be the mixedinteger optimizer.

"mioNumvar"
¶ Number of variables in the problem solved by the mixedinteger optimizer.

"mioObjBoundDefined"
¶ Nonzero if a valid objective bound has been found, otherwise zero.

"mioPresolvedNumbin"
¶ Number of binary variables in the problem solved be the mixedinteger optimizer.

"mioPresolvedNumcon"
¶ Number of constraints in the presolved problem.

"mioPresolvedNumcont"
¶ Number of continuous variables in the problem solved be the mixedinteger optimizer.

"mioPresolvedNumint"
¶ Number of integer variables in the presolved problem.

"mioPresolvedNumvar"
¶ Number of variables in the presolved problem.

"mioRelgapSatisfied"
¶ Nonzero if relative gap is within tolerances.

"mioTotalNumCuts"
¶ Total number of cuts generated by the mixedinteger optimizer.

"mioUserObjCut"
¶ If it is nonzero, then the objective cut is used.

"optNumcon"
¶ Number of constraints in the problem solved when the optimizer is called.

"optNumvar"
¶ Number of variables in the problem solved when the optimizer is called

"optimizeResponse"
¶ The response code returned by optimize.

"rdNumbarvar"
¶ Number of variables read.

"rdNumcon"
¶ Number of constraints read.

"rdNumcone"
¶ Number of conic constraints read.

"rdNumintvar"
¶ Number of integerconstrained variables read.

"rdNumq"
¶ Number of nonempty Q matrices read.

"rdNumvar"
¶ Number of variables read.

"rdProtype"
¶ Problem type.

"simDualDegIter"
¶ The number of dual degenerate iterations.

"simDualHotstart"
¶ If 1 then the dual simplex algorithm is solving from an advanced basis.

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

"simDualInfIter"
¶ The number of iterations taken with dual infeasibility.

"simDualIter"
¶ Number of dual simplex iterations during the last optimization.

"simNumcon"
¶ Number of constraints in the problem solved by the simplex optimizer.

"simNumvar"
¶ Number of variables in the problem solved by the simplex optimizer.

"simPrimalDegIter"
¶ The number of primal degenerate iterations.

"simPrimalHotstart"
¶ If 1 then the primal simplex algorithm is solving from an advanced basis.

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

"simPrimalInfIter"
¶ The number of iterations taken with primal infeasibility.

"simPrimalIter"
¶ Number of primal simplex iterations during the last optimization.

"simSolveDual"
¶ Is nonzero if dual problem is solved.

"solBasProsta"
¶ Problem status of the basic solution. Updated after each optimization.

"solBasSolsta"
¶ Solution status of the basic solution. Updated after each optimization.

"solItgProsta"
¶ Problem status of the integer solution. Updated after each optimization.

"solItgSolsta"
¶ Solution status of the integer solution. Updated after each optimization.

"solItrProsta"
¶ Problem status of the interiorpoint solution. Updated after each optimization.

"solItrSolsta"
¶ Solution status of the interiorpoint solution. Updated after each optimization.

"stoNumARealloc"
¶ Number of times the storage for storing \(A\) has been changed. A large value may indicates that memory fragmentation may occur.
14.6.24 Information item types¶

"douType"
¶ Is a double information type.

"intType"
¶ Is an integer.

"lintType"
¶ Is a long integer.
14.6.25 Input/output modes¶

"read"
¶ The file is readonly.

"write"
¶ The file is writeonly. If the file exists then it is truncated when it is opened. Otherwise it is created when it is opened.

"readwrite"
¶ The file is to read and written.
14.6.26 Specifies the branching direction.¶

"free"
¶ The mixedinteger optimizer decides which branch to choose.

"up"
¶ The mixedinteger optimizer always chooses the up branch first.

"down"
¶ The mixedinteger optimizer always chooses the down branch first.

"near"
¶ Branch in direction nearest to selected fractional variable.

"far"
¶ Branch in direction farthest from selected fractional variable.

"rootLp"
¶ Chose direction based on root lp value of selected variable.

"guided"
¶ Branch in direction of current incumbent.

"pseudocost"
¶ Branch based on the pseudocost of the variable.
14.6.27 Continuous mixedinteger solution type¶

"none"
¶ No interiorpoint or basic solution are reported when the mixedinteger optimizer is used.

"root"
¶ The reported interiorpoint and basic solutions are a solution to the root node problem when mixedinteger optimizer is used.

"itg"
¶ The reported interiorpoint 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.

"itgRel"
¶ In case the problem is primal feasible then the reported interiorpoint 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.
14.6.28 Integer restrictions¶

"ignored"
¶ The integer constraints are ignored and the problem is solved as a continuous problem.

"satisfied"
¶ Integer restrictions should be satisfied.
14.6.29 Mixedinteger node selection types¶

"free"
¶ The optimizer decides the node selection strategy.

"first"
¶ The optimizer employs a depth first node selection strategy.

"best"
¶ The optimizer employs a best bound node selection strategy.

"worst"
¶ The optimizer employs a worst bound node selection strategy.

"hybrid"
¶ The optimizer employs a hybrid strategy.

"pseudo"
¶ The optimizer employs selects the node based on a pseudo cost estimate.
14.6.30 MPS file format type¶

"strict"
¶ It is assumed that the input file satisfies the MPS format strictly.

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

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

"cplex"
¶ The CPLEX compatible version of the MPS format is employed.
14.6.31 Objective sense types¶

"minimize"
¶ The problem should be minimized.

"maximize"
¶ The problem should be maximized.
14.6.33 Optimizer types¶

"conic"
¶ The optimizer for problems having conic constraints.

"dualSimplex"
¶ The dual simplex optimizer is used.

"free"
¶ The optimizer is chosen automatically.

"freeSimplex"
¶ One of the simplex optimizers is used.

"intpnt"
¶ The interiorpoint optimizer is used.

"mixedInt"
¶ The mixedinteger optimizer.

"primalSimplex"
¶ The primal simplex optimizer is used.
14.6.34 Ordering strategies¶

"free"
¶ The ordering method is chosen automatically.

"appminloc"
¶ Approximate minimum local fillin ordering is employed.

"experimental"
¶ This option should not be used.

"tryGraphpar"
¶ Always try the graph partitioning based ordering.

"forceGraphpar"
¶ Always use the graph partitioning based ordering even if it is worse than the approximate minimum local fill ordering.

"none"
¶ No ordering is used.
14.6.35 Presolve method.¶

"off"
¶ The problem is not presolved before it is optimized.

"on"
¶ The problem is presolved before it is optimized.

"free"
¶ It is decided automatically whether to presolve before the problem is optimized.
14.6.36 Parameter type¶

"invalidType"
¶ Not a valid parameter.

"douType"
¶ Is a double parameter.

"intType"
¶ Is an integer parameter.

"strType"
¶ Is a string parameter.
14.6.37 Problem data items¶

"var"
¶ Item is a variable.

"con"
¶ Item is a constraint.

"cone"
¶ Item is a cone.
14.6.38 Problem types¶

"lo"
¶ The problem is a linear optimization problem.

"qo"
¶ The problem is a quadratic optimization problem.

"qcqo"
¶ The problem is a quadratically constrained optimization problem.

"geco"
¶ General convex optimization.

"conic"
¶ A conic optimization.

"mixed"
¶ General nonlinear constraints and conic constraints. This combination can not be solved by MOSEK.
14.6.39 Problem status keys¶

"unknown"
¶ Unknown problem status.

"primAndDualFeas"
¶ The problem is primal and dual feasible.

"primFeas"
¶ The problem is primal feasible.

"dualFeas"
¶ The problem is dual feasible.

"nearPrimAndDualFeas"
¶ The problem is at least nearly primal and dual feasible.

"nearPrimFeas"
¶ The problem is at least nearly primal feasible.

"nearDualFeas"
¶ The problem is at least nearly dual feasible.

"primInfeas"
¶ The problem is primal infeasible.

"dualInfeas"
¶ The problem is dual infeasible.

"primAndDualInfeas"
¶ The problem is primal and dual infeasible.

"illPosed"
¶ The problem is illposed. For example, it may be primal and dual feasible but have a positive duality gap.

"primInfeasOrUnbounded"
¶ The problem is either primal infeasible or unbounded. This may occur for mixedinteger problems.
14.6.41 Response code type¶

"ok"
¶ The response code is OK.

"wrn"
¶ The response code is a warning.

"trm"
¶ The response code is an optimizer termination status.

"err"
¶ The response code is an error.

"unk"
¶ The response code does not belong to any class.
14.6.42 Scaling type¶

"free"
¶ The optimizer chooses the scaling heuristic.

"none"
¶ No scaling is performed.

"moderate"
¶ A conservative scaling is performed.

"aggressive"
¶ A very aggressive scaling is performed.
14.6.43 Scaling method¶

"pow2"
¶ Scales only with power of 2 leaving the mantissa untouched.

"free"
¶ The optimizer chooses the scaling heuristic.
14.6.44 Sensitivity types¶

"basis"
¶ Basis sensitivity analysis is performed.

"optimalPartition"
¶ Optimal partition sensitivity analysis is performed.
14.6.45 Simplex selection strategy¶

"free"
¶ The optimizer chooses the pricing strategy.

"full"
¶ The optimizer uses full pricing.

"ase"
¶ The optimizer uses approximate steepestedge pricing.

"devex"
¶ The optimizer uses devex steepestedge pricing (or if it is not available an approximate steepedge selection).

"se"
¶ The optimizer uses steepestedge selection (or if it is not available an approximate steepedge selection).

"partial"
¶ The optimizer uses a partial selection approach. The approach is usually beneficial if the number of variables is much larger than the number of constraints.
14.6.46 Solution items¶

"xc"
¶ Solution for the constraints.

"xx"
¶ Variable solution.

"y"
¶ Lagrange multipliers for equations.

"slc"
¶ Lagrange multipliers for lower bounds on the constraints.

"suc"
¶ Lagrange multipliers for upper bounds on the constraints.

"slx"
¶ Lagrange multipliers for lower bounds on the variables.

"sux"
¶ Lagrange multipliers for upper bounds on the variables.

"snx"
¶ Lagrange multipliers corresponding to the conic constraints on the variables.
14.6.47 Solution status keys¶

"unknown"
¶ Status of the solution is unknown.

"optimal"
¶ The solution is optimal.

"primFeas"
¶ The solution is primal feasible.

"dualFeas"
¶ The solution is dual feasible.

"primAndDualFeas"
¶ The solution is both primal and dual feasible.

"nearOptimal"
¶ The solution is nearly optimal.

"nearPrimFeas"
¶ The solution is nearly primal feasible.

"nearDualFeas"
¶ The solution is nearly dual feasible.

"nearPrimAndDualFeas"
¶ The solution is nearly both primal and dual feasible.

"primInfeasCer"
¶ The solution is a certificate of primal infeasibility.

"dualInfeasCer"
¶ The solution is a certificate of dual infeasibility.

"nearPrimInfeasCer"
¶ The solution is almost a certificate of primal infeasibility.

"nearDualInfeasCer"
¶ The solution is almost a certificate of dual infeasibility.

"primIllposedCer"
¶ The solution is a certificate that the primal problem is illposed.

"dualIllposedCer"
¶ The solution is a certificate that the dual problem is illposed.

"integerOptimal"
¶ The primal solution is integer optimal.

"nearIntegerOptimal"
¶ The primal solution is near integer optimal.
14.6.48 Solution types¶

"bas"
¶ The basic solution.

"itr"
¶ The interior solution.

"itg"
¶ The integer solution.
14.6.49 Solve primal or dual form¶

"free"
¶ The optimizer is free to solve either the primal or the dual problem.

"primal"
¶ The optimizer should solve the primal problem.

"dual"
¶ The optimizer should solve the dual problem.
14.6.50 Status keys¶

"unk"
¶ The status for the constraint or variable is unknown.

"bas"
¶ The constraint or variable is in the basis.

"supbas"
¶ The constraint or variable is super basic.

"low"
¶ The constraint or variable is at its lower bound.

"upr"
¶ The constraint or variable is at its upper bound.

"fix"
¶ The constraint or variable is fixed.

"inf"
¶ The constraint or variable is infeasible in the bounds.
14.6.51 Starting point types¶

"free"
¶ The starting point is chosen automatically.

"guess"
¶ The optimizer guesses a starting point.

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

"satisfyBounds"
¶ The starting point is chosen to satisfy all the simple bounds on nonlinear variables. If this starting point is employed, then more care than usual should employed when choosing the bounds on the nonlinear variables. In particular very tight bounds should be avoided.
14.6.52 Stream types¶

"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.

"msg"
¶ Message stream. Log information relating to performance and progress of the optimization is written to this stream.

"err"
¶ Error stream. Error messages are written to this stream.

"wrn"
¶ Warning stream. Warning messages are written to this stream.