Submit Search
Upload
352735336 rsh-qam11-tif-11-doc
•
Download as DOC, PDF
•
0 likes
•
1,473 views
Firas Husseini
Follow
Quantitative Analysis for Management, 11e (Render)
Read less
Read more
Business
Report
Share
Report
Share
1 of 32
Download now
Recommended
352735352 rsh-qam11-tif-09-doc
352735352 rsh-qam11-tif-09-doc
Firas Husseini
352735322 rsh-qam11-tif-03-doc
352735322 rsh-qam11-tif-03-doc
Firas Husseini
Rsh qam11 ch09 ge
Rsh qam11 ch09 ge
Firas Husseini
352735340 rsh-qam11-tif-12-doc
352735340 rsh-qam11-tif-12-doc
Firas Husseini
7734376
7734376
Firas Husseini
Case analysis of thomas green
Case analysis of thomas green
Kaushik Chakraborty
352735327 rsh-qam11-tif-04-doc
352735327 rsh-qam11-tif-04-doc
Firas Husseini
Airborne presentation
Airborne presentation
Yamna Rashid
Recommended
352735352 rsh-qam11-tif-09-doc
352735352 rsh-qam11-tif-09-doc
Firas Husseini
352735322 rsh-qam11-tif-03-doc
352735322 rsh-qam11-tif-03-doc
Firas Husseini
Rsh qam11 ch09 ge
Rsh qam11 ch09 ge
Firas Husseini
352735340 rsh-qam11-tif-12-doc
352735340 rsh-qam11-tif-12-doc
Firas Husseini
7734376
7734376
Firas Husseini
Case analysis of thomas green
Case analysis of thomas green
Kaushik Chakraborty
352735327 rsh-qam11-tif-04-doc
352735327 rsh-qam11-tif-04-doc
Firas Husseini
Airborne presentation
Airborne presentation
Yamna Rashid
Management Global 13th Edition Robbins Test Bank
Management Global 13th Edition Robbins Test Bank
HashimLester
352735343 rsh-qam11-tif-07-doc
352735343 rsh-qam11-tif-07-doc
Firas Husseini
Southwest Airlines Case Study
Southwest Airlines Case Study
Morteza Javadinia Azari
Quantitative Management - Ch 11 Network Models
Quantitative Management - Ch 11 Network Models
Agnes Puspita
277435008 thomas-green
277435008 thomas-green
Paula912226
A Day of the Life of a Project Manager
A Day of the Life of a Project Manager
reeza fazily
International Strategy Fed Ex Presentation
International Strategy Fed Ex Presentation
Albin1984
The Walt Disney: The Entertainment King
The Walt Disney: The Entertainment King
Anuj Poddar
03 decision analysis
03 decision analysis
Firas Husseini
Power, office politics, and a career in crisis
Power, office politics, and a career in crisis
Ebtesam Elias
Kodak case analysis
Kodak case analysis
Devika Thennakoon
Case study strategic management
Case study strategic management
Athanasios Pitatzis
Airborne express case q&a
Airborne express case q&a
Utsav Mone
CEO GE Jeff Immelt Case Study
CEO GE Jeff Immelt Case Study
Mahammad Khadafi
200844797 rsh-qam11-tif-01-doc
200844797 rsh-qam11-tif-01-doc
Firas Husseini
Royal Bank of scotland case study
Royal Bank of scotland case study
DS Adi Pratomo
Nike Cost of Capital
Nike Cost of Capital
Fadila Pratika Alimuddin
Amex, hungary Amex Petroleum Case study
Amex, hungary Amex Petroleum Case study
MOHAMMAD KHALIFA
Goal Programming
Goal Programming
Evren E
Quantitative Analysis For Management 13th Edition Render Test Bank
Quantitative Analysis For Management 13th Edition Render Test Bank
Jescieer
352735352 rsh-qam11-tif-09-doc
352735352 rsh-qam11-tif-09-doc
BookStoreLib
Network analysis
Network analysis
Moudud Hasan
More Related Content
What's hot
Management Global 13th Edition Robbins Test Bank
Management Global 13th Edition Robbins Test Bank
HashimLester
352735343 rsh-qam11-tif-07-doc
352735343 rsh-qam11-tif-07-doc
Firas Husseini
Southwest Airlines Case Study
Southwest Airlines Case Study
Morteza Javadinia Azari
Quantitative Management - Ch 11 Network Models
Quantitative Management - Ch 11 Network Models
Agnes Puspita
277435008 thomas-green
277435008 thomas-green
Paula912226
A Day of the Life of a Project Manager
A Day of the Life of a Project Manager
reeza fazily
International Strategy Fed Ex Presentation
International Strategy Fed Ex Presentation
Albin1984
The Walt Disney: The Entertainment King
The Walt Disney: The Entertainment King
Anuj Poddar
03 decision analysis
03 decision analysis
Firas Husseini
Power, office politics, and a career in crisis
Power, office politics, and a career in crisis
Ebtesam Elias
Kodak case analysis
Kodak case analysis
Devika Thennakoon
Case study strategic management
Case study strategic management
Athanasios Pitatzis
Airborne express case q&a
Airborne express case q&a
Utsav Mone
CEO GE Jeff Immelt Case Study
CEO GE Jeff Immelt Case Study
Mahammad Khadafi
200844797 rsh-qam11-tif-01-doc
200844797 rsh-qam11-tif-01-doc
Firas Husseini
Royal Bank of scotland case study
Royal Bank of scotland case study
DS Adi Pratomo
Nike Cost of Capital
Nike Cost of Capital
Fadila Pratika Alimuddin
Amex, hungary Amex Petroleum Case study
Amex, hungary Amex Petroleum Case study
MOHAMMAD KHALIFA
Goal Programming
Goal Programming
Evren E
Quantitative Analysis For Management 13th Edition Render Test Bank
Quantitative Analysis For Management 13th Edition Render Test Bank
Jescieer
What's hot
(20)
Management Global 13th Edition Robbins Test Bank
Management Global 13th Edition Robbins Test Bank
352735343 rsh-qam11-tif-07-doc
352735343 rsh-qam11-tif-07-doc
Southwest Airlines Case Study
Southwest Airlines Case Study
Quantitative Management - Ch 11 Network Models
Quantitative Management - Ch 11 Network Models
277435008 thomas-green
277435008 thomas-green
A Day of the Life of a Project Manager
A Day of the Life of a Project Manager
International Strategy Fed Ex Presentation
International Strategy Fed Ex Presentation
The Walt Disney: The Entertainment King
The Walt Disney: The Entertainment King
03 decision analysis
03 decision analysis
Power, office politics, and a career in crisis
Power, office politics, and a career in crisis
Kodak case analysis
Kodak case analysis
Case study strategic management
Case study strategic management
Airborne express case q&a
Airborne express case q&a
CEO GE Jeff Immelt Case Study
CEO GE Jeff Immelt Case Study
200844797 rsh-qam11-tif-01-doc
200844797 rsh-qam11-tif-01-doc
Royal Bank of scotland case study
Royal Bank of scotland case study
Nike Cost of Capital
Nike Cost of Capital
Amex, hungary Amex Petroleum Case study
Amex, hungary Amex Petroleum Case study
Goal Programming
Goal Programming
Quantitative Analysis For Management 13th Edition Render Test Bank
Quantitative Analysis For Management 13th Edition Render Test Bank
Similar to 352735336 rsh-qam11-tif-11-doc
352735352 rsh-qam11-tif-09-doc
352735352 rsh-qam11-tif-09-doc
BookStoreLib
Network analysis
Network analysis
Moudud Hasan
Bca3040– data communication
Bca3040– data communication
smumbahelp
A Minimum Spanning Tree Approach of Solving a Transportation Problem
A Minimum Spanning Tree Approach of Solving a Transportation Problem
inventionjournals
A Minimum Spanning Tree Approach of Solving a Transportation Problem
A Minimum Spanning Tree Approach of Solving a Transportation Problem
inventionjournals
352735339 rsh-qam11-tif-13-doc
352735339 rsh-qam11-tif-13-doc
Firas Husseini
352735339 rsh-qam11-tif-13-doc
352735339 rsh-qam11-tif-13-doc
BookStoreLib
Network coding
Network coding
Lishi He
Bca3040– data communication
Bca3040– data communication
smumbahelp
A feasible solution algorithm for a primitive vehicle routing problem
A feasible solution algorithm for a primitive vehicle routing problem
Cem Recai Çırak
A genetic algorithm for constructing broadcast trees with cost and delay cons...
A genetic algorithm for constructing broadcast trees with cost and delay cons...
IJCNCJournal
Network flow
Network flow
Ahmed Sobhi
PhD defense slides
PhD defense slides
Óscar González
Implementing Map Reduce Based Edmonds-Karp Algorithm to Determine Maximum Flo...
Implementing Map Reduce Based Edmonds-Karp Algorithm to Determine Maximum Flo...
paperpublications3
Application Aware Topology Generation for Surface Wave Networks-on-Chip
Application Aware Topology Generation for Surface Wave Networks-on-Chip
zhao fu
Network problems 1 (1)
Network problems 1 (1)
Jabnon Nonjab
Wat question papers
Wat question papers
Uday Sharma
Subproblem-Tree Calibration: A Unified Approach to Max-Product Message Passin...
Subproblem-Tree Calibration: A Unified Approach to Max-Product Message Passin...
Varad Meru
Computer network suggestion
Computer network suggestion
Md. Mashiur Rahman
[Mcq] computer communication networks lmt2
[Mcq] computer communication networks lmt2
raghad mejeed
Similar to 352735336 rsh-qam11-tif-11-doc
(20)
352735352 rsh-qam11-tif-09-doc
352735352 rsh-qam11-tif-09-doc
Network analysis
Network analysis
Bca3040– data communication
Bca3040– data communication
A Minimum Spanning Tree Approach of Solving a Transportation Problem
A Minimum Spanning Tree Approach of Solving a Transportation Problem
A Minimum Spanning Tree Approach of Solving a Transportation Problem
A Minimum Spanning Tree Approach of Solving a Transportation Problem
352735339 rsh-qam11-tif-13-doc
352735339 rsh-qam11-tif-13-doc
352735339 rsh-qam11-tif-13-doc
352735339 rsh-qam11-tif-13-doc
Network coding
Network coding
Bca3040– data communication
Bca3040– data communication
A feasible solution algorithm for a primitive vehicle routing problem
A feasible solution algorithm for a primitive vehicle routing problem
A genetic algorithm for constructing broadcast trees with cost and delay cons...
A genetic algorithm for constructing broadcast trees with cost and delay cons...
Network flow
Network flow
PhD defense slides
PhD defense slides
Implementing Map Reduce Based Edmonds-Karp Algorithm to Determine Maximum Flo...
Implementing Map Reduce Based Edmonds-Karp Algorithm to Determine Maximum Flo...
Application Aware Topology Generation for Surface Wave Networks-on-Chip
Application Aware Topology Generation for Surface Wave Networks-on-Chip
Network problems 1 (1)
Network problems 1 (1)
Wat question papers
Wat question papers
Subproblem-Tree Calibration: A Unified Approach to Max-Product Message Passin...
Subproblem-Tree Calibration: A Unified Approach to Max-Product Message Passin...
Computer network suggestion
Computer network suggestion
[Mcq] computer communication networks lmt2
[Mcq] computer communication networks lmt2
More from Firas Husseini
Ali M Fadel CV
Ali M Fadel CV
Firas Husseini
Transportation problems1
Transportation problems1
Firas Husseini
Slides for ch08
Slides for ch08
Firas Husseini
Slides for ch07
Slides for ch07
Firas Husseini
Slides for ch06
Slides for ch06
Firas Husseini
Slides for ch05
Slides for ch05
Firas Husseini
Rsh qam11 ch10 ge
Rsh qam11 ch10 ge
Firas Husseini
Rsh qam11 ch08 ge
Rsh qam11 ch08 ge
Firas Husseini
Rsh qam11 ch07 ge
Rsh qam11 ch07 ge
Firas Husseini
Rsh qam11 ch06 ge
Rsh qam11 ch06 ge
Firas Husseini
Rsh qam11 ch05 ge
Rsh qam11 ch05 ge
Firas Husseini
Rsh qam11 ch04 ge
Rsh qam11 ch04 ge
Firas Husseini
Rsh qam11 ch03
Rsh qam11 ch03
Firas Husseini
Rsh qam11 ch03 ge
Rsh qam11 ch03 ge
Firas Husseini
Rsh qam11 ch02
Rsh qam11 ch02
Firas Husseini
Rsh qam11 ch01
Rsh qam11 ch01
Firas Husseini
Render03 140622012601-phpapp02
Render03 140622012601-phpapp02
Firas Husseini
Render03 140622012601-phpapp02 (1)
Render03 140622012601-phpapp02 (1)
Firas Husseini
Render01edited 121120194704-phpapp02
Render01edited 121120194704-phpapp02
Firas Husseini
Render 09
Render 09
Firas Husseini
More from Firas Husseini
(20)
Ali M Fadel CV
Ali M Fadel CV
Transportation problems1
Transportation problems1
Slides for ch08
Slides for ch08
Slides for ch07
Slides for ch07
Slides for ch06
Slides for ch06
Slides for ch05
Slides for ch05
Rsh qam11 ch10 ge
Rsh qam11 ch10 ge
Rsh qam11 ch08 ge
Rsh qam11 ch08 ge
Rsh qam11 ch07 ge
Rsh qam11 ch07 ge
Rsh qam11 ch06 ge
Rsh qam11 ch06 ge
Rsh qam11 ch05 ge
Rsh qam11 ch05 ge
Rsh qam11 ch04 ge
Rsh qam11 ch04 ge
Rsh qam11 ch03
Rsh qam11 ch03
Rsh qam11 ch03 ge
Rsh qam11 ch03 ge
Rsh qam11 ch02
Rsh qam11 ch02
Rsh qam11 ch01
Rsh qam11 ch01
Render03 140622012601-phpapp02
Render03 140622012601-phpapp02
Render03 140622012601-phpapp02 (1)
Render03 140622012601-phpapp02 (1)
Render01edited 121120194704-phpapp02
Render01edited 121120194704-phpapp02
Render 09
Render 09
Recently uploaded
Pitch Deck Teardown: NOQX's $200k Pre-seed deck
Pitch Deck Teardown: NOQX's $200k Pre-seed deck
HajeJanKamps
VIP Kolkata Call Girl Howrah 👉 8250192130 Available With Room
VIP Kolkata Call Girl Howrah 👉 8250192130 Available With Room
divyansh0kumar0
VIP Call Girl Jamshedpur Aashi 8250192130 Independent Escort Service Jamshedpur
VIP Call Girl Jamshedpur Aashi 8250192130 Independent Escort Service Jamshedpur
Suhani Kapoor
Lowrate Call Girls In Sector 18 Noida ❤️8860477959 Escorts 100% Genuine Servi...
Lowrate Call Girls In Sector 18 Noida ❤️8860477959 Escorts 100% Genuine Servi...
lizamodels9
Tech Startup Growth Hacking 101 - Basics on Growth Marketing
Tech Startup Growth Hacking 101 - Basics on Growth Marketing
Shawn Pang
Eni 2024 1Q Results - 24.04.24 business.
Eni 2024 1Q Results - 24.04.24 business.
Eni
The CMO Survey - Highlights and Insights Report - Spring 2024
The CMO Survey - Highlights and Insights Report - Spring 2024
christinemoorman
Sales & Marketing Alignment: How to Synergize for Success
Sales & Marketing Alignment: How to Synergize for Success
Aggregage
(8264348440) 🔝 Call Girls In Mahipalpur 🔝 Delhi NCR
(8264348440) 🔝 Call Girls In Mahipalpur 🔝 Delhi NCR
soniya singh
GD Birla and his contribution in management
GD Birla and his contribution in management
chhavia330
0183760ssssssssssssssssssssssssssss00101011 (27).pdf
0183760ssssssssssssssssssssssssssss00101011 (27).pdf
Renandantas16
KestrelPro Flyer Japan IT Week 2024 (English)
KestrelPro Flyer Japan IT Week 2024 (English)
Data Analytics Company - 47Billion Inc.
(8264348440) 🔝 Call Girls In Keshav Puram 🔝 Delhi NCR
(8264348440) 🔝 Call Girls In Keshav Puram 🔝 Delhi NCR
soniya singh
Call Girls In Connaught Place Delhi ❤️88604**77959_Russian 100% Genuine Escor...
Call Girls In Connaught Place Delhi ❤️88604**77959_Russian 100% Genuine Escor...
lizamodels9
FULL ENJOY - 9953040155 Call Girls in Chhatarpur | Delhi
FULL ENJOY - 9953040155 Call Girls in Chhatarpur | Delhi
MalviyaNagarCallGirl
Best Practices for Implementing an External Recruiting Partnership
Best Practices for Implementing an External Recruiting Partnership
Recruitment Process Outsourcing Association
Grateful 7 speech thanking everyone that has helped.pdf
Grateful 7 speech thanking everyone that has helped.pdf
Paul Menig
Lean: From Theory to Practice — One City’s (and Library’s) Lean Story… Abridged
Lean: From Theory to Practice — One City’s (and Library’s) Lean Story… Abridged
KaiNexus
BEST Call Girls In Old Faridabad ✨ 9773824855 ✨ Escorts Service In Delhi Ncr,
BEST Call Girls In Old Faridabad ✨ 9773824855 ✨ Escorts Service In Delhi Ncr,
noida100girls
Banana Powder Manufacturing Plant Project Report 2024 Edition.pptx
Banana Powder Manufacturing Plant Project Report 2024 Edition.pptx
georgebrinton95
Recently uploaded
(20)
Pitch Deck Teardown: NOQX's $200k Pre-seed deck
Pitch Deck Teardown: NOQX's $200k Pre-seed deck
VIP Kolkata Call Girl Howrah 👉 8250192130 Available With Room
VIP Kolkata Call Girl Howrah 👉 8250192130 Available With Room
VIP Call Girl Jamshedpur Aashi 8250192130 Independent Escort Service Jamshedpur
VIP Call Girl Jamshedpur Aashi 8250192130 Independent Escort Service Jamshedpur
Lowrate Call Girls In Sector 18 Noida ❤️8860477959 Escorts 100% Genuine Servi...
Lowrate Call Girls In Sector 18 Noida ❤️8860477959 Escorts 100% Genuine Servi...
Tech Startup Growth Hacking 101 - Basics on Growth Marketing
Tech Startup Growth Hacking 101 - Basics on Growth Marketing
Eni 2024 1Q Results - 24.04.24 business.
Eni 2024 1Q Results - 24.04.24 business.
The CMO Survey - Highlights and Insights Report - Spring 2024
The CMO Survey - Highlights and Insights Report - Spring 2024
Sales & Marketing Alignment: How to Synergize for Success
Sales & Marketing Alignment: How to Synergize for Success
(8264348440) 🔝 Call Girls In Mahipalpur 🔝 Delhi NCR
(8264348440) 🔝 Call Girls In Mahipalpur 🔝 Delhi NCR
GD Birla and his contribution in management
GD Birla and his contribution in management
0183760ssssssssssssssssssssssssssss00101011 (27).pdf
0183760ssssssssssssssssssssssssssss00101011 (27).pdf
KestrelPro Flyer Japan IT Week 2024 (English)
KestrelPro Flyer Japan IT Week 2024 (English)
(8264348440) 🔝 Call Girls In Keshav Puram 🔝 Delhi NCR
(8264348440) 🔝 Call Girls In Keshav Puram 🔝 Delhi NCR
Call Girls In Connaught Place Delhi ❤️88604**77959_Russian 100% Genuine Escor...
Call Girls In Connaught Place Delhi ❤️88604**77959_Russian 100% Genuine Escor...
FULL ENJOY - 9953040155 Call Girls in Chhatarpur | Delhi
FULL ENJOY - 9953040155 Call Girls in Chhatarpur | Delhi
Best Practices for Implementing an External Recruiting Partnership
Best Practices for Implementing an External Recruiting Partnership
Grateful 7 speech thanking everyone that has helped.pdf
Grateful 7 speech thanking everyone that has helped.pdf
Lean: From Theory to Practice — One City’s (and Library’s) Lean Story… Abridged
Lean: From Theory to Practice — One City’s (and Library’s) Lean Story… Abridged
BEST Call Girls In Old Faridabad ✨ 9773824855 ✨ Escorts Service In Delhi Ncr,
BEST Call Girls In Old Faridabad ✨ 9773824855 ✨ Escorts Service In Delhi Ncr,
Banana Powder Manufacturing Plant Project Report 2024 Edition.pptx
Banana Powder Manufacturing Plant Project Report 2024 Edition.pptx
352735336 rsh-qam11-tif-11-doc
1.
Quantitative Analysis for
Management, 11e (Render) Chapter 11 Network Models 1) The minimal-spanning tree technique finds the shortest route to a series of destinations. Answer: FALSE Diff: 2 Topic: INTRODUCTION 2) In the minimal-spanning tree technique, it is necessary to start at the last node in the network. Answer: FALSE Diff: 2 Topic: MINIMAL-SPANNING TREE PROBLEM 3) The maximal-flow technique would be helpful to city planners in determining how freeways should be expanded. Answer: TRUE Diff: 2 Topic: MAXIMAL-FLOW PROBLEM 4) The minimal-spanning tree technique determines the path through the network that connects all the points while minimizing total distance. Answer: TRUE Diff: 2 Topic: INTRODUCTION 5) The shortest-route technique is the same as the minimal-spanning tree technique. Answer: FALSE Diff: 1 Topic: INTRODUCTION 6) Busy highways are often analyzed with the maximal-flow technique. Answer: TRUE Diff: 2 Topic: MAXIMAL-FLOW PROBLEM 7) Transportation companies would definitely be interested in the shortest-route technique to optimize travel. Answer: TRUE Diff: 2 Topic: SHORTEST-ROUTE PROBLEM 8) Cable television companies would employ the shortest-route technique to lay out the cables connecting individual houses. Answer: FALSE Diff: 2 Topic: MINIMAL-SPANNING TREE PROBLEM 1 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
2.
9) We may
begin the maximal-flow technique by picking an arbitrary path through the network. Answer: TRUE Diff: 2 Topic: MAXIMAL-FLOW PROBLEM 10) The maximal-flow technique finds the maximum flow of any quantity or substance through a network. Answer: TRUE Diff: 1 Topic: INTRODUCTION 11) The maximal-flow technique might be used by the U.S. Army Corps of Engineers to study water run-off in an attempt to minimize the danger from floods. Answer: TRUE Diff: 2 Topic: MAXIMAL-FLOW PROBLEM 12) The shortest-route technique might be used by someone planning a vacation in order to minimize the required amount of driving. Answer: TRUE Diff: 2 Topic: SHORTEST-ROUTE PROBLEM 13) The points on the network are referred to as nodes. Answer: TRUE Diff: 2 Topic: INTRODUCTION 14) Lines connecting nodes on a network are called links. Answer: FALSE Diff: 2 Topic: INTRODUCTION 15) A traveling salesperson might use the shortest route technique to minimize the distance traveled to reach one of his/her customers. Answer: TRUE Diff: 2 Topic: SHORTEST-ROUTE PROBLEM 16) In the minimal-spanning tree technique, if there is a tie for the nearest node, that suggests that there may be more than one optimal solution. Answer: TRUE Diff: 2 Topic: MINIMAL-SPANNING TREE PROBLEM 17) The maximal-flow model might be of use to an engineer looking for spare capacity in an oil pipeline system. Answer: TRUE Diff: 2 Topic: MAXIMAL-FLOW PROBLEM 2 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
3.
18) The shortest-route
model assumes that one is trying to connect two end points in the shortest manner possible, rather than attempting to connect all the nodes in the model. Answer: TRUE Diff: 2 Topic: SHORTEST-ROUTE PROBLEM 19) In the maximal-flow technique, a zero (0) means no flow or a one-way arc. Answer: TRUE Diff: 2 Topic: MAXIMAL-FLOW PROBLEM 20) The maximal-flow model assumes that there is a net flow from "source" to "sink." Answer: TRUE Diff: 2 Topic: MAXIMAL-FLOW PROBLEM 21) If your goal was to construct a network in which all points were connected and the distance between them was as short as possible, the technique that you would use is A) shortest-route. B) maximal-flow. C) shortest-spanning tree. D) minimal-flow. E) minimal-spanning tree. Answer: E Diff: 2 Topic: INTRODUCTION 22) The minimal-spanning technique would best be used A) to assign workers to jobs in the cheapest manner. B) to determine LAN network wiring within a building. C) to minimize traffic flow on a busy highway. D) by a trucking company making frequent but repeatable drops. E) to determine the number of units to ship from each source to each destination. Answer: B Diff: 2 Topic: MINIMAL-SPANNING TREE PROBLEM 23) The maximal-flow technique would best be used A) to assign workers to jobs in the cheapest manner. B) to determine the number of units to ship from each source to each destination. C) to determine LAN network wiring within a building. D) to maximize traffic flow on a busy highway. E) by a trucking company making frequent but repeatable drops. Answer: D Diff: 2 Topic: MAXIMAL-FLOW PROBLEM 3 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
4.
24) A line
in a network that may represent a path or a route is called a(n) ________. A) arc B) branch C) line D) fork E) sink Answer: A Diff: 1 Topic: INTRODUCTION 25) A point in the network, that is at the beginning or end of a route is called a(n) ________. A) arc B) branch C) line D) node E) source Answer: D Diff: 1 Topic: INTRODUCTION 26) The final node or destination in a network is called a(n) ________. A) arc B) branch C) source D) mouth E) sink Answer: E Diff: 1 Topic: MAXIMAL-FLOW PROBLEM 27) The origin or beginning node in a network is called ________. A) home B) delta C) source D) mouth E) sink Answer: C Diff: 1 Topic: MAXIMAL-FLOW PROBLEM 28) A technique that allows a researcher to determine the greatest amount of material that can move through a network is called A) maximal-flow. B) maximal-spanning. C) shortest-route. D) maximal-tree. Answer: B Diff: 2 Topic: INTRODUCTION 29) The first step in the maximal-flow technique is to 4 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
5.
A) pick the
node with the maximum flow. B) pick any path with some flow. C) eliminate any node that has a zero flow. D) add a dummy flow from the start to the finish. E) None of the above Answer: B Diff: 2 Topic: MAXIMAL-FLOW PROBLEM 30) The shortest-route technique would best be used to ________ A) assign workers to jobs in the cheapest manner. B) determine the number of units to ship from each source to each destination. C) determine the amount of LAN network wiring within a building. D) minimize the amount of traffic flow on a busy highway. E) determine the path for a truck making frequent but repeatable drops. Answer: E Diff: 2 Topic: SHORTEST-ROUTE PROBLEM 31) When using the shortest-route technique, the first step is to A) connect the nearest node that minimizes the total distance to the origin. B) trace the path from the warehouse to the plant. C) determine the average distance traveled from source to end. D) find the nearest node to the origin and put a distance box by the node. E) None of the above Answer: D Diff: 2 Topic: SHORTEST-ROUTE PROBLEM 32) The shortest-route technique might be logically used for A) finding the longest time to travel between two points. B) finding the shortest travel distance between two points. C) finding the most scenic route to allow travel to several places during a trip on spring break. D) connecting all the points of a network together while minimizing the distance between them. E) None of the above Answer: B Diff: 2 Topic: INTRODUCTION 33) All the nodes must be connected in which of the following techniques? A) minimal-flow B) maximal-spanning tree C) shortest-route D) maximal-flow E) minimal-spanning tree Answer: E Diff: 1 Topic: MINIMAL-SPANNING TREE PROBLEM 5 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
6.
34) The minimal-spanning
tree technique would best be used A) by a forest ranger seeking to minimize the risk of forest fires. B) by a telephone company attempting to lay out wires in a new housing development. C) by an airline laying out flight routes. D) None of the above E) All of the above Answer: B Diff: 2 Topic: MINIMAL-SPANNING TREE PROBLEM 35) Which of the following techniques is not discussed in Chapter 11? A) shortest-route B) maximal-flow C) linear programming D) minimal-flow E) minimal-spanning tree Answer: D Diff: 1 Topic: VARIOUS 36) The maximal-flow technique might be used A) to help design the moving sidewalks transporting passengers from one terminal to another in a busy airport. B) by someone designing the traffic approaches to an airport. C) by someone attempting to design roads that would limit the flow of traffic through an area. D) All of the above E) None of the above Answer: D Diff: 2 Topic: MAXIMAL-FLOW PROBLEM 37) Which of the following problems can be solved using linear programming? A) maximal-flow problem B) shortest-route problem C) minimal-spanning tree problem D) A and B E) A, B, and C Answer: D Diff: 2 Topic: VARIOUS 38) Which of the following problems can be solved as a linear program using binary decision variables? A) maximal-flow problem B) shortest-route problem C) minimal-spanning tree problem D) A and B E) A, B, and C Answer: B Diff: 2 6 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
7.
Topic: SHORTEST-ROUTE PROBLEM 39)
Which of the following problems can be solved as a linear program using integer decision variables? A) maximal-flow problem B) shortest-route problem C) minimal-spanning tree problem D) A and B E) A, B, and C Answer: A Diff: 2 Topic: MAXIMAL-FLOW PROBLEM 40) The second step in the maximal-flow technique is to A) pick the node with the maximum flow. B) pick any path with some flow. C) decrease the flow as much as possible. D) add capacity to the path with minimum flow. E) find the arc on the previously chosen path with the smallest flow capacity available. Answer: E Diff: 2 Topic: MAXIMAL-FLOW PROBLEM 41) The shortest-route technique would best be used to A) plan the routes for a vacation driving tour. B) plan the route for a school bus. C) determine the path for a truck making frequent runs from a factory to a warehouse. D) All of the above E) None of the above Answer: D Diff: 2 Topic: SHORTEST-ROUTE PROBLEM 42) When using the shortest-route technique, the second step is to A) find the next-nearest node to the origin and put the distance in a box by the node. B) trace the path from the warehouse to the plant. C) determine the average distance traveled from source to end. D) find the nearest node to the origin and put a distance box by the node. E) None of the above Answer: A Diff: 2 Topic: SHORTEST-ROUTE PROBLEM 43) In network models, the lines connecting the nodes are called ________. A) bridges B) arrows C) spans D) arcs E) links Answer: D 7 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
8.
Diff: 2 Topic: INTRODUCTION 44)
Given the following distances between destination nodes, what is the minimum distance that connects all the nodes? From To Distance 1 2 300 2 3 150 1 3 200 A) 450 B) 150 C) 350 D) 650 E) None of the above Answer: C Diff: 2 Topic: MINIMAL-SPANNING TREE PROBLEM AACSB: Analytic Skills 45) Given the following distances between destination nodes, what is the minimum distance that connects all the nodes? From To Distance 1 2 200 1 3 300 2 3 350 2 4 350 3 4 250 A) 100 B) 750 C) 850 D) 900 E) None of the above Answer: B Diff: 2 Topic: MINIMAL-SPANNING TREE PROBLEM AACSB: Analytic Skills 8 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
9.
46) Given the
following distances between destination nodes, what is the minimum distance that connects all the nodes? From To Distance 1 2 100 2 4 150 1 3 200 2 3 50 3 4 175 4 5 250 3 5 300 A) 100 B) 150 C) 550 D) 1225 E) None of the above Answer: C Diff: 2 Topic: MINIMAL-SPANNING TREE PROBLEM AACSB: Analytic Skills 47) Given the following distances between destination nodes, what is the minimum distance that connects all the nodes? From To Distance 1 2 100 1 3 50 2 3 200 2 5 325 1 4 50 3 4 350 3 5 400 4 5 450 A) 300 B) 525 C) 675 D) 1925 E) None of the above Answer: B Diff: 2 Topic: MINIMAL-SPANNING TREE PROBLEM AACSB: Analytic Skills 9 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
10.
48) Pipeline fluid
flows are indicated below. Determine the maximum flow from Node 1 to Node 3. From Node To Node Fluid Flow 1 3 400 3 1 100 1 2 300 2 1 0 2 3 100 3 2 100 A) 100 B) 400 C) 500 D) 700 E) None of the above Answer: C Diff: 2 Topic: MAXIMAL-FLOW PROBLEM AACSB: Analytic Skills 49) Pipeline fluid flows are indicated below. Determine the maximum flow from Node 1 to Node 4. From Node To Node Fluid Flow 1 2 400 2 1 0 1 4 200 4 1 200 1 3 200 3 1 0 2 4 200 4 2 200 3 4 300 4 3 300 A) 200 B) 300 C) 600 D) 700 E) None of the above Answer: C Diff: 2 Topic: MAXIMAL-FLOW PROBLEM AACSB: Analytic Skills 10 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
11.
50) Find the
shortest route from Node 1 to Node 4 using the shortest-route technique. From Node To Node Distance 1 2 300 1 3 200 2 3 50 2 4 250 3 4 450 A) 650 B) 450 C) 550 D) 500 E) 800 Answer: D Diff: 2 Topic: SHORTEST-ROUTE PROBLEM AACSB: Analytic Skills 51) Find the shortest route from Node 1 to Node 4. From Node To Node Distance 1 2 250 1 3 400 1 4 600 2 3 50 2 4 300 3 4 200 A) 750 B) 500 C) 550 D) 600 E) 50 Answer: B Diff: 2 Topic: SHORTEST-ROUTE PROBLEM AACSB: Analytic Skills 11 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
12.
52) Find the
shortest route from Node 1 to Node 6. From Node To Node Distance 1 2 150 1 3 200 2 4 200 2 3 50 4 6 100 3 4 300 3 5 350 5 6 100 A) 300 B) 450 C) 550 D) 650 E) None of the above Answer: B Diff: 2 Topic: SHORTEST-ROUTE PROBLEM AACSB: Analytic Skills 53) Given the following distances between destination nodes, what is the minimum distance that connects all the nodes? From To Distance 1 2 120 2 3 100 1 3 200 2 4 150 3 5 90 4 5 170 A) 290 B) 310 C) 620 D) 460 E) None of the above Answer: D Diff: 2 Topic: MINIMAL-SPANNING TREE PROBLEM AACSB: Analytic Skills 12 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
13.
54) Given the
following distances between destination nodes, what is the minimum distance that connects all the nodes? From To Distance 1 2 200 1 3 300 1 5 400 2 3 300 2 4 400 3 4 200 3 5 200 4 5 100 4 6 300 5 6 400 A) 1000 B) 800 C) 700 D) 1100 E) None of the above Answer: D Diff: 3 Topic: MINIMAL-SPANNING TREE PROBLEM AACSB: Analytic Skills 55) Given the following distances between destination nodes, what is the minimum distance that connects all the nodes? From To Distance 1 2 100 1 3 200 2 3 100 2 4 150 2 5 200 3 4 150 3 5 300 4 5 250 4 6 200 5 6 100 A) 900 B) 650 C) 400 D) 1200 E) None of the above Answer: B Diff: 3 Topic: MINIMAL-SPANNING TREE PROBLEM AACSB: Analytic Skills 56) Given the following distances between destination nodes, what is the minimum distance that connects all the nodes? 13 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
14.
From To Distance 1
2 100 1 3 50 2 3 200 2 5 300 1 4 50 3 4 350 3 5 400 3 6 400 4 5 450 4 6 350 5 6 200 A) 900 B) 1200 C) 1100 D) 700 E) None of the above Answer: D Diff: 3 Topic: MINIMAL-SPANNING TREE PROBLEM AACSB: Analytic Skills 57) Pipeline fluid flows are indicated below. Determine the maximum flow from Node 1 to Node 4. From Node To Node Fluid Flow 1 3 200 3 1 0 1 2 150 2 1 50 2 3 100 3 2 100 3 4 150 4 3 50 A) 100 B) 150 C) 200 D) 50 E) None of the above Answer: B Diff: 3 Topic: MAXIMAL-FLOW PROBLEM AACSB: Analytic Skills 58) Pipeline fluid flows are indicated below. Determine the maximum flow from Node 1 to Node 5. From Node To Node Fluid Flow 1 2 300 14 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
15.
2 1 0 1
3 0 3 1 150 1 4 200 4 1 200 1 5 100 5 1 100 2 4 200 4 2 200 3 4 250 4 3 300 3 5 300 5 3 250 4 5 100 5 4 0 A) 300 B) 400 C) 600 D) 500 E) None of the above Answer: D Diff: 3 Topic: MAXIMAL-FLOW PROBLEM AACSB: Analytic Skills 15 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
16.
59) Find the
shortest route from Node 1 to Node 5 using the shortest-route technique. From Node To Node Distance 1 2 200 1 3 150 2 3 50 2 4 300 3 4 250 3 5 200 4 5 150 A) 350 B) 400 C) 450 D) 600 E) None of the above Answer: A Diff: 3 Topic: SHORTEST-ROUTE PROBLEM AACSB: Analytic Skills 60) Find the shortest route from Node 1 to Node 5. From Node To Node Distance 1 2 250 1 3 150 1 4 200 2 3 50 2 4 150 3 4 150 3 5 100 2 5 150 A) 200 B) 350 C) 250 D) 450 E) None of the above Answer: C Diff: 3 Topic: SHORTEST-ROUTE PROBLEM AACSB: Analytic Skills 16 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
17.
61) Find the
shortest route from Node 1 to Node 6. From Node To Node Distance 1 2 150 1 3 200 2 3 100 2 4 200 2 5 50 3 4 350 3 5 300 4 6 100 5 6 100 A) 300 B) 450 C) 550 D) 650 E) None of the above Answer: A Diff: 3 Topic: SHORTEST-ROUTE PROBLEM AACSB: Analytic Skills 17 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
18.
62) Given the
following traffic flows, in hundreds of cars per hour, what is the maximum traffic flow from City 1 to City 7? From City To City Flow 1 1 2 4 2 1 3 8 3 1 5 5 4 2 1 0 5 2 4 3 6 2 5 3 7 3 1 0 8 3 5 3 9 3 6 1 10 4 2 3 11 4 5 3 12 4 7 4 13 5 1 1 14 5 2 0 15 5 3 2 16 5 4 0 17 5 6 1 18 5 7 5 19 6 3 1 20 6 5 4 21 6 7 1 22 7 4 2 23 7 5 1 24 7 6 0 A) 1200 B) 1400 C) 900 D) 800 E) None of the above Answer: C Diff: 3 Topic: MAXIMAL-FLOW PROBLEM AACSB: Analytic Skills 18 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
19.
63) Solve the
minimal-spanning tree problem defined below: Branch Start Node End Node Cost 1 1 3 5 2 1 2 1 3 2 4 3 4 2 5 4 5 3 4 6 6 4 6 2 A) total cost = 13 B) total cost = 15 C) total cost = 17 D) total cost = 11 E) None of the above Answer: B Diff: 3 Topic: MINIMAL-SPANNING TREE PROBLEM AACSB: Analytic Skills 64) Find the shortest route from Node 1 to Node 6. From Node To Node Distance 1 1 2 100 2 1 4 215 3 2 3 70 4 2 4 200 5 2 5 110 6 3 4 320 7 4 5 200 8 4 6 200 9 5 6 200 A) total distance = 350 B) total distance = 410 C) total distance = 270 D) total distance = 520 E) None of the above Answer: B Diff: 3 Topic: SHORTEST-ROUTE PROBLEM AACSB: Analytic Skills 19 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
20.
65) Given the
following traffic flows, in hundreds of cars per hour, what is the maximum traffic flow from Town 1 to Town 7? From Town To Town Flow 1 1 2 4 2 1 3 7 3 1 5 9 4 2 1 0 5 2 4 3 6 2 5 5 7 3 1 1 8 3 5 3 9 3 6 4 10 4 2 3 11 4 5 1 12 4 7 0 13 5 1 1 14 5 2 0 15 5 3 3 16 5 4 0 17 5 6 5 18 5 7 1 19 6 3 1 20 6 5 6 21 6 7 3 22 7 4 5 23 7 5 2 24 7 6 0 A) max flow = 4 units B) max flow = 6 units C) max flow = 3 units D) max flow = 9 units E) None of the above Answer: A Diff: 3 Topic: MAXIMAL-FLOW PROBLEM AACSB: Analytic Skills 20 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
21.
66) Find the
shortest route from Node 6 to Node 1. Branch From Node To Node Distance 1 1 2 150 2 1 3 200 3 2 3 100 4 2 4 200 5 2 5 50 6 3 4 350 7 3 5 300 8 4 6 100 9 5 6 100 A) branches 9, 7, and 2 B) branches 8, 6, and 2 C) branches 8, 6, 7, and 1 D) branches 9, 5, and 1 E) None of the above Answer: D Diff: 3 Topic: SHORTEST-ROUTE PROBLEM AACSB: Analytic Skills 21 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
22.
67) Given the
pipeline fluid flows indicated below, determine the maximum flow from Node 1 to Node 5. From Node To Node Fluid Flow 1 1 2 300 2 2 1 0 3 1 3 0 4 3 1 150 5 1 4 200 6 4 1 200 7 1 5 100 8 5 1 100 9 2 4 200 10 4 2 200 11 3 4 250 12 4 3 300 13 3 5 300 14 5 3 250 15 4 5 100 16 5 4 0 A) 250 B) 300 C) 350 D) 450 E) None of the above Answer: E Diff: 3 Topic: MAXIMAL-FLOW PROBLEM AACSB: Analytic Skills 22 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
23.
68) Find the
least amount of cable that will allow Jack's Cable Company to connect the following nodes (houses). From Node To Node Distance 1 2 250 1 3 150 1 4 400 2 3 50 2 4 100 3 4 200 A) 250 B) 400 C) 350 D) 300 E) None of the above Answer: D Diff: 3 Topic: MINIMAL-SPANNING TREE PROBLEM AACSB: Analytic Skills 69) Given the following nodes and distances, determine the minimum length of cable necessary to connect all six nodes. From Node To Node Distance 1 1 2 150 2 1 3 200 3 2 3 100 4 2 4 200 5 2 5 50 6 3 4 350 7 3 5 300 8 4 6 100 9 5 6 100 A) 200 B) 300 C) 400 D) 500 E) None of the above Answer: D Diff: 3 Topic: MINIMAL-SPANNING TREE PROBLEM AACSB: Analytic Skills 23 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
24.
70) Given the
following nodes and distances, determine the minimal length of cable necessary to connect all nodes, using Node 2 as the starting point. From To Distance 1 1 2 200 2 1 3 300 3 1 5 400 4 2 3 300 5 2 4 400 6 3 4 200 7 3 5 200 8 4 5 100 9 4 6 300 10 5 6 400 A) 1200 B) 1100 C) 900 D) 700 E) None of the above Answer: B Diff: 3 Topic: MINIMAL-SPANNING TREE PROBLEM AACSB: Analytic Skills 24 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
25.
71) Find the
shortest route from Node 1 to each of the other nodes in the transportation network represented below. Route from Node Distance 1 to 2 50 1 to 3 100 2 to 3 75 2 to 4 65 3 to 4 80 3 to 5 70 4 to 5 65 4 to 6 200 5 to 6 130 Answer: Node Shortest Route Distance 2 1-2 50 3 1-3 100 4 1-2-4 115 5 1-3-5 170 6 1-2-4-5-6 310 Diff: 3 Topic: SHORTEST-ROUTE PROBLEM AACSB: Analytic Skills 25 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
26.
72) As part
of the planning for a major office development project, it is necessary to install telephone line to the buildings. Information about the project is given below. The distances are provided in hundreds of feet. Which offices should be connected so that total wiring costs (i.e., total distance) are minimized? What is the total length of this? Building Distances (100s ft) 1 to 2 4 1 to 4 3 2 to 3 2 2 to 4 4 3 to 5 1 3 to 6 5 4 to 5 3 4 to 7 3 5 to 7 2 6 to 7 6 Answer: One solution is to connect 1-4, 2-3, 3-6, 3-5, 4-5, 5-7. Total length = 16. Diff: 3 Topic: MINIMAL-SPANNING TREE PROBLEM AACSB: Analytic Skills 73) A cable company must is to provide service for 7 houses in a particular neighborhood. They would like to wire the neighborhood in a way to minimize the wiring costs (or distance). How should the cable company wire the neighborhood and what would be the minimal length of the network? House Distances (yards) 1 to 2 100 1 to 3 400 1 to 4 300 2 to 3 300 2 to 4 250 2 to 5 400 3 to 5 350 3 to 6 450 4 to 5 300 4 to 7 250 5 to 7 100 6 to 7 150 Answer: One solution is to connect 1-2, 2-3, 2-4, 4-7, 5-7, 6-7. Total length = 1150. Diff: 3 Topic: MINIMAL-SPANNING TREE PROBLEM AACSB: Analytic Skills 26 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
27.
74) Given a
network with the following distances: From Node To Node Distance 1 2 4 1 3 1 2 3 2 2 4 3 3 4 6 3 5 3 3 6 9 4 5 7 5 6 5 (a) Determine which nodes should be connected to get the minimum distance from Nodes 1 through 6. (b) Determine the minimum distance. Answer: (a) Connect 1-3-5-6. (b) Minimum distance = 9 Diff: 3 Topic: SHORTEST-ROUTE PROBLEM AACSB: Analytic Skills 75) The west-to-east air traffic system passing through the United States can handle aircraft flows with capacities in hundreds of planes per hour as shown. What is the peak air traffic load (From City 1 to City 5) in aircraft per hour that this system can handle? Answer: Route 1235 can handle 200 per hour, and Route 145 can handle 300 per hour for a total of 500 aircraft per hour. Diff: 3 Topic: MAXIMAL-FLOW PROBLEM AACSB: Analytic Skills 27 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
28.
76) Find the
shortest route from Node 1 to each of the other nodes in the transportation network represented below. Route From Node Distance 1 to 2 50 1 to 3 100 2 to 3 75 2 to 5 60 3 to 4 80 3 to 5 70 3 to 6 65 4 to 6 200 5 to 6 150 Answer: Node Shortest Route Distance 2 1-2 50 3 1-3 100 4 1-3-4 180 5 1-2-5 110 6 1-3-6 165 Diff: 3 Topic: SHORTEST-ROUTE PROBLEM AACSB: Analytic Skills 28 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
29.
77) A logistics
company is determining the shortest route to get to a selected final destination. The information on possible paths and distances is given below: Route From Node Distance 1 to 2 50 1 to 3 100 1 to 4 125 2 to 4 75 2 to 5 180 3 to 4 100 3 to 5 125 4 to 5 170 4 to 6 200 5 to 6 125 5 to 7 100 6 to 7 75 Answer: 1-3-5-7 = 325 Diff: 3 Topic: SHORTEST-ROUTE PROBLEM AACSB: Analytic Skills 78) As part of the planning for a major office development project, it is necessary to install telephone lines to the buildings. Information about the project is given below. The distances are provided in hundreds of feet. Which offices should be connected so that total wiring costs (i.e., total distance) are minimized? What is the total length of this? Buildings Distances (100s ft) 1 to 2 4 1 to 3 3 1 to 4 2 2 to 4 4 3 to 5 1 3 to 6 5 4 to 5 3 4 to 7 3 5 to 7 2 6 to 7 6 Answer: Connect: 1-4, 4-5, 5-7, 3-6, 5-3, and either 4-2 or 1-2. Total length is 1700 feet. Alternate solutions exist. Diff: 3 Topic: MINIMAL-SPANNING TREE PROBLEM AACSB: Analytic Skills 29 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
30.
79) Brantley College
has decided to "wire" its campus. The first stage in this effort is to install the "backbone," i.e., to connect all the buildings. The table below gives the distances between the various buildings on campus in hundreds of feet. How should the buildings be connected to minimize the total length of cable? What length of cable is required? Answer: Connect: 1-2, 2-4, 4-6, 3-5, 5-6. Total length is 1600 feet. Diff: 3 Topic: MINIMAL-SPANNING TREE PROBLEM AACSB: Analytic Skills 80) Given a network with the following distances: From Node To Node Distance 1 2 4 1 4 1 2 3 2 2 4 3 3 4 6 3 5 4 3 6 2 4 5 7 4 7 5 5 6 5 5 7 8 6 7 4 (a) Determine which nodes should be connected to get the minimum distance flowing from Node 1 through Node 7. (b) Determine the minimum distance. Answer: (a) Connect: 1-4, 4-7. (a) Minimum distance = 6 Diff: 3 Topic: SHORTEST-ROUTE PROBLEM AACSB: Analytic Skills 30 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
31.
81) The east-to-west
(City 5 to City 1) air traffic system passing through the U.S. can handle aircraft flows with capacities in hundreds of planes per hour as shown. What is the peak air traffic load in aircraft per hour from City 5 to City 1 that this system can handle? Answer: 500 aircraft per hour. Diff: 3 Topic: MAXIMAL-FLOW PROBLEM AACSB: Analytic Skills 82) A water company is analyzing the flow of water through pipes in an office building. The flow capacities are given in the table below. Flow is measured in 100 gallons/hour. What is the maximal flow of water from node 1 to node 5? Answer: 700 gallons per hour. Diff: 3 Topic: MAXIMAL-FLOW PROBLEM AACSB: Analytic Skills 83) Describe the steps of the shortest-route technique. Answer: (1) Find the nearest node to the origin (plant). Put the distance in a box by the node. (2) Find the next- nearest node to the origin (plant), and put the distance in a box by the node. In some cases, several paths will have to be checked to find the nearest node. (3) Repeat this process until you have gone through the entire network. The last distance at the ending node will be the distance of the shortest route. You should note that the distance placed in the box by each node is the shortest route to this node. These distances are used as intermediate results in finding the next-nearest node. Diff: 3 Topic: SHORTEST-ROUTE PROBLEM 84) Briefly describe the minimal-spanning technique. Answer: determines the path through a network that connects all the points while minimizing the total distance Diff: 2 Topic: INTRODUCTION 31 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
32.
85) Briefly describe
the maximal-flow technique. Answer: determines the maximal flow of any quantity or substance through a network Diff: 2 Topic: INTRODUCTION 86) Briefly describe the minimal shortest-route technique. Answer: determines the shortest route through a network Diff: 2 Topic: INTRODUCTION 32 Copyright © 2012 Pearson Education, Inc. publishing as Prentice Hall
Download now