The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
562 APPENDIX D. API CONSTANTS iinfitem.ana pro num con ra Number of constraints with finite lower and upper bounds. This value is set by Task.analyzeproblem. iinfitem.ana pro num con up Number of constraints with an upper bound and an infinite lower bound. This value is set by Task.analyzeproblem. iinfitem.ana pro num var Number of variables in the problem. This value is set by Task.analyzeproblem. iinfitem.ana pro num var bin Number of binary (0-1) variables. This value is set by Task.analyzeproblem. iinfitem.ana pro num var cont Number of continuous variables. This value is set by Task.analyzeproblem. iinfitem.ana pro num var eq Number of fixed variables. This value is set by Task.analyzeproblem. iinfitem.ana pro num var fr Number of free variables. This value is set by Task.analyzeproblem. iinfitem.ana pro num var int Number of general integer variables. This value is set by Task.analyzeproblem. iinfitem.ana pro num var lo Number of variables with a lower bound and an infinite upper bound. This value is set by Task.analyzeproblem. iinfitem.ana pro num var ra Number of variables with finite lower and upper bounds. This value is set by Task.analyzeproblem. iinfitem.ana pro num var up Number of variables with an upper bound and an infinite lower bound. This value is set by This value is set by Task.analyzeproblem.
D.13. INTEGER INFORMATION ITEMS. 563 iinfitem.concurrent fastest optimizer The type of the optimizer that finished first in a concurrent optimization. iinfitem.intpnt factor dim dense Dimension of the dense sub system in factorization. iinfitem.intpnt iter Number of interior-point iterations since invoking the interior-point optimizer. iinfitem.intpnt num threads Number of threads that the interior-point optimizer is using. iinfitem.intpnt solve dual Non-zero if the interior-point optimizer is solving the dual problem. iinfitem.mio construct num roundings Number of values in the integer solution that is rounded to an integer value. iinfitem.mio construct solution If this item has the value 0, then MOSEK did not try to construct an initial integer feasible solution. If the item has a positive value, then MOSEK successfully constructed an initial integer feasible solution. iinfitem.mio initial solution Is non-zero if an initial integer solution is specified. iinfitem.mio num active nodes Number of active brabch bound nodes. iinfitem.mio num basis cuts Number of basis cuts. iinfitem.mio num branch Number of branches performed during the optimization. iinfitem.mio num cardgub cuts Number of cardgub cuts. iinfitem.mio num clique cuts Number of clique cuts. iinfitem.mio num coef redc cuts Number of coef. redc. cuts. iinfitem.mio num contra cuts Number of contra cuts.
- 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 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: D.11. FEASIBILITY REPAIR TYPES 561
- 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
- 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
D.13. INTEGER INFORMATION ITEMS. 563<br />
iinfitem.concurrent fastest <strong>optimizer</strong><br />
<strong>The</strong> type of the <strong>optimizer</strong> that finished first in a concurrent optimization.<br />
iinfitem.intpnt factor dim dense<br />
Dimension of the dense sub system in factorization.<br />
iinfitem.intpnt iter<br />
Number of interior-point iterations since invoking the interior-point <strong>optimizer</strong>.<br />
iinfitem.intpnt num threads<br />
Number of threads that the interior-point <strong>optimizer</strong> is using.<br />
iinfitem.intpnt solve dual<br />
Non-zero if the interior-point <strong>optimizer</strong> is solving the dual problem.<br />
iinfitem.mio construct num roundings<br />
Number of values in the integer solution that is rounded to an integer value.<br />
iinfitem.mio construct solution<br />
If this item has the value 0, then <strong>MOSEK</strong> did not try to construct an initial integer feasible<br />
solution. If the item has a positive value, then <strong>MOSEK</strong> successfully constructed an initial integer<br />
feasible solution.<br />
iinfitem.mio initial solution<br />
Is non-zero if an initial integer solution is specified.<br />
iinfitem.mio num active nodes<br />
Number of active brabch bound nodes.<br />
iinfitem.mio num basis cuts<br />
Number of basis cuts.<br />
iinfitem.mio num branch<br />
Number of branches performed during the optimization.<br />
iinfitem.mio num cardgub cuts<br />
Number of cardgub cuts.<br />
iinfitem.mio num clique cuts<br />
Number of clique cuts.<br />
iinfitem.mio num coef redc cuts<br />
Number of coef. redc. cuts.<br />
iinfitem.mio num contra cuts<br />
Number of contra cuts.
Change language