Duality Sheet

Find the dual form of the following LP problems:

Exercise 1: Exercise 2:
Maximize Z = 2 X1 + X2 Minimize Z = X1 - X2
S.t. S.t.
- X1 + 2 X2 <= 1 2 X1 + X2 >= 4
X1 + X2 <= 3 X1 + X2 >= 1
X1 - 2 X2 < = 4 X1 + 2 X2 >= 3
X1, X2 >= 0 X1, X2 >= 0

Exercise 3: Exercise 4:
Maximize Z = 4 X1 - X2 + 2 X3 Minimize Z = 4 X1 + 2 X2 - X3
S.t. S.t.
X1 + X2 <= 5 X1 + 2 X2 <= 6
2 X1 + X2 <= 7 X1 - X2 + 2 X 3 = 8
2 X2 + X3 >= 6 X1, X2 >= 0, X3 urs
X1 + X 3 = 4
X1, X2, X3 >= 0

Exercise 5: Exercise 6:
Maximize Z = 10 X1 + 3 X2 + 8 X3 Minimize Z = 2 X2 + 5 X3
S.t. S.t.
X1 + 4 X2 + 2 X3 <= 16 X1 + X2 >= 2
3 X2 + X3 = 10 -2 X1 - 4 X2 - 6 X3 >= -6
2 X2 + X3 >= 6 X1 - X2 - 6 X3 <= 4
6 X1 + 2 X2 >= 20 X1 - X2 - 6 X3 >= 4
X1, X2 >= 0, X3 urs X1, X2, X3 >= 0

Find the primal form of the following dual LP problems:

Exercise 7: Exercise 8:
Minimize W = 20 y1 + 10 y2 Maximize W = 4 y1 + 3 y2
S.t. S.t.
5 y1 + y2 >= 6 y1 + y2 <= 1
2 y1 + 2 y2 >= 8 - 2 y2 <= -1
y1, y2 >= 0 - y1 + 2 y2 <= 1
y1, y2 >= 0

Page | 1
Exercise 9:
A company owns mines A and B. Mine A can produce 1 ton of high-grade ore, 4 tons of
medium- grade ore, and 6 tons of low-grade ore per day. Mine B can produce 2 tons of
each of the three grades ore per day. The company requires at least 60 tons of high-grade
ore, 120 tons of medium- grade ore, and 150 tons of low-grade ore. If it costs $200 per day
to work mine A and $300 per day to work mine B, how many days should each mine be
operated if the company wishes to minimize costs? Solve the dual problem by the simplex
method.

Exercise 10:
A Kopek Products, Inc. produces two kinds of products: AK Pup dog food is a blend of
one pound of cereal and one and a half pounds of meat, it utilizes one unit of AK Pup
packaging capacity, and it generates a contribution to overhead and profits of $.56 per
package. Similarly, Kara Hound is a blend of two pounds of cereal and one pound of meat
and generates a contribution to overhead and profits of $.42 per package. The associated
resources are 240,000 pounds of cereal, 180,000 pounds of meat, and packaging equipment
that can package at most 110,000 packages of AK Pup dog food a month. Construct a linear
programming model that would maximize the profit by deciding how much to produce of
each product. Then formulate the dual problem and interpret the variables and relations
used. Solve the dual problem.

Page | 2