The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
582 APPENDIX D. API CONSTANTS D.47 Solve primal or dual form solveform.free The optimizer is free to solve either the primal or the dual problem. solveform.primal The optimizer should solve the primal problem. solveform.dual The optimizer should solve the dual problem. D.48 Status keys stakey.unk The status for the constraint or variable is unknown. stakey.bas The constraint or variable is in the basis. stakey.supbas The constraint or variable is super basic. stakey.low The constraint or variable is at its lower bound. stakey.upr The constraint or variable is at its upper bound. stakey.fix The constraint or variable is fixed. stakey.inf The constraint or variable is infeasible in the bounds. D.49 Starting point types startpointtype.free The starting point is chosen automatically. startpointtype.guess The optimizer guesses a starting point.
D.50. STREAM TYPES 583 startpointtype.constant The optimizer constructs a starting point by assigning a constant value to all primal and dual variables. This starting point is normally robust. startpointtype.satisfy bounds The starting point is choosen 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. D.50 Stream types streamtype.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. streamtype.msg Message stream. Log information relating to performance and progress of the optimization is written to this stream. streamtype.err Error stream. Error messages are written to this stream. streamtype.wrn Warning stream. Warning messages are written to this stream. D.51 Cone types symmattype.sparse Sparse symmetric matrix. D.52 Integer values value.license buffer length The length of a license key buffer. value.max str len Maximum string length allowed in MOSEK.
- 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 and 578: D.6. TYPES OF CONVEXITY CHECKS. 555
- Page 579 and 580: D.10. DOUBLE INFORMATION ITEMS 557
- 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: D.46. SOLUTION TYPES 581 solsta.dua
- 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
- Page 629 and 630: F.3. THE OPF FORMAT 607 [tag "value
- Page 631 and 632: F.3. THE OPF FORMAT 609 Note that a
- Page 633 and 634: F.3. THE OPF FORMAT 611 F.3.2.3 Nam
- Page 635 and 636: F.3. THE OPF FORMAT 613 [bounds] [b
- Page 637 and 638: F.4. THE TASK FORMAT 615 This can b
- Page 639 and 640: F.7. THE SOLUTION FILE FORMAT 617 c
- Page 641 and 642: Appendix G Problem analyzer example
- Page 643 and 644: G.2. ARKI001 621 2 476 45.42 48.19
- Page 645 and 646: G.4. PROBLEM WITH BOTH LINEAR AND C
- Page 647 and 648: Bibliography [1] Chvátal, V.. Line
- Page 649 and 650: Index analyzenames (Task method), 2
- Page 651 and 652: INDEX 629 getpcni (Task method), 25
- Page 653 and 654: INDEX 631 putbarablocktriplet (Task
582 APPENDIX D. <strong>API</strong> CONSTANTS<br />
D.47 Solve primal or dual form<br />
solveform.free<br />
<strong>The</strong> <strong>optimizer</strong> is free to solve either the primal or the dual problem.<br />
solveform.primal<br />
<strong>The</strong> <strong>optimizer</strong> should solve the primal problem.<br />
solveform.dual<br />
<strong>The</strong> <strong>optimizer</strong> should solve the dual problem.<br />
D.48 Status keys<br />
stakey.unk<br />
<strong>The</strong> status for the constraint or variable is unknown.<br />
stakey.bas<br />
<strong>The</strong> constraint or variable is in the basis.<br />
stakey.supbas<br />
<strong>The</strong> constraint or variable is super basic.<br />
stakey.low<br />
<strong>The</strong> constraint or variable is at its lower bound.<br />
stakey.upr<br />
<strong>The</strong> constraint or variable is at its upper bound.<br />
stakey.fix<br />
<strong>The</strong> constraint or variable is fixed.<br />
stakey.inf<br />
<strong>The</strong> constraint or variable is infeasible in the bounds.<br />
D.49 Starting point types<br />
startpointtype.free<br />
<strong>The</strong> starting point is chosen automatically.<br />
startpointtype.guess<br />
<strong>The</strong> <strong>optimizer</strong> guesses a starting point.
Change language