The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
614 APPENDIX F. MOSEK FILE FORMATS minimize x 3 + x 4 + x 5 subject to x 0 + x 1 + 2x 2 = 1, x 0 √ , x 1 , x 2 ≥ 0, x 3 ≥ x 2 0 + x2 1 , 2x 4 x 5 ≥ x 2 2. Please note that the type of the cones is defined by the parameter to [cone ...]; the content of the cone-section is the names of variables that belong to the cone. [comment] The cqo1 example in OPF format. [/comment] [hints] [hint NUMVAR] 6 [/hint] [hint NUMCON] 1 [/hint] [hint NUMANZ] 3 [/hint] [/hints] [variables disallow new variables] x1 x2 x3 x4 x5 x6 [/variables] [objective minimize ’obj’] x4 + x5 + x6 [/objective] [constraints] [con ’c1’] x1 + x2 + 2e+00 x3 = 1e+00 [/con] [/constraints] [bounds] # We let all variables default to the positive orthant [b] 0 = sqrt( x1^2 + x2^2 ) [cone quad ’k1’] x4, x1, x2 [/cone] # Define rotated quadratic cone: 2 x5 x6 >= x3^2 [cone rquad ’k2’] x5, x6, x3 [/cone] [/bounds] F.3.5.4 Mixed integer example milo1.opf Consider the mixed integer problem: maximize x 0 + 0.64x 1 subject to 50x 0 + 31x 1 ≤ 250, 3x 0 − 2x 1 ≥ − 4, x 0 , x 1 ≥ 0 and integer
F.4. THE TASK FORMAT 615 This can be implemented in OPF with: [comment] The milo1 example in OPF format [/comment] [hints] [hint NUMVAR] 2 [/hint] [hint NUMCON] 2 [/hint] [hint NUMANZ] 4 [/hint] [/hints] [variables disallow new variables] x1 x2 [/variables] [objective maximize ’obj’] x1 + 6.4e-1 x2 [/objective] [constraints] [con ’c1’] 5e+1 x1 + 3.1e+1 x2
- 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
- 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: F.3. THE OPF FORMAT 613 [bounds] [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
- Page 655 and 656: INDEX 633 rescode.err inv numj, 521
- Page 657 and 658: INDEX 635 rescode.err sen bound inv
F.4. THE TASK FORMAT 615<br />
This can be implemented in OPF with:<br />
[comment]<br />
<strong>The</strong> milo1 example in OPF format<br />
[/comment]<br />
[hints]<br />
[hint NUMVAR] 2 [/hint]<br />
[hint NUMCON] 2 [/hint]<br />
[hint NUMANZ] 4 [/hint]<br />
[/hints]<br />
[variables disallow new variables]<br />
x1 x2<br />
[/variables]<br />
[objective maximize ’obj’]<br />
x1 + 6.4e-1 x2<br />
[/objective]<br />
[constraints]<br />
[con ’c1’] 5e+1 x1 + 3.1e+1 x2
Change language