Mosek - Computer Sciences Department
Mosek - Computer Sciences Department Mosek - Computer Sciences Department
MOSEK 12MSK IPAR SIM PRIMAL CRASHprimal simplex crashMSK IPAR SIM PRIMAL SELECTIONprimal simplex pricing selectionMSK IPAR SIM REFACTOR FREQrefactorization frequencyMSK IPAR SIM SCALINGscaling selection for simplex optimizerMSK IPAR SIM SOLVE FORMsolve primal or the dual problem with simplex optimizerMSK IPAR BI CLEAN OPTIMIZERsimplex optimizer section after basis identificationMSK DPAR BI LU TOL REL PIVrelative pivot tolerance for basis identificationMSK IPAR BI MAX ITERATIONSmaximum number of simplex iterations after basis identificationMSK IPAR BI IGNORE MAX ITERcontinues BI in case of iteration limitMSK IPAR BI IGNORE NUM ERRORcontinues BI in case of numerical error4.6 Mixed Integer Optimizer OptionsMSK IPAR MIO BRANCH DIRcontrol branching directionsMSK IPAR MIO CONSTRUCT SOLswitch for mip startMSK IPAR MIO CUT LEVEL ROOTcut level control at root for mixed integer optimizerMSK IPAR MIO HEURISTIC LEVELheuristic control for mixed integer optimizerMSK DPAR MIO HEURISTIC TIMEtime limit for heuristic searchMSK IPAR MIO KEEP BASISswitch for basis savingMSK IPAR MIO MAX NUM BRANCHESmaximum number of branchesMSK IPAR MIO MAX NUM RELAXSmaximum number of relaxations solvedMSK DPAR MIO MAX TIMEtime limit for mixed integer optimizerMSK DPAR MIO MAX TIME APRX OPTtime limit before some relaxationMSK DPAR MIO NEAR TOL ABS GAPtermination criterion on absolute optimality toleranceMSK DPAR MIO NEAR TOL REL GAPtermination criterion on relative optimality toleranceMSK IPAR MIO NODE OPTIMIZERsolver for the sub problemsMSK IPAR MIO NODE SELECTIONnode selection strategyMSK IPAR MIO PRESOLVE AGGREGATEswitch for aggregation during mixed integer presolve
MOSEK 13MSK IPAR MIO PRESOLVE USEswitch for mixed integer presolveMSK DPAR MIO REL ADD CUT LIMITEDcuts factorMSK IPAR MIO ROOT OPTIMIZERsolver for the root problemMSK IPAR MIO STRONG BRANCHstrong branching controlMSK DPAR MIO TOL ABS GAPabsolute optimality tolerance in the mixed integer optimizerMSK DPAR MIO TOL ABS RELAX INTabsolute integrality toleranceMSK DPAR MIO TOL REL GAPrelative optimality tolerance in the mixed integer optimizerMSK DPAR MIO TOL REL RELAX INTrelative integrality toleranceMSK IPAR MIO PRESOLVE PROBINGswitch for probingMSK IPAR MIO CUT LEVEL TREEcut level control in tree for mixed integer optimizer5 Detailed Descriptions of MOSEK OptionsMSK IPAR OPTIMIZER (integer)Controls which optimizer is used to optimize the task.(default = 0)0 The choice of optimizer is made automatically.1 The interior-point optimizer is used.2 Another cone optimizer.3 The Qcone optimizer is used.4 The primal simplex optimizer is used.5 The dual simplex optimizer is used.6 Either the primal or the dual simplex optimizer is used.7 The mixed integer optimizer.8 The optimizer for nonconvex nonlinear problems.9 The concurrent optimizer is used.MSK DPAR OPTIMIZER MAX TIME (real)Maximum amount of time the optimizer is allowed to spend on the optimization. A negative number meansinfinity.(default = GAMS ResLim)MSK IPAR PRESOLVE ELIMINATOR USE (integer)Controls whether free or implied free variables are eliminated from the problem.(default = 1)MSK IPAR PRESOLVE ELIM FILL (integer)Controls the maximum amount of fill-in that can be created during the eliminations phase of the presolve.This parameter times the number of variables plus the number of constraints denotes the amount of fill in.(default = 1)
- Page 2 and 3: MOSEK 2• Interior-point optimizer
- Page 4 and 5: MOSEK 41.5 Nonlinear ProgramsMOSEK
- Page 6 and 7: MOSEK 6The original problem is:∑d
- Page 8 and 9: MOSEK 8The first option specifies t
- Page 10 and 11: MOSEK 10MSK IPAR LOG BIoutput contr
- Page 14 and 15: MOSEK 14MSK IPAR PRESOLVE LINDEP US
- Page 16 and 17: MOSEK 16MSK DPAR DATA TOL QIJ (real
- Page 18 and 19: MOSEK 18MSK DPAR INTPNT CO TOL NEAR
- Page 20 and 21: MOSEK 20MSK IPAR INTPNT STARTING PO
- Page 22 and 23: MOSEK 22MSK IPAR SIM PRIMAL CRASH (
- Page 24 and 25: MOSEK 24Coefficient reduction +512G
- Page 26 and 27: MOSEK 268 The optimizer for nonconv
- Page 28 and 29: MOSEK 28Simplex - cpu time: 0.00Pri
- Page 30: MOSEK 30Presolve - time : 0.00Preso
MOSEK 12MSK IPAR SIM PRIMAL CRASHprimal simplex crashMSK IPAR SIM PRIMAL SELECTIONprimal simplex pricing selectionMSK IPAR SIM REFACTOR FREQrefactorization frequencyMSK IPAR SIM SCALINGscaling selection for simplex optimizerMSK IPAR SIM SOLVE FORMsolve primal or the dual problem with simplex optimizerMSK IPAR BI CLEAN OPTIMIZERsimplex optimizer section after basis identificationMSK DPAR BI LU TOL REL PIVrelative pivot tolerance for basis identificationMSK IPAR BI MAX ITERATIONSmaximum number of simplex iterations after basis identificationMSK IPAR BI IGNORE MAX ITERcontinues BI in case of iteration limitMSK IPAR BI IGNORE NUM ERRORcontinues BI in case of numerical error4.6 Mixed Integer Optimizer OptionsMSK IPAR MIO BRANCH DIRcontrol branching directionsMSK IPAR MIO CONSTRUCT SOLswitch for mip startMSK IPAR MIO CUT LEVEL ROOTcut level control at root for mixed integer optimizerMSK IPAR MIO HEURISTIC LEVELheuristic control for mixed integer optimizerMSK DPAR MIO HEURISTIC TIMEtime limit for heuristic searchMSK IPAR MIO KEEP BASISswitch for basis savingMSK IPAR MIO MAX NUM BRANCHESmaximum number of branchesMSK IPAR MIO MAX NUM RELAXSmaximum number of relaxations solvedMSK DPAR MIO MAX TIMEtime limit for mixed integer optimizerMSK DPAR MIO MAX TIME APRX OPTtime limit before some relaxationMSK DPAR MIO NEAR TOL ABS GAPtermination criterion on absolute optimality toleranceMSK DPAR MIO NEAR TOL REL GAPtermination criterion on relative optimality toleranceMSK IPAR MIO NODE OPTIMIZERsolver for the sub problemsMSK IPAR MIO NODE SELECTIONnode selection strategyMSK IPAR MIO PRESOLVE AGGREGATEswitch for aggregation during mixed integer presolve
Change language