Decision Variables:

x1= tons of HYDIT produced per week

x2 = tons of FILIT produced

The Linear Program

Maximize Z = 140x1 + 160x2
subject to: 2x1 + 4x2 28
5x1 + 5x2 50
x1 8
x2 6
x1, x2 0

11
10
9
8
7
6
x2
5
4 2x1 + 4x2 28
3
2
1

1 2 3 4 5 6 7 8 9 10
x1

1
 11
10
9 5x1 + 5x2 50
8
7
6
x2
5
4 2x1 + 4x2 28
3
2
1

1 2 3 4 5 6 7 8 9 10
x1

11
10
5x1 + 5x2 50
9
8
7
6 x1 8
x2
5
4 2x1 + 4x2 28
3
2
1

1 2 3 4 5 6 7 8 9 10
x1

2
 11
10
5x1 + 5x2 50
9
8 x1 8
7 x2 6
6
x2
5
4 2x1 + 4x2 28
3
2
1

1 2 3 4 5 6 7 8 9 10
x1

11
10
9
8
7
6
x2
5
4
3
Feasible Region
2
1

1 2 3 4 5 6 7 8 9 10
x1

3
 11
10
9
8
7
6
x2
5
4
3 140x1 + 160x2 = 1120
2
1

1 2 3 4 5 6 7 8 9 10
x1

11
10
9
8
7
6
x2
5
4
3
140x1 + 160x2
2
1

1 2 3 4 5 6 7 8 9 10
x1

4
 11
10
9
8
7
6
x2
5
4
3
140x1 + 160x2
2
1

1 2 3 4 5 6 7 8 9 10
x1

11
10 x1 = 6 tons HYDIT
9
x2 = 4 tons FILIT
8
7
6
x2
5
4
140x1 + 160x2 = 1480
3
2
1

1 2 3 4 5 6 7 8 9 10
x1

5
The linear program is:
Minimize Z = 3x1 + 9x2
subject to: 40x1 + 15x2 100
14x1 + 35x2 140
x1 5
x2 5
x1, x2 0

40X1 +15X2 >=100

14X1 + 35X2>=140
8

X1 <=5
X2 <=5 Optimal
6

X1, X2 >=0 Solution

X2 X1 = 5
X2 = 2
4
2

3X1 + 9X2 = ?

0 1 2 3 4 5 6

X1

6
 Alternative Optimal Solution

Minimize Z = -6x1 + 8x2

subject to: 6x1 10x2 15
4x1 + 4x2 37
3x1 4x2 12
x1 2
x2 3/4

Unbounded Solution (Solusi tak terbatas)

Maximize Z = x1 + x2
subject to:
3x1 + 2x2 3
x1 2x2 0
x1, x2 0