Tutorial 1

1. Weenies and Buns is a food processing plant which manufactures hot dogs and hot
dog buns. They grind their own flour for the hot dog buns at a maximum rate of 200
pounds per week. Each hot dog buns requires 0.1 pound of flour. They currently have a
contact with Farmland, Inc.,which specifies that a delivery of 800 pounds of chicken
product is delivered every Monday. Each hot dog requires

1
pound of chicken product.
4

All other ingredients in the hot dogs and hot dog buns are in plentiful supply. Finally, the
labor force at Weenies and Buns consists of 5 employees working full time (40 hours per
week each). Each hot dog requires 3 minutes of labor, and each hot dog bun requires 2
minutes of labor. Each hot dog yields a profit of $0.20, and each bun yields a profit of
$0.10.
Weenies and Buns would like to know how many hot dogs and how many hot dog buns
they should produce each week so as to achieve the highest possible profit.
a) Formulate a linear programming model for this problem.
b) Use the graphical method to solve this model.
2. The Weigelt Corporation has three branch plants with excess production capacity.
Fortunately, the corporation has a new product ready to begin production, and all three
plants have this capability, so some of the excess capacity can be used in this way. This
product can be made in three sizes large, medium, and small that yield a net unit
profit of $420, $360and $300, respectively. Plants 1,2 and 3 have the excess capacity to
produce 750, 900 and 450 units per day of this product, respectively, regardless of the
size or combination of sizes involved.
The amount of available in-process storage space also imposes a limitation on the
production rates of the new product. Plants 1,2 and 3 have 13,000, 12,000 and 5,000
square feet, respectively, of in-process storage space available for a days production of
this product. Each unit of the large, medium, and small sizes produced per day requires
20, 15 and 12 square feet, respectively.
Sales forecasts indicate that if available, 900, 1,200 and 750 units of the large,
medium and small sizes, respectively, would be sold per day.
At each plant, some employees will need to be laid off unless most of the plants
excess production capacity can be used to produce the new product. To avoid layoffs if
possible, management has decided that the plants should use the same percentage of their
excess capacity to produce the new product.
Management wishes to know how much of each of the sizes should be produced
by each of the plants to maximize profit.
Formulate a linear programming model for this problem.

3. Solve the following LP problem by the simplex algorithm:

maximize z = 9 x1 + 12 x 2
subject to: 4 x1 + 3x 2 180
2 x1 + 3x 2 150
4 x1 + 2 x 2 160
x1 , x 2 0

4. Solve the following LP problem by the simplex algorithm:

maximize z = x1 + 2 x 2 + 4 x3
subject to: 3 x1 + x 2 + 5 x3 10
x1 + 4 x 2 + x3 8
2 x1 + 2 x3 7
x1 , x 2 , x3 0

5. Construct the first simplex table for the problem below by using the Big M method:
maximize Z = x1 + 2 x 2 + 3 x3 x 4
subject to: x1 + 2 x 2 + 3 x3 = 15
2 x1 + x 2 + 5 x3 20
x1 + 2 x 2 + x3 + x 4 10
x1 , x 2 , x3 , x 4 0