1.

x1 x2 x3
28 1 0
1 3 5 Dual Variables
1 7 5 35 <= 35 0.2
1 2 6 30 <= 30 0.8

max 31

2. x1 x2 x3 x4
0 6.73077 0 2.30769
2 11 6 7 Dual variables
11 12 15 17 120 <= 120
4 7 8 9 67.8846 <= 90
3 6 5 2 45 <= 45

max 90.1923
 1. Επίλυση με το Solver του γραμμικού προγράμματος:
max x1+3x2+5x3
31 υπό τους περιορισμούς
x1+7x2+5x3 <=35
x1+2x2+6x3 <=30
x1,x2,x3 >=0

2. max 2x1+11x2+6x3+7x4
Dual variables υπό τους περιορισμούς
0.25641 90.1923 11x1+12x2+15x3+17x4 <=120
0 4x1+7x2+8x3+9x4 <=90
1.32051 3x1+6x2+5x3+2x4 <=45
x1,x2,x3,x4 >=0
Transportation Problem 4 Factories, 3 Cities

Quantities Produced by Factories

Cost Matrix for transporting 1 unit from factory i to city j

Factories 22 31 17 40

1 2 3 4 22 31 17 40

13 15 8 9 1 0 0 17 6

5 13 12 7 2 22 2E-15 0 34

Cities
4 8 5 6 3 0 31 0 0

Total Transportation Cost= 786

 Quantities demanded by cities

23

56

31
23

56

31
d by Factories