Exam 23: Transportation, Assignment, and Network Algorithms

Explore all topics

When using a general LP model for transportation problems,if there are 4 sources and 3 destinations,which of the following statements is true?

(Multiple Choice)

4.7/5

(34)

Question 61

In Table M8-3,suppose shipping cost from source C to point 2 was 8,which below would be true?

(Multiple Choice)

4.8/5

(26)

Question 62

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

(True/False)

4.7/5

(33)

Question 63

Table M8-14 -The solution shown in Table M8-14 is

(Multiple Choice)

5.0/5

(30)

Question 64

Table M8-10 -What is wrong with Table M8-10?

(Multiple Choice)

4.8/5

(40)

Question 65

Pipeline fluid flows are indicated below.Determine the maximum flow from Node 1 to Node 4.

(Multiple Choice)

4.7/5

(35)

Question 66

Maximization assignment problems can easily be converted to minimization problems by subtracting each rating from the largest rating in the table.

(True/False)

4.7/5

(38)

Question 67

Table M8-13 -Table M8-13 provides information about a transportation problem.This problem is

(Multiple Choice)

4.9/5

(35)

Question 68

Which of the following is not considered a special situation with the transportation algorithm?

(Multiple Choice)

4.8/5

(37)

Question 69

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.

(True/False)

4.7/5

(33)

Question 70

Which of the following is not a step in the Hungarian method of assignment?

(Multiple Choice)

4.8/5

(35)

Question 71

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

(Multiple Choice)

4.7/5

(45)

Question 72

In revising the opportunity cost table of the assignment problem,after drawing lines through all of the zeros,

(Multiple Choice)

4.9/5

(42)

Question 73

Given the following traffic flows,in hundreds of cars per hour,what is the maximum traffic flow from Town 1 to Town 7?

(Multiple Choice)

4.7/5

(41)

Question 74

A "balanced problem" exists in a transportation model when the optimal solution has the same amount being shipped over all paths that have any positive shipment.

(True/False)

4.9/5

(33)

Question 75

In using the stepping-stone method,the path can turn at any box or cell that is unoccupied.

(True/False)

4.8/5

(27)

Question 76

Find the shortest route from Node 1 to Node 6.

(Multiple Choice)

4.7/5

(39)

Question 77

A traveling salesperson might use the shortest route technique to minimize the distance traveled to reach one of his/her customers.

(True/False)

4.8/5

(41)

Question 78

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

(Multiple Choice)

4.8/5

(34)

Question 79

Which of the following is used to summarize conveniently and concisely all relevant data and to keep track of algorithm computations?

(Multiple Choice)

4.9/5

(41)

Question 80

Showing 61 - 80 of 111

Exam 23: Transportation, Assignment, and Network Algorithms

When using a general LP model for transportation problems,if there are 4 sources and 3 destinations,which of the following statements is true?

In Table M8-3,suppose shipping cost from source C to point 2 was 8,which below would be true?

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

Table M8-14 -The solution shown in Table M8-14 is

Table M8-10 -What is wrong with Table M8-10?

Pipeline fluid flows are indicated below.Determine the maximum flow from Node 1 to Node 4.

Maximization assignment problems can easily be converted to minimization problems by subtracting each rating from the largest rating in the table.

Table M8-13 -Table M8-13 provides information about a transportation problem.This problem is

Which of the following is not considered a special situation with the transportation algorithm?

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.

Which of the following is not a step in the Hungarian method of assignment?

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

In revising the opportunity cost table of the assignment problem,after drawing lines through all of the zeros,

Given the following traffic flows,in hundreds of cars per hour,what is the maximum traffic flow from Town 1 to Town 7?

A "balanced problem" exists in a transportation model when the optimal solution has the same amount being shipped over all paths that have any positive shipment.

In using the stepping-stone method,the path can turn at any box or cell that is unoccupied.

Find the shortest route from Node 1 to Node 6.

A traveling salesperson might use the shortest route technique to minimize the distance traveled to reach one of his/her customers.

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

Which of the following is used to summarize conveniently and concisely all relevant data and to keep track of algorithm computations?

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