The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
574 APPENDIX D. API CONSTANTS optimizertype.mixed int conic The mixed-integer optimizer for conic and linear problems. optimizertype.mixed int The mixed-integer optimizer. optimizertype.concurrent The optimizer for nonconvex nonlinear problems. optimizertype.nonconvex The optimizer for nonconvex nonlinear problems. D.29 Ordering strategies orderingtype.free The ordering method is chosen automatically. orderingtype.appminloc Approximate minimum local fill-in ordering is employed. orderingtype.experimental This option should not be used. orderingtype.try graphpar Always try the the graph partitioning based ordering. orderingtype.force graphpar Always use the graph partitioning based ordering even if it is worse that the approximate minimum local fill ordering. orderingtype.none No ordering is used. D.30 Parameter type parametertype.invalid type Not a valid parameter. parametertype.dou type Is a double parameter. parametertype.int type Is an integer parameter.
D.31. PRESOLVE METHOD. 575 parametertype.str type Is a string parameter. D.31 Presolve method. presolvemode.off The problem is not presolved before it is optimized. presolvemode.on The problem is presolved before it is optimized. presolvemode.free It is decided automatically whether to presolve before the problem is optimized. D.32 Problem data items problemitem.var Item is a variable. problemitem.con Item is a constraint. problemitem.cone Item is a cone. D.33 Problem types problemtype.lo The problem is a linear optimization problem. problemtype.qo The problem is a quadratic optimization problem. problemtype.qcqo The problem is a quadratically constrained optimization problem. problemtype.geco General convex optimization. problemtype.conic A conic optimization.
- 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 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: D.26. OBJECTIVE SENSE TYPES 573 D.2
- 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
- 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
574 APPENDIX D. <strong>API</strong> CONSTANTS<br />
<strong>optimizer</strong>type.mixed int conic<br />
<strong>The</strong> mixed-integer <strong>optimizer</strong> for conic and linear problems.<br />
<strong>optimizer</strong>type.mixed int<br />
<strong>The</strong> mixed-integer <strong>optimizer</strong>.<br />
<strong>optimizer</strong>type.concurrent<br />
<strong>The</strong> <strong>optimizer</strong> for nonconvex nonlinear problems.<br />
<strong>optimizer</strong>type.nonconvex<br />
<strong>The</strong> <strong>optimizer</strong> for nonconvex nonlinear problems.<br />
D.29 Ordering strategies<br />
orderingtype.free<br />
<strong>The</strong> ordering method is chosen automatically.<br />
orderingtype.appminloc<br />
Approximate minimum local fill-in ordering is employed.<br />
orderingtype.experimental<br />
This option should not be used.<br />
orderingtype.try graphpar<br />
Always try the the graph partitioning based ordering.<br />
orderingtype.force graphpar<br />
Always use the graph partitioning based ordering even if it is worse that the approximate minimum<br />
local fill ordering.<br />
orderingtype.none<br />
No ordering is used.<br />
D.30 Parameter type<br />
parametertype.invalid type<br />
Not a valid parameter.<br />
parametertype.dou type<br />
Is a double parameter.<br />
parametertype.int type<br />
Is an integer parameter.
Change language