Module A2

A-42 Module A The Simplex Solution Method
The value 360 can be eliminated, because q

2
cannot exceed 240. Thus, the range over
which the basic solution variables will remain the same is
180 q
2
240
The range for q
3
is
192 q
3
The upper limit of means that q

3
can increase indefinitely (without limit) without
changing the optimal variable solution mix in the shadow price.
Sensitivity analysis of constraint quantity values can be used in conjunction with the
dual solution to make decisions regarding model resources. Recall from our analysis of the
dual solution of the Hickory Furniture Company example that
y
1
$20, marginal value of labor
y
2
$6.67, marginal value of wood
y
3
$0, marginal value of storage space
Because the resource with the greatest marginal value is labor, the manager might desire
to secure some additional hours of labor. How many hours should the manager get? Given
that the range for q
1
is 32 q
1
48, the manager could secure up to an additional 8 hours
of labor (i.e., 48 total hours) before the solution basis changes and the shadow price also
changes. If the manager did purchase 8 more hours, the solution values could be found by
observing the quantity values in Table A-37.
x
2
8 2
x
1
4 2
s
3
48 6
Since 8,
x
2
8 (8)/2
12
x
1
4 (8)/2
0
s
3
48 6(8)
96
Total profit will be increased by $20 for each extra hour of labor.
Z $2,240 20
2,240 20(8)
2,240 160
$2,400
In this example for the Hickory Furniture Company, we considered only constraints
in determining the sensitivity ranges for q
i
values. To compute the q
i
sensitivity range, we
observed the slack column, s
i
, since a change in q
i
was reflected in the s
i
column.
However, recall that with a constraint we subtract a surplus variable rather than adding
a slack variable to form an equality (in addition to adding an artificial variable). Thus, for
a constraint we must consider a change in q
i
in order to use the s
i
(surplus) column
to perform sensitivity analysis. In that case sensitivity analysis would be performed exactly
The shadow prices are only valid

with the sensitivity range for the
right-hand-side values.
Problems A-43
Problems
as shown in this example, except that the value of q
i
would be used instead of q
i

when computing the sensitivity range for q
i
.
1. Following is a simplex tableau for a linear programming model.
Basic
10 2 6 0 0 0
c
j
Variables Quantity x
1
x
2
x
3
s
1
s
2
s
3
2 x
1
10 0 1 2 1 12 0
10 x
2
40 1 0 2 0 12 0
0 s
3
30 0 0 8 3 32 1
z
j
420 10 2 16 2 4 0
c
j
z
j
0 0 10 2 4 0
a. What is the solution given in this tableau?
b. Is the solution in this tableau optimal? Why?
c. What does x
3
equal in this tableau? s
2
?
d. Write out the original objective function for the linear programming model, using only decision
variables.
e. How many constraints are in the linear programming model?
f. Explain briefly why it would have been difficult to solve this problem graphically.
2. The following is a simplex tableau for a linear programming model.
Basic
6 20 12 0 0
c
j
1
x
2
x
3
s
1
s
2
6 x
1
20 1 1 0 0 0
12 x
3
10 0 13 1 0 16
0 s
1
10 0 13 0 1 16
z
j
240 6 10 12 0 2
z
j
c
j
0 10 0 0 2
a. Is this a maximization or a minimization problem? Why?
b. What is the solution given in this tableau?
c. Is the solution given in this tableau optimal? Why?
d. Write out the original objective function for the linear programming model using only decision
variables.
e. How many constraints are in the linear programming model?
f. Were any of the constraints originally equations? Why?
g. What is the value of x
2
in this tableau?
3. The following is a simplex tableau for a linear programming problem.
Basic
60 50 45 50 0 0 0 0
c
j
1
x
2
x
3
x
4
s
1
s
2
s
3
s
4
0 s
1
20 0 1 0 0 1 0 0 0
50 x
4
15 0 0 0 1 0 1 0 0
60 x
1
12 1 12 0 0 0 0 110 0
0 s
4
45 0 0 8 6 0 6 0 1
z
j
1,470 60 30 0 50 0 50 6 0
c
j
z
j
0 20 45 0 0 50 6 0
a. Is this a maximization or a minimization problem?
b. What are the values of the decision variables in this tableau?
c. What are the values of the slack variables in this tableau?
d. What does the c
j
z
j
value of 20 in the x
2
column mean?
e. Is this solution optimal? Why? If the solution is not optimal, determine the optimal solution.
4. The following is a simplex tableau for a linear programming problem.
Basic
8 10 4 0 0 0 M M
c
j
1
x
2
x
3
s
1
s
2
s
3
A
1
A
2
M A
1
30 23 0 1 1 16 0 0 0
10 x
2
10 13 1 0 0 16 0 1 0
M A
3
100 0 0 1 0 0 1 0 1
z
j
130M 100 2M3 103 10 2M M M6 53 M M M
z
j
c
j
2M3 143 0 2M 4 M M6 53 M 0 0
a. Is this a maximization or a minimization problem?
b. What is the value of x
3
in this tableau?
c. What does the value M6 53 in the s
2
column of the z
j
c
j
row mean?
d. What is the minimum number of additional simplex iterations that this problem must go
through to determine a feasible optimal solution?
e. Is this solution optimal? Why? If the solution is not optimal, compute the optimal solution.
Problems A-45
5. Given is the following simplex tableau for a linear programming problem.
Basic
4 6 0 0 M
c
j
1
x
2
s
1
s
2
A
1
M A
1
2 0 12 1 12 1
4 x
1
6 1 12 0 12 0
z
j
24 2M 4 M2 2 M M2 2 M
z
j
c
j
0 M2 4 M M2 2 0
b. What are the values of the decision variables in this tableau?
c. Were any of the constraints in this problem originally equations? Why?
d. What is the value of s
2
in this tableau?
e. Is this solution optimal? Why? If the solution is not optimal, complete the next iteration
(tableau) and indicate if it is optimal.
6. Following is a simplex tableau for a linear programming problem.
Basic
10 5 0 0 M
c
j
1
x
2
s
1
s
2
A
2
10 x
1
5 1 12 12 0 0
M A
2
4 0 1 0 0 1
0 s
2
15 0 72 12 1 0
z
j
4M50 10 M5 5 0 M
c
j
z
j
0 M 5 0 0
b. What is the value of x
2
in this tableau?
c. Does the fact that x
1
has a c
j
z
j
value equal to 0 in this tableau mean that multiple optimal
solutions exist? Why?
d. What does the c
j
z
j
value for the s
1
column mean?
e. Is this solution optimal? Why? If not, solve this problem and indicate if multiple optimal solu-
tions exist.
7. The Munchies Cereal Company makes a cereal from several ingredients. Two of the ingredients,
oats and rice, provide vitamins A and B. The company wants to know how many ounces of oats and
rice it should include in each box of cereal to meet the minimum requirements of 48 milligrams of
vitamin A and 12 milligrams of vitamin B while minimizing cost. An ounce of oats contributes
8 milligrams of vitamin A and 1 milligram of vitamin B, whereas an ounce of rice contributes
6 milligrams of vitamin A and 2 milligrams of vitamin B. An ounce of oats costs $0.05, and an
ounce of rice costs $0.03. Formulate a linear programming model for this problem and solve using
the simplex method.
8. A company makes product 1 and product 2 from two resources. The linear programming model
for determining the amounts of product 1 and 2 to produce (x
1
and x
2
) is
maximize Z 8x
1
2x
2
(profit, $)
subject to
4x
1
5x
2
20 (resource 1, lb)
2x
1
6x
2
18 (resource 2, lb)
x
1
, x
2
0
Solve this model using the simplex method.
9. A company produces two products that are processed on two assembly lines. Assembly line 1 has
100 available hours, and assembly line 2 has 42 available hours. Each product requires 10 hours of
processing time on line 1, while on line 2 product 1 requires 7 hours and product 2 requires
3 hours. The profit for product 1 is $6 per unit, and the profit for product 2 is $4 per unit.
Formulate a linear programming model for this problem and solve using the simplex method.
10. The Pinewood Furniture Company produces chairs and tables from two resources labor and
wood. The company has 80 hours of labor and 36 pounds of wood available each day. Demand for
chairs is limited to 6 per day. Each chair requires 8 hours of labor and 2 pounds of wood to pro-
duce, while a table requires 10 hours of labor and 6 pounds of wood. The profit derived from each
chair is $400 and from each table, $100. The company wants to determine the number of chairs and
tables to produce each day to maximize profit. Formulate a linear programming model for this
problem and solve using the simplex method.
11. The Crumb and Custard Bakery makes both coffee cakes and Danish in large pans. The main ingre-
dients are flour and sugar. There are 25 pounds of flour and 16 pounds of sugar available and the
demand for coffee cakes is 8. Five pounds of flour and 2 pounds of sugar are required to make one
pan of coffee cake, and 5 pounds of flour and 4 pounds of sugar are required to make one pan of
Danish. One pan of coffee cake has a profit of $1, and one pan of Danish has a profit of $5.
Determine the number of pans of cake and Danish that the bakery must produce each day so that
profit will be maximized. Formulate a linear programming model for this problem and solve using
the simplex method.
12. The Kalo Fertilizer Company makes a fertilizer using two chemicals that provide nitrogen, phos-
phate, and potassium. A pound of ingredient 1 contributes 10 ounces of nitrogen and 6 ounces of
phosphate, whereas a pound of ingredient 2 contributes 2 ounces of nitrogen, 6 ounces of phos-
phate, and 1 ounce of potassium. Ingredient 1 costs $3 per pound, and ingredient 2 costs $5 per
pound. The company wants to know how many pounds of each chemical ingredient to put into a
bag of fertilizer to meet minimum requirements of 20 ounces of nitrogen, 36 ounces of phosphate,
and 2 ounces of potassium while minimizing cost. Formulate a linear programming model for this
problem and solve using the simplex method.
13. Solve the following model using the simplex method.
minimize Z 0.06x
1
0.10x
2
subject to
Problems A-47
4x
1
3x
2
12
3x
1
6x
2
12
5x
1
2x
2
10
x
1
, x
2
0
14. The Copperfield Mining Company owns two mines, both of which produce three grades of ore
high, medium, and low. The company has a contract to supply a smelting company with at least 12
tons of high-grade ore, 8 tons of medium-grade ore, and 24 tons of low-grade ore. Each mine pro-
duces a certain amount of each type of ore each hour it is in operation. Mine 1 produces 6 tons of
high-grade, 2 tons of medium-grade, and 4 tons of low-grade ore per hour. Mine 2 produces 2 tons
of high-grade, 2 tons of medium-grade, and 12 tons of low-grade ore per hour. It costs $200 per
hour to mine each ton of ore from mine 1, and it costs $160 per hour to mine a ton of ore from
mine 2. The company wants to determine the number of hours it needs to operate each mine so
that contractual obligations can be met at the lowest cost. Formulate a linear programming model
for this problem and solve using the simplex method.
15. A marketing firm has contracted to do a survey on a political issue for a Spokane television station.
The firm conducts interviews during the day and at night, by telephone and in person. Each hour
an interviewer works at each type of interview results in an average number of interviews. In order
to have a representative survey, the firm has determined that there must be at least 400 day inter-
views, 100 personal interviews, and 1,200 interviews overall. The company has developed the
following linear programming model to determine the number of hours of telephone interviews
during the day (x
1
), telephone interviews at night (x
2
), personal interviews during the day (x
3
), and
personal interviews at night (x
4
) that should be conducted to minimize cost.
minimize Z 2x
1
3x
2
5x
3
7x
4
(cost, $)
subject to
10x
1
4x
3
400 (day interviews)
4x
3
5x
4
100 (personal interviews)
x
1
x
2
x
3
x
4
1,200 (total interviews)
x
1
, x
2
, x
3
, x
4
0
16. A jewelry store makes both necklaces and bracelets from gold and platinum. The store has devel-
oped the following linear programming model for determining the number of necklaces and
bracelets (x
1
and x
2
) that it needs to make to maximize profit.
maximize Z 300x
1
400x
2
(profit, $)
subject to
3x
1
2x
2
18 (gold, oz)
2x
1
4x
2
20 (platinum, oz)
x
2
4 (demand, bracelets)
x
1
, x
2
0
17. A sporting goods company makes baseballs and softballs on a daily basis from leather and yarn.
The company has developed the following linear programming model for determining the number
of baseballs and softballs to produce (x
1
and x
2
) to maximize profits:
maximize Z 5x
1
4x
2
(profit, $)
subject to
0.3x
1
0.5x
2
150 (leather, ft
2
)
10x
1
4x
2
2,000 (yarn, yd)
x
1
, x
2
0
18. A clothing shop makes suits and blazers. Three main resources are used: material, rack space, and
labor. The shop has developed this linear programming model for determining the number of suits
and blazers to make (x
1
and x
2
) to maximize profits:
maximize Z 100x
1
150x
2
(profit, $)
subject to
10x
1
4x
2
160 (material, yd
2
)
x
1
x
2
20 (rack space)
10x
1
20x
2
(labor, hr)
x
1
, x
2
0
19. Solve the following linear programming model using the simplex method.
maximize Z 100x
1
20x
2
60x
3
subject to
3x
1
5x
2
60
2x
1
2x
2
2x
3
100
x
3
40
x
1
, x
2
, x
3
0
20. The following is a simplex tableau for a linear programming model.
Basic
1 2 1 0 0 0
c
j
1
x
2
x
3
s
1
s
2
s
3
2 x
2
10 0 1 14 14 0 0
0 s
2
20 0 0 34 34 1 12
1 x
1
10 1 0 1 12 0 12
z
j
30 1 2 32 0 0 12
c
j
z
j
0 0 52 0 0 12
b. What is the solution given in this tableau?
c. Write out the original objective function for the linear programming model, using only decision
variables.
d. How many constraints are in the linear programming model?
e. Were any of the constraints originally equations? Why?
f. What does s
1
equal in this tableau?
Problems A-49
g. This solution is optimal. Are there multiple optimal solutions? Why?
h. If there are multiple optimal solutions, identify the alternate solutions.
21. A wood products firm in Oregon plants three types of trees white pines, spruce, and ponderosa
pines to produce pulp for paper products and wood for lumber. The company wants to plant
enough acres of each type of tree to produce at least 27 tons of pulp and 30 tons of lumber. The
company has developed the following linear programming model to determine the number of
acres of white pines (x
1
), spruce (x
2
), and ponderosa pines (x
3
) to plant to minimize cost.
minimize Z 120x
1
40x
2
240x
3
(cost, $)
subject to
4x
1
x
2
3x
3
27 (pulp, tons)
2x
1
6x
2
3x
3
30 (lumber, tons)
x
1
, x
2
, x
3
0
22. A baby products firm produces a strained baby food containing liver and milk, each of which con-
tribute protein and iron to the baby food. Each jar of baby food must have 36 milligrams of protein
and 50 milligrams of iron. The company has developed the following linear programming model to
determine the number of ounces of liver (x
1
) and milk (x
2
) to include in each jar of baby food to
meet the requirements for protein and iron at the minimum cost.
minimize Z 0.05x
1
0.10x
2
(cost, $)
subject to
6x
1
2x
2
36 (protein, mg)
5x
1
5x
2
50 (iron, mg)
x
1
, x
2
0
23. Solve the linear programming model in problem 22 graphically, and identify the points on the
graph that correspond to each simplex tableau.
24. The Cookie Monster Store at South Acres Mall makes three types of cookies chocolate chip,
pecan chip, and pecan sandies. Three primary ingredients are chocolate chips, pecans, and sugar.
The store has 120 pounds of chocolate chips, 40 pounds of pecans, and 300 pounds of sugar. The
following linear programming model has been developed for determining the number of batches
of chocolate chip cookies (x
1
), pecan chip cookies (x
2
), and pecan sandies (x
3
) to make to maximize
profit.
maximize Z 10x
1
12x
2
7x
3
(profit, $)
subject to
20x
1
15x
2
10x
3
300 (sugar, lb)
10x
1
5x
2
120 (chocolate chips, lb)
x
1
2x
3
40 (pecans, lb)
x
1
, x
2
, x
3
0
25. The Eastern Iron and Steel Company makes nails, bolts, and washers from leftover steel and coats
them with zinc. The company has 24 tons of steel and 30 tons of zinc. The following linear pro-
gramming model has been developed for determining the number of batches of nails (x
1
), bolts
(x
2
), and washers (x
3
) to produce to maximize profit.
maximize Z 6x
1
2x
2
12x
3
(profit, $1,000s)
subject to
4x
1
x
2
3x
3
24 (steel, tons)
2x
1
6x
2
3x
3
30 (zinc, tons)
x
1
, x
2
, x
3
0
maximize Z 100x
1
75x
2
90x
3
95x
4
subject to
3x
1
2x
2
40
4x
3
x
4
25
200x
1
250x
3
2,000
100x
1
200x
4
2,200
x
1
, x
2
, x
3
, x
4
0
minimize Z 20x
1
16x
2
subject to
3x
1
x
2
6
x
1
x
2
4
2x
1
6x
2
12
x
1
, x
2
0
28. Solve the linear programming model in problem 27 graphically, and identify the points on the
graph that correspond to each simplex tableau.
29. Transform the following linear programming model into proper form for solution by the simplex
method.
minimize Z 8x
1
2x
2
7x
3
subject to
2x
1
6x
2
x
3
30
3x
2
4x
3
60
4x
1
x
2
2x
3
50
x
1
2x
2
20
x
1
, x
2
, x
3
0
30. Transform the following linear programming model into proper form for solution by the simplex
method.
Problems A-51
minimize Z 40x
1
55x
2
30x
3
subject to
x
1
2x
2
3x
3
60
2x
1
x
2
x
3
40
x
1
3x
2
x
3
50
5x
2
3x
3
100
x
1
, x
2
, x
3
0
31. A manufacturing firm produces two products using labor and material. The company has a
contract to produce 5 of product 1 and 12 of product 2. The company has developed the following
linear programming model to determine the number of units of product 1 (x
1
) and product 2 (x
2
)
to produce to maximize profit.
maximize Z 40x
1
60x
2
(profit, $)
subject to
x
1
2x
2
30 (material, lb)
4x
1
4x
2
72 (labor, hr)
x
1
5 (contract, product 1)
x
2
12 (contract, product 2)
x
1
, x
2
0
32. A custom tailor makes pants and jackets from imported Irish wool cloth. To get any cloth at all, the
tailor must purchase at least 25 square feet each week. Each pair of pants and each jacket requires
5 square feet of material. The tailor has 16 hours available each week to make pants and jackets. The
demand for pants is never more than 5 pairs per week. The tailor has developed the following lin-
ear programming model to determine the number of pants (x
1
) and jackets (x
2
) to make each week
to maximize profit.
maximize Z x
1
5x
2
(profit, $100s)
subject to
5x
1
5x
2
25 (wool, ft
2
)
2x
1
4x
2
16 (labor, hr)
x
1
5 (demand, pants)
x
1
, x
2
0
33. A sawmill in Tennessee produces cherry and oak boards for a large furniture manufacturer. Each
month the sawmill must deliver at least 5 tons of wood to the manufacturer. It takes the sawmill
3 days to produce a ton of cherry and 2 days to produce a ton of oak, and the sawmill can allocate
18 days out of a month for this contract. The sawmill can get enough cherry to make 4 tons of
wood and enough oak to make 7 tons of wood. The sawmill owner has developed the following lin-
ear programming model to determine the number of tons of cherry (x
1
) and oak (x
2
) to produce to
minimize cost.
minimize Z 3x
1
6x
2
(cost, $)
subject to
3x
1
2x
2
18 (production time, days)
x
1
x
2
5 (contract, tons)
x
1
4 (cherry, tons)
x
2
7 (oak, tons)
x
1
, x
2
0
maximize Z 10x
1
5x
2
subject to
2x
1
x
2
10
x
2
4
x
1
4x
2
20
x
1
, x
2
0
35. Solve the following linear programming problem using the simplex method.
maximize Z x
1
2x
2
x
3
subject to
4x
2
x
3
40
x
1
x
2
20
2x
1
4x
2
3x
3
60
x
1
, x
2
, x
3
0
36. Solve the following linear programming problem using the simplex method.
maximize Z x
1
2x
2
2x
3
subject to
x
1
x
2
2x
3
12
2x
1
x
2
5x
3
20
x
1
x
2
x
3
8
x
1
, x
2
, x
3
0
37. A farmer has a 40-acre farm in Georgia. The farmer is trying to determine how many acres of corn,
peanuts, and cotton to plant. Each crop requires labor, fertilizer, and insecticide. The farmer has
developed the following linear programming model to determine the number of acres of corn (x
1
),
peanuts (x
2
), and cotton (x
3
) to plant to maximize profit.
maximize Z 400x
1
350x
2
450x
3
(profit, $)
subject to
2x
1
3x
2
2x
3
120 (labor, hr)
4x
1
3x
2
x
3
160 (fertilizer, tons)
Problems A-53
3x
1
2x
2
4x
3
100 (insecticide, tons)
x
1
x
2
x
3
40 (acres)
x
1
, x
2
, x
3
0
38. Solve the following linear programming model (a) graphically and (b) using the simplex method.
maximize Z 3x
1
2x
2
subject to
x
1
x
2
1
x
1
x
2
2
x
1
, x
2
0
39. Solve the following linear programming model (a) graphically and (b) using the simplex method.
maximize Z x
1
x
2
subject to
x
1
x
2
1
x
1
2x
2
4
x
1
, x
2
0
maximize Z 7x
1
5x
2
5x
3
subject to
x
1
x
2
x
3
25
2x
1
x
2
x
3
40
x
1
x
2
25
x
3
6
x
1
, x
2
, x
3
0
minimize Z 15x
1
25x
2
subject to
3x
1
4x
2
12
2x
1
x
2
6
3x
1
2x
2
9
x
1
, x
2
0
42. The Old English Metal Crafters Company makes brass trays and buckets. The number of trays (x
1
)
and buckets (x
2
) that can be produced daily is constrained by the availability of brass and labor, as
reflected in the following linear programming model.
maximize Z 6x
1
10x
2
(profit, $)
subject to
x
1
4x
2
90 (brass, lb)
2x
1
2x
2
60 (labor, hr)
x
1
, x
2
0
The final optimal simplex tableau for this model is as follows.
Basic
6 10 0 0
c
j
1
x
2
s
1
s
2
10 x
2
20 0 1 13 16
6 x
1
10 1 0 13 23
z
j
260 6 10 43 73
c
j
z
j
0 0 43 73
a. Formulate the dual of this model.
b. Define the dual variables and indicate their value.
c. Determine the optimal ranges for c
1
and c
2
.
d. Determine the feasible ranges for q
1
(pounds of brass) and q
2
(labor hours).
e. What is the maximum price the company would be willing to pay for additional labor hours,
and how many hours could be purchased at that price?
43. The Southwest Foods Company produces two brands of chili Razorback and Longhornfrom
several ingredients, including chili beans and ground beef. The number of 100-gallon batches of
Razorback chili (x
1
) and Longhorn chili (x
2
) that can be produced daily is constrained by the avail-
ability of chili beans and ground beef, as shown in the following linear programming model.
maximize Z 200x
1
300x
2
(profit, $)
subject to
10x
1
50x
2
500 (chili beans, lb)
34x
1
20x
2
800 (ground beef, lb)
x
1
, x
2
0
Basic
200 300 0 0
c
j
1
x
2
s
1
s
2
300 x
2
6 0 1 17750 1150
200 x
1
20 1 0 175 130
z
j
5,800 200 300 31075 7015
c
j
z
j
0 0 31075 7015
Problems A-55
a. Formulate the dual of this model and indicate what the dual variables equal.
b. What profit for Razorback chili will result in no Longhorn chili being produced? What will the
new optimal solution values be?
c. Determine what the effect will be of changing the amount of beans in Razorback chili from
10 pounds per batch to 15 pounds per batch.
d. Determine the optimal ranges for c
1
and c
2
.
e. Determine the feasible ranges for q
1
(pounds of beans) and q
2
(pounds of ground beef).
f. What is the maximum price the company would be willing to pay for additional pounds of chili
beans, and how many pounds could be purchased at that price?
g. If the company could secure an additional 100 pounds of only one of the ingredients, beans or
ground beef, which should it be?
h. If the company changed the selling price of Longhorn chili so that the profit was $400 instead of
$300, would the optimal solution be affected?
44. The Agrimaster Company produces two kinds of fertilizer spreaders regular and cyclone. Each
spreader must undergo two production processes. Letting x
1
the number of regular spreaders
produced and x
2
the number of cyclone spreaders produced, the problem can be formulated as
follows.
maximize Z 9x
1
7x
2
(profit, $)
subject to
12x
1
4x
2
60 (process 1, production hr)
4x
1
8x
2
40 (process 2, production hr)
x
1
, x
2
0
The final optimal simplex tableau for this problem is as follows.
Basic
9 7 0 0
c
j
1
x
2
s
1
s
2
9 x
1
4 1 0 110 120
7 x
2
3 0 1 120 320
z
j
57 9 7 1120 1220
c
j
z
j
0 0 1120 1220
a. Formulate the dual for this problem.
b. Define the dual variables and indicate their values.
1
and c
2
.
1
and q
2
(production hours for processes 1 and 2, respect-
ively).
e. What is the maximum price the Agrimaster Company would be willing to pay for addi-
tional hours of process 1 production time, and how many hours could be purchased at
that price?
45. The Stratford House Furniture Company makes two kinds of tables end tables (x
1
) and coffee
tables (x
2
). The manufacturer is restricted by material and labor constraints, as shown in the
following linear programming formulation.
maximize Z 200x
1
300x
2
(profit, $)
subject to
2x
1
5x
2
180 (labor, hr)
3x
1
3x
2
135 (wood, bd ft)
x
1
, x
2
0
The final optimal simplex tableau for this problem is as follows.
Basic
200 300 0 0
c
j
1
x
2
s
1
s
2
300 x
2
30 0 1 13 29
200 x
1
15 1 0 13 59
z
j
12,000 200 300 1003 4009
c
j
z
j
0 0 1003 4009
b. Define the dual variables and indicate their values.
c. What profit for coffee tables will result in no end tables being produced, and what will the new
optimal solution values be?
d. What will be the effect on the optimal solution if the available wood is increased from 135 to
165 board feet?
e. Determine the optimal ranges for c
1
and c
2
.
f. Determine the feasible ranges for q
1
(labor hours) and q
2
(board feet of wood).
g. What is the maximum price the Stratford House Furniture Company would be willing to pay
for additional wood, and how many board feet of wood could be purchased at that price?
h. If the furniture company wanted to secure additional units of only one of the resources, labor or
wood, which should it be?
46. A manufacturing firm produces electric motors for washing machines and vacuum cleaners. The
firm has resource constraints for production time, steel, and wire. The linear programming model
for determining the number of washing machine motors (x
1
) and vacuum cleaner motors (x
2
) to
produce has been formulated as follows.
maximize Z 70x
1
80x
2
(profit, $)
subject to
2x
1
x
2
19 (production, hr)
x
1
x
2
14 (steel, lb)
x
1
2x
2
20 (wire, ft)
x
1
, x
2
0
Problems A-57
Basic
70 80 0 0 0
c
j
1
x
2
s
1
s
2
s
3
70 x
1
6 1 0 23 0 13
0 s
2
1 0 0 13 1 13
80 x
2
7 0 1 13 0 23
z
j
980 70 80 20 0 30
c
j
z
j
0 0 20 0 30
b. What do the dual variables equal, and what do they mean?
1
and c
2
.
1
(production hours), q
2
(pounds of steel), and q
3
(feet of
wire).
e. Managers at the firm have determined that the firm can purchase a new production machine
that will increase available production time from 19 to 25 hours. Would this change affect the
optimal solution?
47. A manufacturer produces products 1 and 2, for which profits are $9 and $12, respectively. Each
product must undergo two production processes that have labor constraints. There are also
material constraints and storage limitations. The linear programming model for determining
the number of product 1 to produce (x
1
) and the number of product 2 to product (x
2
) is given as
follows.
maximize Z 9x
1
12x
2
(profit, $)
subject to
4x
1
8x
2
64 (process 1, labor hr)
5x
1
5x
2
50 (process 2, labor hr)
15x
1
8x
2
120 (material, lb)
x
1
7 (storage space, ft
2
)
x
2
7 (storage space, ft
2
)
x
1
, x
2
0
Basic
9 12 0 0 0 0 0
c
j
1
x
2
s
1
s
2
s
3
s
4
s
5
9 x
1
4 1 0 14 25 0 0 0
0 s
5
1 0 0 14 15 0 0 1
0 s
3
12 0 0 74 225 1 0 0
0 s
4
3 0 0 14 25 0 1 0
12 x
2
6 0 1 14 15 0 0 0
z
j
108 9 12 34 65 0 0 0
c
j
z
j
0 0 34 65 0 0 0
b. What do the dual variables equal, and what does this dual solution mean?
1
and c
2
.
d. Determine the range for q
1
(process 1, labor hr).
e. Due to a problem with a supplier, only 100 pounds of material will be available for production
instead of 120 pounds. Will this affect the optimal solution mix?
48. A manufacturer produces products 1, 2, and 3 daily. The three products are processed through
three production operations that have time constraints, and the finished products are then stored.
The following linear programming model has been formulated to determine the number of prod-
uct 1(x
1
), product 2(x
2
), and product 3(x
3
) to produce.
maximize Z 40x
1
35x
2
45x
3
(profit, $)
subject to
2x
1
3x
2
2x
3
120 (operation 1, hr)
4x
1
3x
2
x
3
3x
1
2x
2
4x
3
x
1
x
2
x
3
40 (storage, ft
2
)
x
1
, x
2
, x
3
0
Basic
40 35 45 0 0 0 0
c
j
1
x
2
x
3
s
1
s
2
s
3
s
4
0 s
1
10 12 0 0 1 0 12 4
0 s
2
60 2 0 0 0 1 1 5
45 x
3
10 12 0 1 0 0 12 1
35 x
2
30 12 1 0 0 0 12 2
z
j
1,500 40 35 45 0 0 5 25
c
j
z
j
0 0 0 0 0 5 25
c. How does the fact that this is a multiple optimum solution affect the interpretation of the dual
solution values?
d. Determine the optimal range for c
2
.
e. Determine the feasible range for q
4
(square feet of storage space).
f. What is the maximum price the manufacturer would be willing to pay to lease additional stor-
age space, and how many additional square feet could be leased at that price?
49. A school dietitian is attempting to plan a lunch menu that will minimize cost and meet certain
minimum dietary requirements. The two staples in the meal are meat and potatoes, which provide
protein, iron, and carbohydrates. The following linear programming model has been formulated to
determine how many ounces of meat (x
1
) and ounces of potatoes (x
2
) to put in a lunch.
minimize Z 0.03x
1
0.02x
2
(cost, $)
Problems A-59
subject to
4x
1
5x
2
20 (protein, mg)
12x
1
3x
2
30 (iron, mg)
3x
1
2x
2
12 (carbohydrates, mg)
x
1
, x
2
0
Basic
0.03 0.02 0 0 0
c
j
1
x
2
s
1
s
2
s
3
0.02 x
2
3.6 0 1 0 0.20 0.80
0.03 x
1
1.6 1 0 0 0.13 0.20
0 s
1
4.4 0 0 1 0.47 3.2
z
j
0.12 0.03 0.02 0 0 0.01
z
j
c
j
0 0 0 0 0.01
1
and c
2
.
d. Determine the ranges for q
1
, q
2
, and q
3
(milligrams of protein, iron, and carbohydrates, respec-
tively).
e. What would it be worth for the school dietitian to be able to reduce the requirement for carbo-
hydrates, and what is the smallest number of milligrams of carbohydrates that would be
required at that value?
50. The Overnight Food Processing Company prepares sandwiches (among other processed food
items) for vending machines, markets, and business canteens around the city. The sandwiches are
made at night and delivered early the following morning. Any sandwiches not purchased during
the previous day are thrown away. Three kinds of sandwiches are made each night, a basic cheese
sandwich (x
1
), a ham salad sandwich (x
2
), and a pimento cheese sandwich (x
3
). The profits are
$1.25, $2.00, and $1.75, respectively. It takes 0.5 minutes to make a cheese sandwich, 1.2 minutes to
make a ham salad sandwich, and 0.8 minutes to make a pimento cheese sandwich. The company,
has 20 hours of labor available to produce the sandwiches each night. The demand for ham salad
sandwiches is at least as great as the demand for the two types of cheese sandwiches combined.
However, the company has only enough ham salad to produce 500 sandwiches per night. The com-
pany has formulated the following linear programming model in order to determine how many of
each type of sandwich to make to maximize profit.
maximize Z $1.25x
1
2.00x
2
1.75x
3
subject to
0.5x
1
1.2x
2
0.8x
3
1,200 (production time, min)
x
1
x
3
x
2
(demand for ham salad sandwiches)
x
2
500 (ham salad sandwich limit)
x
1
, x
2
, x
3
0
The optimal simplex tableau follows.
Basic
1.25 2.00 1.75 0 0 0
c
j
1
x
2
x
3
s
1
s
2
s
3
0 s
1
200 0.3 0 0 1 0.8 2
1.75 x
3
500 1 0 1 0 1 1
2.00 x
2
500 0 1 0 0 0 1
z
j
1,875 1.75 2.00 1.75 0 1.75 3.75
c
j
z
j
.5 0 0 0 1.75 3.75
a. Formulate the dual for this problem and define the dual variables.
b. Determine the optimal ranges for c
1
, c
2
, and c
3
.
c. Determine the range for q
3
(ham salad sandwiches).
d. Overnight Foods is considering advertising its cheese sandwiches to increase demand. The com-
pany estimates that spending $100 on some leaflets that would be packaged with all other sand-
wiches would increase the demand for both kinds of cheese sandwiches by 200. Should it make
this expenditure?
51. Given the linear programming model,
minimize Z 3x
1
5x
2
2x
3
subject to
x
1
x
2
3x
3
35
x
1
2x
2
50
x
1
x
2
25
x
1
, x
2
, x
3
0
and its optimal simplex tableau,
Basic
3 5 2 0 0 0
c
j
1
x
2
x
3
s
1
s
2
s
3
0 s
2
15 0 0 4 32 1 12
3 x
1
5 1 0 2 12 0 12
5 x
2
30 0 1 1 12 0 12
z
j
165 3 5 11 4 0 1
z
j
c
j
0 0 13 4 0 1
Problems A-61
a. Find the optimal ranges for all c
j
values.
b. Find the feasible ranges for all q
i
values.
52. The Sunshine Food Processing Company produces three canned fruit products mixed fruit (x
1
),
fruit cocktail (x
2
), and fruit delight (x
3
). The main ingredients in each product are pears and
peaches. Each product is produced in lots and must undergo three processes mixing, canning,
and packaging. The resource requirements for each product and each process are shown in the
following linear programming formulation.
maximize Z 10x
1
6x
2
8x
3
(profit, $)
subject to
20x
1
10x
2
16x
3
320 (pears, lb)
10x
1
20x
2
16x
3
400 (peaches, lb)
x
1
2x
2
2x
3
43 (mixing, hr)
x
1
x
2
x
3
60 (canning, hr)
2x
1
x
2
x
3
40 (packaging, hr)
x
1
, x
2
, x
3
0
The optimal simplex tableau is as follows.
Basic
10 6 8 0 0 0 0 0
c
j
1
x
2
x
3
s
1
s
2
s
3
s
4
s
5
10 x
1
8 1 0 815 115 130 0 0 0
6 x
2
16 0 1 815 130 115 0 0 0
0 s
3
3 0 0 25 0 110 1 0 0
0 s
4
36 0 0 115 130 130 0 1 0
0 s
5
8 0 0 35 10 0 0 0 1
z
j
176 10 6 12815 715 115 0 0 0
c
j
z
j
0 0 815 715 115 0 0 0
a. What is the maximum price the company would be willing to pay for additional pears? How
much could be purchased at that price?
b. What is the marginal value of peaches? Over what range is this price valid?
c. The company can purchase a new mixing machine that would increase the available mixing
time from 43 to 60 hours. Would this affect the optimal solution?
d. The company can also purchase a new packaging machine that would increase the available
packaging time from 40 to 50 hours. Would this affect the optimal solution?
e. If the manager were to attempt to secure additional units of only one of the resources, which
should it be?
53. The Evergreen Products Firm produces three types of pressed paneling from pine and spruce. The
three types of paneling are Western (x
1
), Old English (x
2
), and Colonial (x
3
). Each sheet must be cut
and pressed. The resource requirements are given in the following linear programming formulation.
maximize Z 4x
1
10x
2
8x
3
(profit, $)
subject to
5x
1
4x
2
4x
3
200 (pine, lb)
2x
1
5x
2
2x
3
160 (spruce, lb)
x
1
x
2
2x
3
50 (cutting, hr)
2x
1
4x
2
2x
3
80 (pressing, hr)
x
1
, x
2
, x
3
0
Basic
4 10 8 0 0 0 0
c
j
1
x
2
x
3
s
1
s
2
s
3
s
4
0 s
1
80 73 0 0 1 0 43 23
0 s
2
70 13 0 0 0 1 13 43
8 x
3
20 13 0 1 0 0 23 16
10 x
2
10 13 1 0 0 0 13 13
z
j
260 6 10 8 0 0 2 2
c
j
z
j
2 0 0 0 0 2 2
a. What is the marginal value of an additional pound of spruce? Over what range is this value
valid?
b. What is the marginal value of an additional hour of cutting? Over what range is this value valid?
c. Given a choice between securing more cutting hours or more pressing hours, which should
management select? Why?
d. If the amount of spruce available to the firm were decreased from 160 to 100 pounds, would this
reduction affect the solution?
e. What unit profit would have to be made from Western paneling before management would con-
sider producing it?
f. Management is considering changing the profit of Colonial paneling from $8 to $13. Would this
change affect the solution?
54. A manufacturing firm produces four products. Each product requires material and machine pro-
cessing. The linear programming model formulated to determine the number of product 1 (x
1
),
product 2 (x
2
), product 3 (x
3
), and product 4 (x
4
) to produce is as follows.
maximize Z 2x
1
8x
2
10x
3
6x
4
(profit, $)
subject to
2x
1
x
2
4x
3
2x
4
200 (material, lb)
x
1
2x
2
2x
3
x
4
160 (machine processing, hr)
x
1
, x
2
, x
3
, x
4
0
Problems A-63
Basic
2 8 10 6 0 0
c
j
1
x
2
x
3
x
4
s
1
s
2
6 x
4
80 1 0 2 1 23 13
8 x
2
40 0 1 0 0 13 23
z
j
800 6 8 12 6 43 103
c
j
z
j
4 0 2 0 43 103
What is the marginal value of an additional pound of material? Over what range is this value valid?

Module A2

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Module A2

Uploaded by

Copyright:

Available Formats

A-42 Module A The Simplex Solution Method

The value 360 can be eliminated, because q

The upper limit of means that q

The shadow prices are only valid

You might also like