Question 1

The minimal-spanning tree technique finds the shortest route to a series of destinations.

Accepted Answer

A) True 
 B)False

Question 2

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?

Accepted Answer

Connect: 1-4, 4-5, 5-7, 3-6, 5

Question 3

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

Accepted Answer

A) True 
 B)False

Question 4

Given the pipeline fluid flows indicated below, determine the maximum flow from Node 1 to Node 5.

Accepted Answer

A) 300 
B) 350 
C) 450 
D) 500 
A) 300 
B) 350 
C) 450 
D) 500

Question 5

Which of these statements is best?

Accepted Answer

A) Assignment problems involve determining the most efficient assignment of people to projects, salesmen to territories, contracts to bidders, and so on. 
B) The objective of an assignment problem solution most often is to maximize the total costs or time of performing the assigned tasks. 
C) 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. 
D) The objective of an assignment problem solution most often is to minimize the number of assigned tasks. 
A) Assignment problems involve determining the most efficient assignment of people to projects, salesmen to territories, contracts to bidders, and so on. 
B) The objective of an assignment problem solution most often is to maximize the total costs or time of performing the assigned tasks. 
C) 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. 
D) The objective of an assignment problem solution most often is to minimize the number of assigned tasks.

Question 6

The objective of a transportation problem solution is to schedule shipments from sources to destinations while minimizing total transportation and production costs.

Accepted Answer

A) True 
 B)False

Question 7

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 
A) 350 
B) 400 
C) 450 
D) 600

Question 8

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

Question 9

A point in the network, that is at the beginning or end of a route is called a(n)

Accepted Answer

A) arc. 
B) branch. 
C) line. 
D) node. 
A) arc. 
B) branch. 
C) line. 
D) node.

Question 10

The maximal-flow technique would be helpful to city planners in determining how freeways should be expanded.

Accepted Answer

A) True 
 B)False

Question 11

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.
   Formulate this problem as a linear program.

Accepted Answer

Let (1) = Pittsburgh, (2) = Kansas City,

Question 12

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.

Accepted Answer

A) True 
 B)False

The minimal-spanning tree technique finds the shortest route to a series of destinations.

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

Given the pipeline fluid flows indicated below, determine the maximum flow from Node 1 to Node 5.

Which of these statements is best?

The objective of a transportation problem solution is to schedule shipments from sources to destinations while minimizing total transportation and production costs.

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

Find the shortest route from Node 6 to Node 1.

A point in the network, that is at the beginning or end of a route is called a(n)

The maximal-flow technique would be helpful to city planners in determining how freeways should be expanded.

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.

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

The minimal-spanning tree technique finds the shortest route to a series of destinations.

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

Given the pipeline fluid flows indicated below, determine the maximum flow from Node 1 to Node 5.

Which of these statements is best?

The objective of a transportation problem solution is to schedule shipments from sources to destinations while minimizing total transportation and production costs.

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

Find the shortest route from Node 6 to Node 1.

A point in the network, that is at the beginning or end of a route is called a(n)

The maximal-flow technique would be helpful to city planners in determining how freeways should be expanded.

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.

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