AMS 341 (Spring, 2010) Exam 2 - Solution notes Estie Arkin

Mean 73.925, median 76, top quartile 87, high 99, low 12.
1. (10 points) I am planning a vacation once the spring semester is over. There are many tasks
that have to be completed before I can go. Fortunately, I can get help from family and friends.
The following are the tasks that would have to be undertaken before the vacation:

Task Predecessors Time (hours)

A - 2
B - 3
C A 1
D B 8
E B,C 7
F D,E 5

(a). Draw a project network.

C-1
A-2 2

4 E-7
1

B-3 dummy-0
F-5
D-8 5 6
3

Common mistakes: several start nodes, undirected edges, wrong predecessors.

(b). What is my critical path? You may find the path either by computing the total float for each
node, or by inspection. (Your answer should be a list all critical activities.) Tasks B,D,F (or nodes
1,3,5,6).
2. (10 points) Consider the following (minimum) Balanced Transportation problem: Find an initial
BFS for the problem using the min cost method:

1
 9 3 4 1
75 25 100

6 1 5 0
0 75 100
25

7 8 2 1
100 100

75 75 125 25

Common mistake: not enough basic variables. You should have 4 + 3 − 1 = 6.

3. (15 points) Plans are being made for the energy systems for a new building. The three possible
sources of energy are electricity, natural gas and a solar heating unit. The energy requirements are:
20 units of electricity, 10 units for water heating and 30 units for space heating. The size of the
roof limits the solar heater to 30 units. There is no limit on the amount of electricity or natural gas
bought. Electricity needs can only be met by buying electricity at a cost of $ 50 per unit. Other
energy needs can be met by any sources with the following unit costs:

Electricity Natural Gas Solar heater

Water heating $ 90 $ 60 $ 30
Space heating $ 80 $ 50 $ 40

Formulate a Balanced Transportation Problem to minimize the total cost of meeting the energy
needs. Give your formulation in terms of a cost and requirement table.

Electricity Water heating Space heating dummy supply

Electricity $ 50 $ 90 $ 80 $0 60
Natural Gas $M $ 60 $ 50 $0 40
Solar heater $M $ 30 $ 40 $0 30
demand 20 10 30 70

Common mistakes: Confusing Electricity supply (unlimited) and demand (20), having supply
be infinite instead of giving a large number, such as 60, forgetting to balance the problem.
4. (15 points) Consider the following Linear Programming problem:

max z = −4x1 − x2
s.t. 4x1 + 3x2 ≥6
x1 + 2x2 ≤3
3x1 + x2 =3
x1 , x2 ≥0

2
(a). What is the dual of the LP?

min w = 6y1 + 3y2 + 3y3

s.t. 4y1 + y2 + 3y3 ≥ −4
3y1 + 2y2 + y3 ≥ −1
y1 ≤ 0, y2 ≥ 0, y3 unrestricted

(b). The final tableau for the given LP is given below. e1 is the excess variable of the first constraint,
s2 the slack variable of the second constraint, and a1 , a3 the artificial variables of constraints 1,3.
The final tableau was found using the big M method. What is the optimal solution to the dual?
Make sure to state the objective value and the value of all dual variables.

z x1 x2 e1 s2 a1 a3 RHS
1 0 0 0 1/5 M M-7/5 -18/5
0 0 1 0 3/5 0 -1/5 6/5
0 1 0 0 -1/5 0 2/5 3/5
0 0 0 1 1 -1 1 0

w = −18/5, y1 = 0 y2 = 1/5 y3 = −7/5.

5. (15 points) I am planning a trip to Disneyworld and will buy a 5 day ticket. Each day I will go
to a single park, and I want to visit all 5 parks. The average wait in lines at each park depends
on the day of the week, so I want to plan my visit to minimize my average wait time. Solve the
problem as an assignment problem. Make sure to state which day is spent at each park.

Monday Tuesday Wednesday Thursday Friday

Magic Kingdom 24 33 30 35 37
Epcot 18 32 36 20 27
Hollywood Studios 30 40 27 25 27
Animal Kingdom 26 31 35 25 15
Typhoon Lagoon 24 25 34 28 32

Subtract the smallest element from each row:

Monday Tuesday Wednesday Thursday Friday
Magic Kingdom 0 9 6 11 13
Epcot 0 14 18 2 9
Hollywood Studios 5 15 2 0 2
Animal Kingdom 11 16 20 10 0
Typhoon Lagoon 0 1 10 4 8

Subtract the smallest element from each col:

Monday Tuesday Wednesday Thursday Friday
Magic Kingdom 0 8 4 11 13
Epcot 0 13 16 2 9
Hollywood Studios 5 14 0 0 2
Animal Kingdom 11 15 18 10 0
Typhoon Lagoon 0 0 8 4 8

3
 The zero’s can be covered by 4 lines, for example rows 3,4,5 and col1. The smallest uncovered
element is 2, we subtract 2 from uncovered elements and add 2 to elements that are double covered:

Monday Tuesday Wednesday Thursday Friday

Magic Kingdom 0 6 2 9 11
Epcot 0 11 14 0 7
Hollywood Studios 7 14 0 0 2
Animal Kingdom 13 15 18 10 0
Typhoon Lagoon 2 0 8 4 8

Now we get 5 zero’s each in a different row and col: Magic Kingdom-Monday, Epcot-Thursday,
Hollywood Studios-Wednesday, Animal Kingdom-Friday and Typhoon Lagoon-Tuesday.
6. (20 points) Tiffany is planning her summer vacation, in which she will visit several different
exciting cities. She is trying to choose which cities to visit. The table below shows the number of
days she feels she must devote to each city, the cost of visiting the city and the “enjoyment” she
will get out of visiting the city:

city 1 2 3 4 5 6 7
enjoyment 17 10 15 19 7 13 9
days to visit 4 1 3 2 2 1 4
cost $170 $210 $320 $240 $500 $120 $90

Cities 2 and 3 are mutually exclusive (she should not visit both). Cities 2,4,5 each have terrific
zoo, so Tiffany insists on visiting at least one of them. City 6 is on her way to city 7 so if she visits
city 7 she should also visit city 6.
Tiffany wishes to maximize her enjoyment, however she has only 10 days and $750 to spend.
Formulate an integer programming problem. (Do NOT solve - just formulate!)
(a). Define the variables: xi = 1 if Tiffany goes to city i and 0 if not. Common mistake: Let xi be
city i.
(b). What is the objective function? (Max or Min?)
max z = 17x1 + 10x2 + 15x3 + 19x4 + 7x5 + 13x6 + 9x7
(c). What are the constraints?

4x1 + 1x2 + 3x3 + 2x4 + 2x5 + 1x6 + 4x7 ≤ 10

170x1 + 210x2 + 320x3 + 240x4 + 50x5 + 120x6 + 90x7 ≤ 750
x2 + x3 ≤ 1
x2 + x4 + x5 ≥ 1
x7 ≤ x6
x1 , x2 , x3 , x4 , x5 , x6 , x7 binary
Common mistakes: forgetting to state variables are binay, x6 = x7 , x2 6= x3 . 7. (15 points)
My family is planning a vacation in Disneyworld. We have a total of 4 days, and we are trying
to decide how many days to spend in the Magic Kingdom, Epcot, Hollywood studios and Animal
Kingdom. We have decided to spend at most 2 days in any one park, and we do not have to visit
all 4 parks. We estimate the “fun value” we would get for spending some days at each park, and
want to maximize our total fun:

4
 0 days 1 day 2 days
Magic Kingdom 0 3 5
Epcot 0 1 2
Hollywood studios 0 3 4
Animal Kingdom 0 2 2

To solve the problem using Dynamic Programming define fi (s) = the maximum fun achievable in
stages i and above and number of days s. We let Magic Kingdom be stage 1, Epcot stage 2 etc.
f4 (0) = 0, f4 (1) = 2, f4 (2) = f4 (3) = f4 (4) = 2, f3 (0) = 0, f3 (1) = max{0 + 2, 3 + 0} = 3,
f3 (2) = max{0 + 2, 3 + 3, 4 + 0} = 5,f3 (3) = f3 (4) = max{0 + 2, 3 + 2, 4 + 2} = 6, f2 (0) = 0,
f2 (1) = max{0+3, 1+0} = 3, f2 (2) = max{0+5, 1+3, 2+0} = 5, f2 (3) = max{0+6, 1+5, 2+3} = 6,
f2 (4) = max{0 + 6, 1 + 6, 2 + 5} = 7,
f1 (4) = max{0 + 7, 3 + 6, 5 + 5, } = 10,
2 days in Magic Kingdom, 0 days in Epcot and 1 day each in Hollywood Studios and Animal
Kingdom.
Common mistake: Calculating f1 (2) instead of 4. Giving an answer with no (or incorrect) work.