Question 1

The objective of an assignment problem solution most often is to minimize the total costs or time of performing the assigned tasks.

Accepted Answer

A) True 
 B)False

Question 2

Table M8-1  
-What is the total cost represented by the solution shown in Table M8-1?

Accepted Answer

A) 60 
B) 2500 
C) 2600 
D) 500 
A) 60 
B) 2500 
C) 2600 
D) 500

Question 3

Table M8-18
LW Enterprises is a specialty cat breeder with operations located in Wichita, Oklahoma City, Nashville, Lubbock and Enumclaw.These cats are used as historical reenactors on US Civil War battlefields throughout the summer months.Clad in Union blue or Confederate gray and equipped with their tiny rifles and saucers of milk, they thrill crowds of Civil War buffs from Gettysburg all the way down to Vicksburg.The cost (in dollars)of shipping each cat from all possible combinations of supply and demand locations is shown in the table.
  
-What is the minimum shipping cost achievable in the scenario presented in Table M8-18?

Accepted Answer

A) $88,800 
B) $89,400 
C) $90,600 
D) $91,200 
A) $88,800 
B) $89,400 
C) $90,600 
D) $91,200

Question 4

Table M8-18
LW Enterprises is a specialty cat breeder with operations located in Wichita, Oklahoma City, Nashville, Lubbock and Enumclaw.These cats are used as historical reenactors on US Civil War battlefields throughout the summer months.Clad in Union blue or Confederate gray and equipped with their tiny rifles and saucers of milk, they thrill crowds of Civil War buffs from Gettysburg all the way down to Vicksburg.The cost (in dollars)of shipping each cat from all possible combinations of supply and demand locations is shown in the table.
  
-Which locations ship cats to Antietam given the shipping costs presented in Table M8-18?

Accepted Answer

A) Wichita & Jones 
B) Wichita & Enumclaw 
C) Wichita & Nashville 
D) Wichita only 
A) Wichita & Jones 
B) Wichita & Enumclaw 
C) Wichita & Nashville 
D) Wichita only

Question 5

Mr.Miyagi hires the Magnificent Seven to take care of a few chores around his house while he spends some quality time with his young protegee.Each of the Magnificent Seven quotes Mr.Miyagi a price for the seven tasks and Mr.Miyagi would like to pay as little as possible for all seven.What is the best price possible and which person should perform which task?

Accepted Answer

Optimal cost is 124.Chris & Ca

Question 6

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 7

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 8

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

Question 9

Table M8-18
LW Enterprises is a specialty cat breeder with operations located in Wichita, Oklahoma City, Nashville, Lubbock and Enumclaw.These cats are used as historical reenactors on US Civil War battlefields throughout the summer months.Clad in Union blue or Confederate gray and equipped with their tiny rifles and saucers of milk, they thrill crowds of Civil War buffs from Gettysburg all the way down to Vicksburg.The cost (in dollars)of shipping each cat from all possible combinations of supply and demand locations is shown in the table.
  
-What is the lowest unused shipping cost (that is, no cats are sent between the two cities with this cost)if a shipping plan is devised to minimize the overall total cost of shipping for the scenario presented in Table M8-18?

Accepted Answer

A) $42 
B) $43 
C) $33 
D) $36 
A) $42 
B) $43 
C) $33 
D) $36

Question 10

The transportation algorithm can be used to solve both minimization problems and maximization problems.

Accepted Answer

A) True 
 B)False

Question 11

Once one improvement is made to a transportation network using the stepping-stone method, the solution is optimal.

Accepted Answer

A) True 
 B)False

Question 12

Table M8-3   The following improvements are proved for Table M8-3:
  
-The cell improvement indices for Table M8-3 suggest that the optimal solution has been found.Based on this solution, how many units would actually be sent from source C?

Accepted Answer

A) 10 
B) 170 
C) 180 
D) 250 
A) 10 
B) 170 
C) 180 
D) 250

Question 13

Which of the following problems can be solved as a linear program using integer decision variables?

Accepted Answer

A) maximal-flow problem 
B) shortest-route problem 
C) minimal-spanning tree problem 
D) Yehudi's dilemma 
A) maximal-flow problem 
B) shortest-route problem 
C) minimal-spanning tree problem 
D) Yehudi's dilemma

Question 14

Which of the following techniques can be used for moving from an initial feasible solution to an optimal solution in a transportation problem?

Accepted Answer

A) Hungarian method 
B) stepping-stone method 
C) northwest corner rule 
D) Vogel's approximation method 
A) Hungarian method 
B) stepping-stone method 
C) northwest corner rule 
D) Vogel's approximation method

Question 15

Why don't we want to use the transportation algorithm to solve the assignment problem?

Accepted Answer

A) It would likely lead to an unbounded solution. 
B) It would likely lead to a degenerate solution. 
C) It would likely lead to an infeasible solution. 
D) It would likely lead to multiple optima. 
A) It would likely lead to an unbounded solution. 
B) It would likely lead to a degenerate solution. 
C) It would likely lead to an infeasible solution. 
D) It would likely lead to multiple optima.

Question 16

The maximal-flow technique would best be used

Accepted Answer

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

Question 17

The origin or beginning node in a network is called

Accepted Answer

A) home. 
B) delta. 
C) source. 
D) mouth. 
A) home. 
B) delta. 
C) source. 
D) mouth.

Question 18

Given a network with the following distances:
   Determine which nodes should be connected to get the minimum distance from Nodes 1 through 6.
Determine the minimum distance.

Accepted Answer

Connect 1-

Question 19

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 20

Objectives of the assignment problem would be most likely to include

Accepted Answer

A) maximize total costs. 
B) minimize total time to perform the tasks at hand. 
C) maximize opportunity costs. 
D) minimize profit. 
A) maximize total costs. 
B) minimize total time to perform the tasks at hand. 
C) maximize opportunity costs. 
D) minimize profit.

The objective of an assignment problem solution most often is to minimize the total costs or time of performing the assigned tasks.

Table M8-1 -What is the total cost represented by the solution shown in Table M8-1?

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

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?

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.

The transportation algorithm can be used to solve both minimization problems and maximization problems.

Once one improvement is made to a transportation network using the stepping-stone method, the solution is optimal.

Table M8-3 The following improvements are proved for Table M8-3: -The cell improvement indices for Table M8-3 suggest that the optimal solution has been found.Based on this solution, how many units would actually be sent from source C?

Which of the following problems can be solved as a linear program using integer decision variables?

Which of the following techniques can be used for moving from an initial feasible solution to an optimal solution in a transportation problem?

Why don't we want to use the transportation algorithm to solve the assignment problem?

The maximal-flow technique would best be used

The origin or beginning node in a network is called

Given a network with the following distances: Determine which nodes should be connected to get the minimum distance from Nodes 1 through 6. Determine the minimum distance.

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

Objectives of the assignment problem would be most likely to include

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

Transportation, Assignment, and Network Models

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

Filters

Exam 23: Transportation, Assignment, and Network Algorithms

The objective of an assignment problem solution most often is to minimize the total costs or time of performing the assigned tasks.

Table M8-1 -What is the total cost represented by the solution shown in Table M8-1?

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

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?

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.

The transportation algorithm can be used to solve both minimization problems and maximization problems.

Once one improvement is made to a transportation network using the stepping-stone method, the solution is optimal.

Table M8-3 The following improvements are proved for Table M8-3: -The cell improvement indices for Table M8-3 suggest that the optimal solution has been found.Based on this solution, how many units would actually be sent from source C?

Which of the following problems can be solved as a linear program using integer decision variables?

Which of the following techniques can be used for moving from an initial feasible solution to an optimal solution in a transportation problem?

Why don't we want to use the transportation algorithm to solve the assignment problem?

The maximal-flow technique would best be used

The origin or beginning node in a network is called

Given a network with the following distances: Determine which nodes should be connected to get the minimum distance from Nodes 1 through 6. Determine the minimum distance.

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

Objectives of the assignment problem would be most likely to include

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

Transportation, Assignment, and Network Models

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

Filters