The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
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.
- Page 527 and 528: B.3. SPARAM: STRING PARAMETER TYPES
- Page 529 and 530: B.3. SPARAM: STRING PARAMETER TYPES
- Page 531 and 532: B.3. SPARAM: STRING PARAMETER TYPES
- Page 533 and 534: B.3. SPARAM: STRING PARAMETER TYPES
- Page 535 and 536: B.3. SPARAM: STRING PARAMETER TYPES
- Page 537 and 538: Appendix C Response codes Response
- Page 539 and 540: 517 rescode.err con q not psd The q
- Page 541 and 542: 519 rescode.err global inv conic pr
- Page 543 and 544: 521 rescode.err inv markj Invalid v
- Page 545 and 546: 523 rescode.err invalid format type
- Page 547 and 548: 525 rescode.err license no server s
- Page 549 and 550: 527 rescode.err mio no optimizer No
- Page 551 and 552: 529 rescode.err name max len A name
- Page 553 and 554: 531 rescode.err numconlim Maximum n
- Page 555 and 556: 533 rescode.err qcon upper triangle
- Page 557 and 558: 535 rescode.err sym mat invalid col
- Page 559 and 560: 537 rescode.err user nlo func The u
- Page 561 and 562: 539 rescode.wrn ana almost int boun
- Page 563 and 564: 541 rescode.wrn mio infeasible fina
- Page 565 and 566: 543 rescode.wrn write discarded cfi
- Page 567 and 568: Appendix D API constants D.1 Constr
- Page 569 and 570: D.5. PROGRESS CALL-BACK CODES 547 c
- Page 571 and 572: D.5. PROGRESS CALL-BACK CODES 549 c
- Page 573 and 574: D.5. PROGRESS CALL-BACK CODES 551 c
- Page 575 and 576: D.5. PROGRESS CALL-BACK CODES 553 c
- Page 577: D.6. TYPES OF CONVEXITY CHECKS. 555
- Page 581 and 582: D.10. DOUBLE INFORMATION ITEMS 559
- Page 583 and 584: D.11. FEASIBILITY REPAIR TYPES 561
- Page 585 and 586: D.13. INTEGER INFORMATION ITEMS. 56
- Page 587 and 588: D.13. INTEGER INFORMATION ITEMS. 56
- Page 589 and 590: D.13. INTEGER INFORMATION ITEMS. 56
- Page 591 and 592: D.16. INPUT/OUTPUT MODES 569 intpnt
- Page 593 and 594: D.20. CONTINUOUS MIXED-INTEGER SOLU
- Page 595 and 596: D.26. OBJECTIVE SENSE TYPES 573 D.2
- Page 597 and 598: D.31. PRESOLVE METHOD. 575 paramete
- Page 599 and 600: D.35. RESPONSE CODE TYPE 577 D.35 R
- Page 601 and 602: D.42. PROBLEM REFORMULATION. 579 si
- Page 603 and 604: D.46. SOLUTION TYPES 581 solsta.dua
- Page 605 and 606: D.50. STREAM TYPES 583 startpointty
- Page 607 and 608: Appendix E Troubleshooting When cre
- Page 609 and 610: Appendix F Mosek file formats MOSEK
- Page 611 and 612: F.1. THE MPS FILE FORMAT 589 Fields
- Page 613 and 614: F.1. THE MPS FILE FORMAT 591 must b
- Page 615 and 616: F.1. THE MPS FILE FORMAT 593 Constr
- Page 617 and 618: F.1. THE MPS FILE FORMAT 595 v 1 is
- Page 619 and 620: F.1. THE MPS FILE FORMAT 597 Please
- Page 621 and 622: F.2. THE LP FILE FORMAT 599 minimiz
- Page 623 and 624: F.2. THE LP FILE FORMAT 601 st defi
- Page 625 and 626: F.2. THE LP FILE FORMAT 603 bounds
- Page 627 and 628: F.3. THE OPF FORMAT 605 iparam.writ
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.