12.07.2015 Views

Mosek - Computer Sciences Department

Mosek - Computer Sciences Department

Mosek - Computer Sciences Department

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

MOSEK 29Primal - objective: 1.5367500000e+02 eq. infeas.: 0.00e+00 max bound infeas.: 0.00e+00Dual - objective: 1.5367500000e+02 eq. infeas.: 0.00e+00 max bound infeas.: 0.00e+00The fields in the main MOSEK log output are:FieldITERDEGITER%FEASD/POBJTIMEDescriptionCurrent number of iterations.Current percentage of degenerate iterations.Current (primal or dual) infeasibility.Current dual or primal objectiveCurrent elapsed resource time in seconds.6.3 Log Using the Mixed Integer OptimizerBelow is a log output running the model cube.gms from the GAMS model library using the MOSEK mixed-integeroptimizer.Mixed integer optimizer started.BRANCHES RELAXS ACT_NDS BEST_INT_OBJ BEST_RELAX_OBJ REL_GAP(%) TIME0 1 0 1.6000000000e+01 0.0000000000e+00 100.00 0.10 1 0 4.0000000000e+00 0.0000000000e+00 100.00 0.1128 250 5 4.0000000000e+00 0.0000000000e+00 100.00 0.3167 502 6 4.0000000000e+00 0.0000000000e+00 100.00 0.7241 758 65 4.0000000000e+00 0.0000000000e+00 100.00 0.9200 809 83 4.0000000000e+00 1.3333333333e-01 96.67 0.9A near optimal solution satisfying the absolute gap tolerance of 3.90e+00 has been located.Objective of best integer solution : 4.00000000e+00Number of branches : 267Number of relaxations solved : 810Number of interior point iterations: 0Number of simplex iterations : 10521Mixed integer optimizer terminated. Time: 0.95The fields in the main MOSEK log output are:FieldBRANCHESRELAXSACT NDSBEST INT OBJ.BEST RELAX OBJREL GAP(%)TIMEDescriptionCurrent number of branches in tree.Current number of nodes in branch and bound tree.Current number of active nodes.Current best integer solutionCurrent best relaxed solution.Relative gap between current BEST INT OBJ. and BEST RELAX OBJ.Current elapsed resource time in seconds.The log then gives information about solving the model with discrete variables fixed in order to determinemarginals. We also get information about crossover to determine a basic solution, and finally MOSEK providesinformation about using the Simplex Method to determine an optimal basic solution.Interior-point optimizer started.Presolve started.Linear dependency checker started.Linear dependency checker terminated.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!