Introduction To Management Science 11th Edition Taylor Solutions Manual

Introduction to Management Science
11th Edition Taylor Solutions Manual

Visit to download the full and correct content document: https://testbankdeal.com/dow
nload/introduction-to-management-science-11th-edition-taylor-solutions-manual/
Chapter Seven: Network Flow Models
PROBLEM SUMMARY 37. Maximal flow (7–36)

38. Maximal flow
1. Shortest route
39. Maximal flow
2. Shortest route
40. Maximal flow
3. Shortest route
41. Maximal flow (6–42)
4. Shortest route
5. Shortest route PROBLEM SOLUTIONS
6. Shortest route
7. Shortest route 1.
8. Shortest route
9. Shortest route
10. Shortest route
11. Shortest route
12. Shortest route
13. Shortest route
14. Shortest route
15. Shortest route
16. Shortest route
17. Shortest route
18. Minimal spanning tree
26. Minimal spanning tree (7–9)
29. Maximal flow
30. Maximal flow
31. Maximal flow
32. Maximal flow
33. Maximal flow
34. Maximal flow
35. Maximal flow
36. Maximal flow
7-1
Copyright © 2013 Pearson Education, Inc. publishing as Prentice Hall
7-2
2.
7-3
3.
7-4
4.
7-5
7-6
5.
7-7
7-8
6.
7-9
7-10
7-11
7.
7-12
7-13
8.
7-14
7-15
9.
Solution Steps Branch Added Branch Distance Total Distance from Origin
1 1–3 2 2
2 1–4 3 3
3 1–7 4 4
4 3–2 4 6
5 2–5 2 8
6 7–6 5 9
7 7–8 6 10
8 4–11 7 10
9 3–9 12 14
10 6–10 6 15
11 10–12 3 18
Shortest route path = 1–7–6–10–12
7-16
10.
Step Permanent Set Branch Added Distance
1 {1} 1–3 73
2 {1,3} 1–2 89
3 {1,2,3} 1–4 96
4 {1,2,3,4} 3–7 154
5 {1,2,3,4,7} 2–5 164
6 {1,2,3,4,5,7} 3–6 167
7 {1,2,3,4,5,6,7} 4–8 177
8 {1,2,3,4,5,6,7,8} 7–9 208
9 {1,2,3,4,5,6,7,8,9} 7–10 239
10 {1,2,3,4,5,6,7,8,9,10} 9–12 263
11 {1,2,3,4,5,6,7,8,9,10,12} 8–11 283
12 {1,2,3,4,5,6,7,8,9,10,11,12} 10–13 323
11. 1 – 4 – 7 – 8 = 42 miles 17. This is an example of the application of the

shortest route method to solve the scheduled
12. 1 – 4 – 7 – 10 – 12 – 16 – 17 = 14 days replacement problem. The branch costs are
13. 1 – 3 – 11 – 14 = 13 days determined using the formula,
14. 1 – 3 – 5 – 12 – 16 – 20 – 22 = 114 cij = maintenance cost for year i, i + 1,…, +
cost of purchasing a new car at the beginning
15. Kotzebue: 1 – 2 – 8 – 11 – 15 = 10 hours of year i – selling price of a used car at the
Nome: 1 – 2 – 8 – 12 – 13 = 9 hours beginning of year j.
Stebbins: 1 – 2 – 7 – 10 = 8.5 hours c12 = 3 + 26 – 15 = 14
16. (a) Shortest route solution from St. Louis. c13 = 3 + 4.5 + 26 – 12 = 21.5
(1) St. Louis – (5) St. Joseph – c14 = 3 + 4.5 + 6 + 26 – 8 = 31.5
(7) Ft. Kearney – (9) Ft. Laramie – c15 = 3 + 4.5 + 6 + 8 + 26 – 4 = 43.5
(11) Ft. Bridger – (13) Ft. Hall – (15) Ft. c16 = 3 + 4.5 + 6 + 8 + 11 + 26 – 2 = 56.5
Boise – (17) Ft. Vancouver = 186 days
c17 = 3 + 4.5 + 6 + 8 + 11 + 14 + 26 + 28.5 – 0 = 101
(b) Shortest route solution from Ft. Smith,
c23 = 3 + 26.5 – 15 = 14.5
Arkansas.
c24 = 3 + 4.5 + 26.5 – 12 = 22
(2) Ft. Smith – (8) Ft. Vasquez –
(11) Ft. Bridger – (13) Ft. Hall – (15) Ft. c25 = 3 + 4.5 + 6 + 26.5 – 8 = 32
Boise – (17) Ft. Vancouver = 182 days c26 = 3 + 4.5 + 6 + 8 + 26.5 – 4 = 44
c27 = 3 + 4.5 + 6 + 8 + 11 + 26.5 – 2 = 57
c34 = 3 + 27 – 15 = 15
c35 = 3 + 4.5 + 27 – 12 = 22.5
c36 = 3 + 4.5 + 6 + 27 – 8 = 32.5
c37 = 3 + 4.5 + 6 + 8 + 27 – 4 = 44.5
7-17
c45 = 3 + 27.5 – 15 = 15.5
c46 = 3 + 4.5 + 27.5 – 12 = 23
c47 = 3 + 4.5 + 6 + 27.5 – 8 = 33
c56 = 3 + 28 – 15 = 16
c57 = 3 + 4.5 + 28 – 12 = 23.5
c67 = 3 + 28.5 – 15 = 16.5
Solution: 1 – 4 – 7 = $64.5 = $64,500
A car should be sold at end of year 3 (beginning of year 4) and a new one purchased.
101
57
56.5
43.5 44 44.5
32 32.5 33
31.5
22 22.5 23 23.5
21.5
14 14.5 15 15.5 16 16.5

1 2 3 4 5 6 7
Beginning of End of
Year 1 Year 6
18.
19. 1–3, 4.1
1–4, 4.8
2–3, 3.6
4–8, 5.5
5–6, 2.1
6–7, 2.8
7–8, 2.7
minimum distance = 70 7–9, 2.7
1–3 9–10, 4.6
2–4 32.9 = 32,900 feet
3–4
4–6
4–7
5–7
7-18
20.
1–2
1–3
2–4
3–6
5–6
6–7
7–8
21.
1–3
2–3
3–4
4–6
5–6
5–8
6–7
22.
1–2
2–3
3–6
4–8
5–6
6–7
7–9
7–8
9–10
7-19
23. 25.
1–2
2–4
1–4
2–5
2–4
3–4
3–6
4–7
4–6
5–6
5–7
6–8
6–7
8–9
7–8
26.
24.
1–4
2–3
3–4
3–5
5–6
5–7
5–8
7-20
27.
7
92 88 13
3
63 10
1 76 6
107 67 61
84 12
112 4 9 82
73
2
11 14
95
5 8
86
Total sidewalk = 1,086 ft.
28. 1 – 2 = 48
1 – 4 = 52
4 – 7 = 35
3 – 5 = 39
5 – 6 = 29
5 – 8 = 56
5 – 9 = 48
6 – 7 = 80
9 – 10 = 71
9 – 12 = 71
10 – 11 = 38
11 – 14 = 57
12 – 13 = 105
Total = 729
29.
7-21
30.
7-22
31.
7-23
7-24
32.
7-25
7-26
33.
7-27
Maximal flow network:
34.
7-28
35.
Allocation
Branch in Which
Flow Total Capacity
Step Path Amount Is Used
1 1–2–5–7–9 4 2–5
2 1–3–5–7–9 3 3–5
3 1–3–6–8–9 2 1–3, 3–6
4 1–4–6–8–9 4 4–6, 6–8, 8–9
Maximum flow = 13,000 cars
4 0
4 4
0 4 4 1 6
2 2
0 3 4
2 2 7 6 0 4
0 3
0 5 7 8 6 6
3 0 4 2 4
7 2 2 3 3 4
13 0 6 0 13
4 0 0 2 12
12 1 3 20 0 9
2 0
4 2 0 6 4
6 1 0 4
5 2 3 6
2 0 6 6
6 0
6 8
5 0 4 2
4
40 4 0 26
4
36.
7-29
Allocation solution
Step Path Flow Amount x12 = 6 x45 = 8
x13 = 2 x57 = 13
1 1–2–5–7–10 3
x14 = 8 x58 = 4
2 1–2–5–8–10 4
x25 = 0 x59 = 1
3 1–3–5–9–10 1
x26 = 6 x68 = 2
4 1–3–5–2–6–8–10 3
x35 = 0 x69 = 6
5 1–3–5–2–6–9–10 3
x36 = 2 x7,10 = 3
6 1–3–6–9–10 5
x8,10 = 6
Maximum flow = 17,000 units
x9,10 = 7
37. This problem is solved using Excel with Z = 16 = 16,000 units
the addition of a cost constraint to the
Total cost = 684 = $684,000
normal linear programming formulation
for a maximum flow problem, as follows, 38.
Maximize Z = x10,1
subject to:
x10,1 – x12 – x13 – x14 = 0
x12 – x25 – x26 = 0
x13 – x35 – x36 = 0
x14 – x45 – x46 = 0
x25 + x35 + x45 – x57 – x58 – x59 = 0
x26 + x36 – x68 – x69 = 0
x57 – x7,10 = 0
x58 + x68 – x8,10 = 0 Allocation
x59 + x69 – x9,10 = 0 Path Flow Amount
x7,10 + x8,10 + x9,10 – x10,1 = 0 1–2–5–8–10 7
1–4–7–10 5
x 12 ≤ 7 x57 ≤ 3
1–3–6–9–10 3
x 13 ≤ 10 x58 ≤ 4
1–4–7–9–10 7
x 14 ≤ 8 x 59 ≤ 1
1–3–4–5–7–9–10 6
x 25 ≤ 9 x 68 ≤ 6 1–4–6–7–8–10 3
x 26 ≤ 6 x 69 ≤ 8 1–4–6–9–10 1
x 35 ≤ 7 x 7,10 ≤ 8 Maximum flow = 32
x 36 ≤ 5 x 8,10 ≤ 7
x 45 ≤ 10 x9,10 ≤ 7 Branch Allocation Branch Allocation
x 10,1 ≤ 100 1–2 7 5–7 6
3(x12 + x13 + x14) + 5(x25 + x26) + 7(x35 + x36) + 1–3 9 5–8 7
4(x45) + 22(x57 + x58 + x59) + 19(x68 + x69) + 1–4 16 6–7 3
12x7,10 + 14x8,10 + 16x9,10 ≤ 700 2–4 0 6–9 4
2–5 7 7–8 3
3–4 6 7–9 13
3–6 3 7–10 5
4–5 6 8–10 10
4–6 4 9–10 17
4–7 12
7-30
39. 1–2–6–10–12–13–15 = 25 40. 1–2 = 16 3–4 = 16
1–2–6–12–13–15 = 35 2–5 = 12 4–10 = 4
1–2–9–12–15 = 10 5–7 = 12 9–10 = 4
1–3–6–10–12–15 = 30 2–6 = 12 10–13 = 8
1–3–7–10–13–15 = 20 6–7 = 4 13–14 = 4
1–4–7–10–13–15 = 20 7–12 = 16 4–8 = 12
1–4–7–6–10–13–15 = 10 12–15 = 22 8–14 = 12
1–4–7–6–12–15 = 5 1–3 = 22 14–15 = 16
1–4–8–13–15 = 25 3–9 = 6
1–5–8–13–15 = 35 9–11 = 2
1–5–8–14–15 = 5 11–12 = 2
1–5–11–14–15 = 30 13–12 = 4
maximum flow = 250 Total traffic = 38,000 cars.
Branch Allocation Branch Allocation 41. Gdansk – Galveston = 125
1–2 70 7–6 15 Hamburg – Jacksonville = 110
1–3 50 8–13 60 Hamburg – New Orleans = 95
1–4 60 8–14 5 Hamburg – Galveston = 5
1–5 70 9–12 45
Lisbon – Norfolk = 85
2–6 25 10–12 55
2–9 45 10–13 50 Norfolk – KC = 75
3–6 30 11–14 30 Norfolk – Dallas = 10
3–7 20 12–13 60 Jacksonville – FR = 70
4–7 35 12–15 45 Jacksonville – KC = 40
4–8 25 13–15 170
5–8 40 14–15 35 NO – FR = 95
5–11 30 Galveston – Dallas = 130
6–10 65 FR – Denver = 105
6–12 5 FR – Pittsburgh = 60
7–10 40
KC – Cleveland = 65
KC – Nashville = 50
Dallas – Tucson = 85
Dallas – Cleveland = 55
7-31
Norfolk Denver
85
8 9 22 105
Gdansk Front Royal

125 170
2 3 16 17
Jacksonville Tucson
10 110 11 23 85
KC
125 Pittsburgh
Hamburg 240
210 18 19
1 4
210
5 24 60 27 420
160 New
Orleans
100 120
12 13
25
Cleveland
140
20 21
50
Dallas
160
6 7 26
Lisbon Nashville
130
14 15
Galveston
*CASE SOLUTION: THE PEARLSBURG RESCUE SQUAD
The network for the Pearlsburg Rescue Squad follows.
The shortest route solution to each network node is as follows:

1–2 = 10 min l–4–6–8 = 29 min
1–3 = 15 min l–4–6–9 = 24 min
1–4 = 12 min 1–4–10 = 23 min
1–2–5 = 24 min l–4–6–8–11 = 35 min
1–4–6 = 19 min 1–4–6–9–12 = 35 min
1–2–7 = 30 min l–4–6–8–13 = 44 min
7-32
CASE SOLUTION: AROUND THE (11) Bouillon – (12) Florenville = 7
WORLD IN 80 DAYS (11) Bouillon – (16) Paliseul = 16
(12) Florenville – (13) Tintigny = 7
Using QSB+, the following optimal route for (13) Tintigny – (17) Neufchateau = 12
Phileas Fogg was determined (which is (14) Arlon – (18) Martelange = 8
approximately the same route he travelled in the
book). (15) Luxembourg – (19) Diekirch = 21
1(London) – 6(Paris) – 7(Barcelona) – (16) Paliseul – (20) Recogne = 16
12(Naples) – 17(Athens) – 22(Cairo) – (17) Neufchateau – (18) Martelange = 12
23(Aden) – 28(Bombay) – 31(Calcutta) – (18) Martelange – (21) Bastogne = 23
33(Singapore) – 35(Hong Kong) –
37(Shanghai) – 39(Yokohama) – 41(San (19) Diekirch – (21) Martelange = 3
Francisco) – 47(Denver) – 50(Chicago) – (19) Diekirch – (21) Bastogne = 18
53(New York) – 1(London) = 81 days
(19) Diekirch – (18) Martelange = 3
Note that 3 additional “end” nodes were added to
(20) Recogne – (21) Bastogne = 16
the network for computer solution – 55, 56 and 57.
Node 55 replaced node 3 (Casablanca); node 56 Total flow = 57,000 troops
replaced node 2 (Lisbon), and node 57 replaced
node 1 (London) at the end of the network. CASE SOLUTION: NUCLEAR
Additional branches were added to connect WASTE DISPOSAL AT PAWV
Casablanca with Lisbon (56–57) and Lisbon with
London (56–57). POWER AND LIGHT
Although it appears that Phileas Fogg lost his
wager, recall that, as in the novel, he travelled This is a “modified” shortest route problem.
toward the east and eventually crossed the Instead of the minimum time as the objective
international date line. This saved him one day and function the population traveled through should be
allowed him to win his wager once he realized (just minimized. The time (which would normally be the
in time) the error in his calculations. objective function) should be a constraint ≤ 42
hours.
CASE SOLUTION: BATTLE Solution:
OF THE BULGE (1) Pittsburgh - (2) Columbus
(2) Columbus - (7) Cincinnati
(1) Verdun – (2) Stenay = 8 (7) Cincinnati - (11) Indianapolis
(1) Verdun – (3) Montmedy = 23 (11) Indianapolis - (15) Springfield - (16)
(1) Verdun – (5) Etain = 26 Davenport/Moline/Rock Island
(2) Stenay – (11) Bouillon = 8 (16) Davenport/Moline/Rock Island -
(19) Des Moines
(3) Montmedy – (6) Virton = 10
(19) Des Moines - (23) Omaha
(3) Montmedy – (11) Bouillon = 15
(23) Omaha - (28) Cheyenne
(4) Longuyen – (3) Montmedy = 2
(28) Cheyenne - (31) Salt Lake City
(4) Longuyen – (7) Longwy = 5
(31) Salt Lake City - (33) Nevada Site
(5) Etain – (4) Longuyen = 7
Total time = 41.7 hours
(5) Etain – (8) Briey = 10
Total population (Z) = 8.23 million
(5) Etain – (9) Havange = 9
(6) Virton – (13) Tintigny = 10
(7) Longwy – (14) Arlon = 9
(8) Briey – (10) Thionville = 10
(9) Havange – (15) Luxembourg = 8
(10) Thionville – (15) Luxembourg = 7
(10) Thionville – (9) Havange = 3
7-33
CASE SOLUTION: A DAY IN PARIS The first thing the student will need to do is
download a copy of the Metro map from the Web
site given in the problem. The map is very
There is no direct network technique (from this detailed, and color-coded, and shows all the
chapter) that will solve this problem and that will stations. They will then (using the Internet) have
result in an optimal solution. It is more a “test” of to locate the sites on the Metro map so they’ll
the students’ ability to use logic and a systematic know which subway station corresponds to each
approach based on the network analysis concepts site.
from this chapter to find a “good” solution. In
other words, it is a network problem, but it does One possible approach is to use the minimal
not fit into any of the somewhat narrow, spanning tree technique to determine a “first”
straightforward solution techniques that are possible solution and then logically adjust the tree
required in most homework problems, i.e., it to improve the solution, since all sites will be
requires the student to “think.” The problem is connected to a tree, thus resulting in some degree
also intended to be a “fun” exercise enabling the of “back tracking.” Another possible approach is
student to use the Internet on an interesting topic. to use the shortest route technique to find the
Students may apply elements of the shortest route shortest route to the closest site, or “a” site, and
technique and/or the minimal spanning tree then once that is determined, use it to find the next
technique, or some other logical approach or shortest route and so on.
technique of their own derivation. (The problem
almost fits into the classic “traveling salesman
problem” model, except that Kathleen does not
have to make an optimal closed loop back to her
starting destination; in any event it would be an
enormous traveling salesman problem).
It is suggested that an interesting and possibly
“fun” class assignment might be to have all the
students in the class compete to find the best, i.e.,
most time efficient, route for the sites Kathleen
wants to see.
7-34

Introduction To Management Science 11th Edition Taylor Solutions Manual

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

Introduction To Management Science 11th Edition Taylor Solutions Manual

Uploaded by

Copyright:

Available Formats

Introduction to Management Science

11th Edition Taylor Solutions Manual

PROBLEM SUMMARY 37. Maximal flow (7–36)

11. 1 – 4 – 7 – 8 = 42 miles 17. This is an example of the application of the

14 14.5 15 15.5 16 16.5

Gdansk Front Royal

*CASE SOLUTION: THE PEARLSBURG RESCUE SQUAD

The network for the Pearlsburg Rescue Squad follows.

The shortest route solution to each network node is as follows:

You might also like