LP Problem

θ values and their corresponding number of iterations in brackets

Optimal Solution

Maximize Z = 6 X 1 + 8 X 2

Subject to

X 1 + 2 X 2 12

X 1 + X 2 10

X 1 , X 2 0

0.1 (79)

0.3 (24)

0.5 (12)

0.7 (8)

0.9 (6)

0.2 (38)

0.4 (17)

0.6 (10)

0.8 (7)

1.0 (2)

Z = 64

X 1 = 8

X 2 = 2

Maximize Z = 2 X 1 + 3 X 2

Subject to

X 1 + X 2 350

2 X 1 + X 2 600

X 1 125

X 1 X 2 0

0.1 (92)

0.3 (29)

0.5 (17)

0.7 (11)

0.9 (8)

0.2 (45)

0.4 (21)

0.6 (12)

0.8 (10)

1.0 (2)

Z = 1300

X 1 = 125

X 2 = 350