Exam 9: Transportation,assignment,and Network Models
Exam 1: Introduction to Quantitative Analysis71 Questions
Exam 2: Probability Concepts and Applications157 Questions
Exam 3: Decision Analysis128 Questions
Exam 4: Regression Models133 Questions
Exam 5: Forecasting111 Questions
Exam 6: Inventory Control Models123 Questions
Exam 7: Linear Programming Models: Graphical and Computer Methods110 Questions
Exam 8: Linear Programming Applications105 Questions
Exam 9: Transportation,assignment,and Network Models98 Questions
Exam 10: Integer Programming,goal Programming,and Nonlinear Programming98 Questions
Exam 11: Project Management134 Questions
Exam 12: Waiting Lines and Queuing Theory Models145 Questions
Exam 13: Simulation Modeling79 Questions
Exam 14: Markov Analysis86 Questions
Exam 15: Statistical Quality Control98 Questions
Exam 16: Analytic Hierarchy Process53 Questions
Exam 17: Dynamic Programming67 Questions
Exam 18: Decision Theory and the Normal Distribution50 Questions
Exam 19: Game Theory47 Questions
Exam 20: Mathematical Tools: Determinants and Matrices99 Questions
Exam 21: Calculus-Based Optimization24 Questions
Exam 22: Linear Programming: The Simplex Method100 Questions
Exam 23: Transportation, Assignment, and Network Algorithms111 Questions
Select questions type
SE Appliances manufacturers refrigerators in Richmond,Charlotte,and Atlanta.Refrigerators then must be shipped to meet demand in Washington,New York,and Miami.The table below lists the shipping costs,supply,and demand information.
How many units should be shipped from each plant to each retail store in order to minimize shipping costs?

Free
(Essay)
4.8/5
(32)
Correct Answer:
Ship 1000 units from Richmond to New York,1000 units from Charlotte to Washington,800 units from Atlanta to New York,and 1200 units from Atlanta to Miami,with the 500 from Charlotte to the Dummy unshipped.
Find the least amount of cable that will allow Jack's Cable Company to connect the following nodes (houses). 

Free
(Multiple Choice)
4.9/5
(35)
Correct Answer:
D
A point in the network,that is at the beginning or end of a route is called a(n)
Free
(Multiple Choice)
4.7/5
(37)
Correct Answer:
D
Transportation companies would definitely be interested in the shortest-route technique to optimize travel.
(True/False)
4.8/5
(31)
In a transportation problem,each destination must be supplied by one and only one source.
(True/False)
4.8/5
(40)
Given a network with the following distances:
(a)Determine which nodes should be connected to get the minimum distance flowing from Node 1 through Node 7.
(b)Determine the minimum distance.

(Essay)
4.8/5
(29)
Given the following distances between destination nodes,what is the minimum distance that connects all the nodes? 

(Multiple Choice)
4.8/5
(30)
Pipeline fluid flows are indicated below.Determine the maximum flow from Node 1 to Node 4. 

(Multiple Choice)
4.9/5
(29)
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? 

(Essay)
4.8/5
(36)
All the nodes must be connected in which of the following techniques?
(Multiple Choice)
4.8/5
(33)
Busy highways are often analyzed with the maximal-flow technique.
(True/False)
4.9/5
(33)
Given the following distances between destination nodes,what is the minimum distance that connects all the nodes? 

(Multiple Choice)
4.7/5
(32)
Transportation models can be used for which of the following decisions?
(Multiple Choice)
4.9/5
(38)
Given the following distances between destination nodes,what is the minimum distance that connects all the nodes? 

(Multiple Choice)
4.7/5
(37)
Given the pipeline fluid flows indicated below,determine the maximum flow from Node 1 to Node 5. 

(Multiple Choice)
4.8/5
(40)
Find the shortest route from Node 1 to each of the other nodes in the transportation network represented below. 

(Essay)
4.9/5
(29)
Showing 1 - 20 of 98
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)