RESPUESTAS DEL PRIMER

EXAMEN
M. EN C. EDUARDO BUSTOS
FARÍAS

1
TIPO A

2
 PROBLEM 1
The Apex Television Company has to decide on the number of 27- and
20-inch sets to be produced at one of its factories. Market research
indicates that at most 40 of the 27-inch sets and 10 of the 20-inch
sets can be sold per month. The maximum number of work-hours
available is 500 per month. A 27-inch set requires 20 work-hours
and a 20-inch set requires 10 work-hours. Each 27-inch set sold
produces a profit of $120 and each 20-inch set produces a profit of
$80. A wholesaler has agreed to purchase all the television sets
produced if the numbers do not exceed the maxima indicated by the
market research.
(a) Formulate a linear programming model for this problem.
(b) Use the graphical method to solve this model.

3
SOLUCIÓN

4
 (a) Formulate a linear programming
model for this problem.
The decisions that need to be made are the number of 27-
inch and 20-inch TV sets to be produced per month by
the Apex Television Company. Therefore, the decision
variables for the model are

x1 = number of 27-inch TV sets to be produced per

month,
x2 = number of 20-inch TV sets to be produced per
month.
Also let
Z = total profit per month.

5
 The model now can be formulated in terms of these
variables as follows.
The total profit per month is Z = 120 x1 + 80 x2.
The resource constraints are:
Number of 27-inch sets sold per month: x1 ≤ 40
Number of 20-inch sets sold per month: x2 ≤ 10
Work-hours availability: 20 x1 + 10 x2 ≤ 500.
Nonnegativity constraints on TV sets produced:
x1 ≥ 0
x2 ≥ 0
With the objective of maximizing the total profit per month,
the LP model for this problem is

6
Maximize Z = 120 x1 + 80 x2,
subject to
x1 ≤ 40
x2 ≤ 10
20 x1 + 10 x2 ≤ 500
and
x1 ≥ 0, x2 ≥ 0.

7
(b) Use the graphical method to
solve this model.

8
 PROBLEM 2.
• Dwight is an elementary school teacher who
also raises pigs for supplemental income. He is
trying to decide what to feed his pigs. He is
considering using a combination of pig feeds
available from local suppliers. He would like to
feed the pigs at minimum cost while also making
sure each pig receives an adequate supply of
calories and vitamins. The cost, calorie content,
and vitamin content of each feed are given in the
table below.
9
Each pig requires at least 8,000 calories per day and at
least 700 units of vitamins. A further constraint is that no
more than one-third of the diet (by weight) can consist of
Feed Type A, since it contains an ingredient which is
toxic if consumed in too large a quantity.
(a) Formulate a linear programming model for this
problem.
(b) Use the graphical method to solve this model.
(c) What is the resulting daily cost per pig?
10
SOLUCIÓN

11
 (a) Formulate a linear programming
model for this problem.
Let A and B be the quantity (pounds) of Feed Type A and Feed Type B,
respectively, used per day. Also let Z be the total daily cost of the
feed per pig. Then, the daily cost is
Z = $0.4 A + $0.8 B.
The constraints on the minimum daily requirements of calories and
vitamins are
Calories requirement: 800 A + 1000 B ≥ 8,000.
Vitamins requirement: 140 A + 70 B ≥ 700.
Also, Dwight needs to avoid using too much of Feed Type A because of
the toxic ingredient in it. The toxic constraint is
A ≤ 1/3 (A+B),
which reduces to 2/3 A - 1/3 B ≤ 0.
Nonnegativity constraints: A ≥ 0, B ≥ 0.

12
 The resulting linear programming model for this
problem is
Minimize Z = 0.4 A + $0.8 B,
subject to
800 A + 1000 B ≥ 8000
140 A + 70 B ≥ 700
2/3 A - 1/3 B ≤ 0
and
A ≥ 0, B ≥ 0.

13
(b) Use the graphical method to
solve this model.

14
 C) What is the resulting daily
cost per pig?
• As shown below, the optimal solution is (A,
B) = (20/7, 40/7). The resulting daily cost
per pig is Z = 40/7 = $5.71.

15
 PROBLEM 3.
• The Fagersta Steelworks currently is working two mines
to obtain its iron ore. This iron ore is shipped to either of
two storage facilities. When needed, it then is shipped on
to the company’s steel plant. The diagram below depicts
this distribution network, where M1 and M2 are the two
mines, S1 and S2 are the two storage facilities, and P is
the steel plant. The diagram also shows the monthly
amounts produced at the mines and needed at the plant,
as well as the shipping cost and the maximum amount
that can be shipped per month through each shipping
lane.

16
 40 tons $2,000/ton S1 $400/ton
produced M1 30 tons max. 70 tons max.
$1,700/ton
30 tons max.
P 100 tons
needed
$1,600/ton
50 tons max. $800/ton
$1,100/ton 70 tons max.
60 tons M2 S2
produced 50 tons max.

Management now wants to determine the

most economic plan for shipping the iron
ore from the mines through the distribution
network to the steel plant.
(a) Formulate a linear programming
model for this problem.
17
SOLUCIÓN

18
 (a) Formulate a linear programming
model for this problem.
The decision variables are defined as follows:
xm1-s1 : number of units (tons) shipped from Mine 1 to Storage Facility 1,
xm1-s2 : number of units (tons) shipped from Mine 1 to Storage Facility 2,
xm2-s1 : number of units (tons) shipped from Mine 2 to Storage Facility 1,
xm2-s2 : number of units (tons) shipped from Mine 1 to Storage Facility 2,
xs1 -p : number of units (tons) shipped from Storage Facility 1 to the Plant,
xs2 -p : number of units (tons) shipped from Storage Facility 2 to the Plant.

The total shipping cost is:

Z = 2000 xm1-s1 + 1700 xm1-s2 + 1600 xm2-s1 + 1100 xm2-s2 + 400 xs1-p + 800 xs2-p

19
The constraints we need to consider are:

Supply constraint on M1 and M2:

xm1-s1 + xm1-s2 = 40
xm2-s1 + xm2-s2 = 60
Conservation-of-flow constraint on S1 and S2:
xm1-s1 + xm2-s1 - xs1-p = 0
xm1-s2 + xm2-s2 - xs2-p = 0
Demand constraint on P:
xs1-p + xs2-p = 100
Capacity constraints:

xm1-s1 ≤ 30, xm1-s2 ≤ 30

xm2-s1 ≤ 50, xm2-s2 ≤ 50
xs1-p ≤ 70, xs2-p ≤ 70
Nonnegativity constraints:

xm1-s1 ≥ 0, xm1-s2 ≥ 0
xm2-s1 ≥ 0, xm2-s2 ≥ 0
xs1-p ≥ 0, xs2-p ≥ 0

20
 The resulting linear programming
model for this problem is:
Maximize Z = 2000 xm1-s1 + 1700 xm1-s2 + 1600 xm2-s1 + 1100 xm2-s2 + 400 xs1-p + 800 xs2-p,
subject to
xm1-s1 + xm1-s2 = 40
xm2-s1 + xm2-s2 = 60
xm1-s1 + xm2-s1 - xs1-p = 0
xm1-s2 + xm2-s2 - xs2-p = 0
xs1-p + xs2-p = 100
xm1-s1 ≤ 30, xm1-s2 ≤ 30
xm2-s1 ≤ 50, xm2-s2 ≤ 50
xs1-p ≤ 70, xs2-p ≤ 70
and
xm1-s1 ≥ 0, xm1-s2 ≥ 0
xm2-s1 ≥ 0, xm2-s2 ≥ 0
xs1-p ≥ 0, xs2-p ≥ 0

21