*  LINEAR PROGRAMMING
*    Maximize      x1 + 3 x2
*    subject to:   x1 < 300
*                  x2 < 100
*                  0.1 x1 + 0.2 x2 < 40
*                  x1, x2 > 0
READ C / ROWS=2 COLS=1
1
3
READ A / ROWS=3 COLS=2
1 0
0 1
.1 .2
READ B / ROWS=3 COLS=1
300
100
 40
LP C A B
DELETE C A B
* The dual linear problem
*    Minimize      300 y1 + 100 y2 + 40 y3
*    subject to:   y1 + 0.1 y2 > 1
*                  y2 + 0.2 y3 > 3
*                  y1, y2, y3 > 0
READ C / ROWS=3 COLS=1
300
100
 40
READ A / ROWS=2 COLS=3
-1  0 -.1
 0 -1 -.2
READ B / ROWS=2 COLS=1
-1
-3
LP C A B / MIN
STOP