Question 1

Given the following distances between destination nodes,what is the minimum distance that connects all the nodes?

Accepted Answer

A) 100 
B) 150 
C) 550 
D) 1225 
E) None of the above 
A) 100 
B) 150 
C) 550 
D) 1225 
E) None of the above

Question 2

Transportation models may be used when a firm is trying to decide where to locate a new facility.

Accepted Answer

A) True 
 B)False

Question 3

A transportation problem with intermediate points is called a transshipment problem.

Accepted Answer

A) True 
 B)False

Question 4

Find the shortest route from Node 6 to Node 1.

Accepted Answer

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 
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

Question 5

The final node or destination in a network is called a(n)

Accepted Answer

A) arc. 
B) branch. 
C) source. 
D) mouth. 
E) sink. 
A) arc. 
B) branch. 
C) source. 
D) mouth. 
E) sink.

Question 6

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.

Accepted Answer

A) True 
 B)False

Question 7

The transshipment problem is a maximization problem.

Accepted Answer

A) True 
 B)False

Question 8

The shortest-route technique would best be used to

Accepted Answer

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. 
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.

Question 9

Assignment problems involve determining the most efficient assignment of people to projects,salesmen to territories,contracts to bidders,and so on.

Accepted Answer

A) True 
 B)False

Question 10

A line in a network that may represent a path or a route is called a(n)

Accepted Answer

A) arc. 
B) branch. 
C) line. 
D) fork. 
E) sink. 
A) arc. 
B) branch. 
C) line. 
D) fork. 
E) sink.

Question 11

The shortest-route technique might be used by someone planning a vacation in order to minimize the required amount of driving.

Accepted Answer

A) True 
 B)False

Question 12

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:

Accepted Answer

The answer of A logistics company is determining the shortest...

Question 13

Find the shortest route from Node 1 to Node 5 using the shortest-route technique.

Accepted Answer

A) 350 
B) 400 
C) 450 
D) 600 
E) None of the above 
A) 350 
B) 400 
C) 450 
D) 600 
E) None of the above

Question 14

Given the following distances between destination nodes,what is the minimum distance that connects all the nodes?

Accepted Answer

A) 900 
B) 1200 
C) 1100 
D) 700 
E) None of the above 
A) 900 
B) 1200 
C) 1100 
D) 700 
E) None of the above

Question 15

The east-to-west (City 5 to City 1)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 in aircraft per hour from City 5 to City 1 that this system can handle?

Accepted Answer

500 aircra

Question 16

Neki Sports Company manufactures treadmills in factories located in Pittsburgh and Kansas City.These are shipped to regional distribution centers in Chicago,Phoenix,and Philadelphia.Ultimately they are delivered to supply houses in New York and Los Angeles.The available supplies at the factories,demands at the final destinations,and shipping costs are illustrated in the table below.   Determine how many units should be shipped for all possible origin and destination points (final or intermediate)in the distribution network in order to minimize shipping costs.

Accepted Answer

The best solution is to ship 1200 units

Question 17

In the assignment problem,the costs for a dummy row will be equal to the lowest cost of the column for each respective cell in that row.

Accepted Answer

A) True 
 B)False

Question 18

Find the shortest route from Node 1 to Node 6.

Accepted Answer

A) total distance = 350 
B) total distance = 410 
C) total distance = 270 
D) total distance = 520 
E) None of the above 
A) total distance = 350 
B) total distance = 410 
C) total distance = 270 
D) total distance = 520 
E) None of the above

Given the following distances between destination nodes,what is the minimum distance that connects all the nodes?

Transportation models may be used when a firm is trying to decide where to locate a new facility.

A transportation problem with intermediate points is called a transshipment problem.

Find the shortest route from Node 6 to Node 1.

The final node or destination in a network is called a(n)

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.

The transshipment problem is a maximization problem.

The shortest-route technique would best be used to

Assignment problems involve determining the most efficient assignment of people to projects,salesmen to territories,contracts to bidders,and so on.

A line in a network that may represent a path or a route is called a(n)

The shortest-route technique might be used by someone planning a vacation in order to minimize the required amount of driving.

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:

Find the shortest route from Node 1 to Node 5 using the shortest-route technique.

Given the following distances between destination nodes,what is the minimum distance that connects all the nodes?

The east-to-west (City 5 to City 1)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 in aircraft per hour from City 5 to City 1 that this system can handle?

In the assignment problem,the costs for a dummy row will be equal to the lowest cost of the column for each respective cell in that row.

Find the shortest route from Node 1 to Node 6.

Introduction to Quantitative Analysis

Probability Concepts and Applications

Decision Analysis

Regression Models

Forecasting

Inventory Control Models

Linear Programming Models: Graphical and Computer Methods

Linear Programming Applications

Integer Programming,goal Programming,and Nonlinear Programming

Project Management

Waiting Lines and Queuing Theory Models

Simulation Modeling

Markov Analysis

Statistical Quality Control

Analytic Hierarchy Process

Dynamic Programming

Decision Theory and the Normal Distribution

Game Theory

Mathematical Tools: Determinants and Matrices

Calculus-Based Optimization

Linear Programming: The Simplex Method

Transportation, Assignment, and Network Algorithms

Filters

Exam 9: Transportation,assignment,and Network Models

Given the following distances between destination nodes,what is the minimum distance that connects all the nodes?

Transportation models may be used when a firm is trying to decide where to locate a new facility.

A transportation problem with intermediate points is called a transshipment problem.

Find the shortest route from Node 6 to Node 1.

The final node or destination in a network is called a(n)

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.

The transshipment problem is a maximization problem.

The shortest-route technique would best be used to

Assignment problems involve determining the most efficient assignment of people to projects,salesmen to territories,contracts to bidders,and so on.

A line in a network that may represent a path or a route is called a(n)

The shortest-route technique might be used by someone planning a vacation in order to minimize the required amount of driving.

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:

Find the shortest route from Node 1 to Node 5 using the shortest-route technique.

Given the following distances between destination nodes,what is the minimum distance that connects all the nodes?

The east-to-west (City 5 to City 1)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 in aircraft per hour from City 5 to City 1 that this system can handle?

In the assignment problem,the costs for a dummy row will be equal to the lowest cost of the column for each respective cell in that row.

Find the shortest route from Node 1 to Node 6.

Introduction to Quantitative Analysis

Probability Concepts and Applications

Decision Analysis

Regression Models

Forecasting

Inventory Control Models

Linear Programming Models: Graphical and Computer Methods

Linear Programming Applications

Integer Programming,goal Programming,and Nonlinear Programming

Project Management

Waiting Lines and Queuing Theory Models

Simulation Modeling

Markov Analysis

Statistical Quality Control

Analytic Hierarchy Process

Dynamic Programming

Decision Theory and the Normal Distribution

Game Theory

Mathematical Tools: Determinants and Matrices

Calculus-Based Optimization

Linear Programming: The Simplex Method

Transportation, Assignment, and Network Algorithms

Filters