The MOSEK Python optimizer API manual Version 7.0 (Revision 141)
Optimizer API for Python - Documentation - Mosek Optimizer API for Python - Documentation - Mosek
602 APPENDIX F. MOSEK FILE FORMATS F.2.1.4 Variable types The final two sections are optional and must begin with one of the keywords bin binaries binary and gen general Under general all integer variables are listed, and under binary all binary (integer variables with bounds 0 and 1) are listed: general x1 x2 binary x3 x4 Again, all variables listed in the binary or general sections must occur in either the objective or a constraint. F.2.1.5 Terminating section Finally, an LP formatted file must be terminated with the keyword end F.2.1.6 Linear example lo1.lp A simple example of an LP file is: \ File: lo1.lp maximize obj: 3 x1 + x2 + 5 x3 + x4 subject to c1: 3 x1 + x2 + 2 x3 = 30 c2: 2 x1 + x2 + 3 x3 + x4 >= 15 c3: 2 x2 + 3 x4
F.2. THE LP FILE FORMAT 603 bounds 0
- 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 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: F.2. THE LP FILE FORMAT 601 st defi
- 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
- Page 655 and 656: INDEX 633 rescode.err inv numj, 521
- Page 657 and 658: INDEX 635 rescode.err sen bound inv
602 APPENDIX F. <strong>MOSEK</strong> FILE FORMATS<br />
F.2.1.4<br />
Variable types<br />
<strong>The</strong> final two sections are optional and must begin with one of the keywords<br />
bin<br />
binaries<br />
binary<br />
and<br />
gen<br />
general<br />
Under general all integer variables are listed, and under binary all binary (integer variables with<br />
bounds 0 and 1) are listed:<br />
general<br />
x1 x2<br />
binary<br />
x3 x4<br />
Again, all variables listed in the binary or general sections must occur in either the objective or a<br />
constraint.<br />
F.2.1.5<br />
Terminating section<br />
Finally, an LP formatted file must be terminated with the keyword<br />
end<br />
F.2.1.6<br />
Linear example lo1.lp<br />
A simple example of an LP file is:<br />
\ File: lo1.lp<br />
maximize<br />
obj: 3 x1 + x2 + 5 x3 + x4<br />
subject to<br />
c1: 3 x1 + x2 + 2 x3 = 30<br />
c2: 2 x1 + x2 + 3 x3 + x4 >= 15<br />
c3: 2 x2 + 3 x4