The MOSEK Python optimizer API manual Version 7.0 (Revision 141)

Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek

25.11.2015 Views

556 APPENDIX D. API CONSTANTS dataformat.op The data file is an optimization problem formatted file. dataformat.xml The data file is an XML formatted file. dataformat.free mps The data data a free MPS formatted file. dataformat.task Generic task dump file. D.10 Double information items dinfitem.bi clean dual time Time spent within the dual clean-up optimizer of the basis identification procedure since its invocation. dinfitem.bi clean primal dual time Time spent within the primal-dual clean-up optimizer of the basis identification procedure since its invocation. dinfitem.bi clean primal time Time spent within the primal clean-up optimizer of the basis identification procedure since its invocation. dinfitem.bi clean time Time spent within the clean-up phase of the basis identification procedure since its invocation. dinfitem.bi dual time Time spent within the dual phase basis identification procedure since its invocation. dinfitem.bi primal time Time spent within the primal phase of the basis identification procedure since its invocation. dinfitem.bi time Time spent within the basis identification procedure since its invocation. dinfitem.concurrent time Time spent within the concurrent optimizer since its invocation. dinfitem.intpnt dual feas Dual feasibility measure reported by the interior-point optimizer. (For the interior-point optimizer this measure does not directly related to the original problem because a homogeneous model is employed.)

D.10. DOUBLE INFORMATION ITEMS 557 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 This measure should converge to +1 if the problem has a primal-dual optimal solution, and converge to -1 if problem is (strictly) primal or dual infeasible. Furthermore, if the measure converges to 0 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 optimizers. (For the interior-point optimizer this measure does 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. 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 heuristic time Time spent in the optimizer while solving the relaxtions. 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 Otherwise it has the value -1.0. dinfitem.mio obj bound |(objective value of feasible solution) − (objective 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 stricly positive.

D.10. DOUBLE INFORMATION ITEMS 557<br />

dinfitem.intpnt dual obj<br />

Dual objective value reported by the interior-point <strong>optimizer</strong>.<br />

dinfitem.intpnt factor num flops<br />

An estimate of the number of flops used in the factorization.<br />

dinfitem.intpnt opt status<br />

This measure should converge to +1 if the problem has a primal-dual optimal solution, and<br />

converge to -1 if problem is (strictly) primal or dual infeasible. Furthermore, if the measure<br />

converges to 0 the problem is usually ill-posed.<br />

dinfitem.intpnt order time<br />

Order time (in seconds).<br />

dinfitem.intpnt primal feas<br />

Primal feasibility measure reported by the interior-point <strong>optimizer</strong>s. (For the interior-point<br />

<strong>optimizer</strong> this measure does not directly related to the original problem because a homogeneous<br />

model is employed).<br />

dinfitem.intpnt primal obj<br />

Primal objective value reported by the interior-point <strong>optimizer</strong>.<br />

dinfitem.intpnt time<br />

Time spent within the interior-point <strong>optimizer</strong> since its invocation.<br />

dinfitem.mio construct solution obj<br />

If <strong>MOSEK</strong> has successfully constructed an integer feasible solution, then this item contains the<br />

optimal objective value corresponding to the feasible solution.<br />

dinfitem.mio heuristic time<br />

Time spent in the <strong>optimizer</strong> while solving the relaxtions.<br />

dinfitem.mio obj abs gap<br />

Given the mixed-integer <strong>optimizer</strong> has computed a feasible solution and a bound on the optimal<br />

objective value, then this item contains the absolute gap defined by<br />

Otherwise it has the value -1.0.<br />

dinfitem.mio obj bound<br />

|(objective value of feasible solution) − (objective bound)|.<br />

<strong>The</strong> best known bound on the objective function. This value is undefined until at least one<br />

relaxation has been solved: To see if this is the case check that iinfitem.mio num relax is<br />

stricly positive.

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

Saved successfully!

Ooh no, something went wrong!