Question 1

In a maximal flow problem,all the net flows are typically zeros.

Accepted Answer

A) True 
 B)False  True

Question 2

In an unbalanced transportation problem where total demand exceeds total supply,the demand constraints will typically have "≤" inequalities.

Accepted Answer

A) True 
 B)False  True

Question 3

In an unbalanced transportation problem where total supply exceeds total demand,the supply constraints will typically have "≥" inequalities.

Accepted Answer

A) True 
 B)False  False

Question 4

Use this information to answer the following questions.
Bob Jenkins needs to drive from City 1 to City 7 and would like to find the shortest route between the two.The road system with the distance in miles between cities is shown in the network below.What cities should he travel through to minimize his distance?
   
Refer to the following Excel spreadsheet model.
  
-Refer to the network above and its associated spreadsheet.What values would you enter in the Solver Parameter dialog box for the Excel spreadsheet model?
Set Target Cell:
By Changing Cells:
Subject to the Constraints:

Accepted Answer

Set Target Cell: B23

Question 5

The ending node of the shortest path problem has a demand value of +1 associated with it.

Accepted Answer

A) True 
 B)False

Question 6

The addition of constraints other than supply and demand constraints may cause the optimal solution in network flow models to no longer be integers.

Accepted Answer

A) True 
 B)False

Question 7

It is possible to solve small assignment problems by enumerating all possible outcomes rather than modeling them as linear programming problems.

Accepted Answer

A) True 
 B)False

Question 8

Which of the following statements concerning the transshipment model are False?

Accepted Answer

A) A supply node is one where the total flow into the node is less than the total flow out of the node. 
B) A transshipment node is one where the total flow into the node equals the total flow of the node. 
C) The flow balance for a demand node should show a positive RHS value. 
D) The flow balance for a transshipment node should show a negative RHS value. 
E) The flow balance for a supply node should show a negative RHS value. 
A) A supply node is one where the total flow into the node is less than the total flow out of the node. 
B) A transshipment node is one where the total flow into the node equals the total flow of the node. 
C) The flow balance for a demand node should show a positive RHS value. 
D) The flow balance for a transshipment node should show a negative RHS value. 
E) The flow balance for a supply node should show a negative RHS value.

Question 9

Use the information below to answer the following questions.
Consider the following maximal flow problem where node 1 is the source and node 6 is the destination.
  
-Refer to the figure.What is the constraint associated with node 1?

Accepted Answer

A) -X₁₂ - X₁₃ = 1 
B) X₆₁ - X₁₂ - X₁₃ = -1 
C) X₆₁ - X₁₂ - X₁₃ = 1 
D) X₆₁ - X₁₂ - X₁₃ = 0 
E) X₆₁ - X₁₂ - X₁₃ = ∞ 
A) -X₁₂ - X₁₃ = 1 
B) X₆₁ - X₁₂ - X₁₃ = -1 
C) X₆₁ - X₁₂ - X₁₃ = 1 
D) X₆₁ - X₁₂ - X₁₃ = 0 
E) X₆₁ - X₁₂ - X₁₃ = ∞

Question 10

In a maximal flow problem,each node in the network is associated with a decision variable.

Accepted Answer

A) True 
 B)False

Question 11

Use the information below to answer the following questions.
Consider the following maximal flow problem where node 1 is the source and node 6 is the destination.
  
-Refer to the figure.What is the objective function?

Accepted Answer

A) Max X₁₆ 
B) Min X₁₆ 
C) Max X₆₁ 
D) Min X₆₁ 
E) Max X₂₆ + X₅₆ 
A) Max X₁₆ 
B) Min X₁₆ 
C) Max X₆₁ 
D) Min X₆₁ 
E) Max X₂₆ + X₅₆

Question 12

In a maximal flow problem,the right-hand side of the flow balance constraints equals 1.

Accepted Answer

A) True 
 B)False

Question 13

Which of the following models determines the path through the network that connects all the points?

Accepted Answer

A) Transportation model 
B) Assignment model 
C) Product mix model 
D) Shortest-path model 
E) Minimal-spanning tree model 
A) Transportation model 
B) Assignment model 
C) Product mix model 
D) Shortest-path model 
E) Minimal-spanning tree model

Question 14

In a maximal flow problem,if node 1 is the source and node 2 is the destination,the objective function of the LP problem is to maximize the flow along arc X₁₂ .

Accepted Answer

A) True 
 B)False

Question 15

Use this information to answer the following questions.
Bob Jenkins needs to drive from City 1 to City 7 and would like to find the shortest route between the two.The road system with the distance in miles between cities is shown in the network below.What cities should he travel through to minimize his distance?
   
Refer to the following Excel spreadsheet model.
  
-Refer to the network above and its associated spreadsheet.
a.What equation should be entered in cell B23?
b.What equation should be entered in cell B27?
c.What equation should be entered in cell I4?

Accepted Answer

a.= SUMPRODUCT(B4:H1

Question 16

All supply and demand quantities in an assignment model equal one unit.

Accepted Answer

A) True 
 B)False

Question 17

Which of the following is NOT a network flow model?

Accepted Answer

A) Transportation model 
B) Assignment model 
C) Product mix model 
D) Shortest-path model 
E) Minimal-spanning tree model 
A) Transportation model 
B) Assignment model 
C) Product mix model 
D) Shortest-path model 
E) Minimal-spanning tree model

Question 18

Use the information below to answer the following questions.
Consider the following maximal flow problem where node 1 is the source and node 6 is the destination.
  
-Refer to the figure.What is the constraint associated with node 6?

Accepted Answer

A) X₄₆ + X₅₆ = 0 
B) X₄₆ + X₅₆ = 1 
C) X₄₆ + X₅₆ - X₆₁ = 1 
D) X₄₆ + X₅₆ - X₆₁ = -1 
E) X₄₆ + X₅₆ - X₆₁ = 0 
A) X₄₆ + X₅₆ = 0 
B) X₄₆ + X₅₆ = 1 
C) X₄₆ + X₅₆ - X₆₁ = 1 
D) X₄₆ + X₅₆ - X₆₁ = -1 
E) X₄₆ + X₅₆ - X₆₁ = 0

Question 19

Use this information for the following questions.
Neki Sports Company manufacturers 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.
  
-Refer to the information above. Using Excel, 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 answer of Use this information for the following questions.
Neki...

Question 20

Use this information for the following questions.
Neki Sports Company manufacturers 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.
  
-Refer to the information above.Formulate this problem as a linear programming problem.

Accepted Answer

x13 = shipments from Pittsburgh to Chica

In a maximal flow problem,all the net flows are typically zeros.

In an unbalanced transportation problem where total demand exceeds total supply,the demand constraints will typically have "≤" inequalities.

In an unbalanced transportation problem where total supply exceeds total demand,the supply constraints will typically have "≥" inequalities.

The ending node of the shortest path problem has a demand value of +1 associated with it.

The addition of constraints other than supply and demand constraints may cause the optimal solution in network flow models to no longer be integers.

It is possible to solve small assignment problems by enumerating all possible outcomes rather than modeling them as linear programming problems.

Which of the following statements concerning the transshipment model are False?

Use the information below to answer the following questions. Consider the following maximal flow problem where node 1 is the source and node 6 is the destination. -Refer to the figure.What is the constraint associated with node 1?

In a maximal flow problem,each node in the network is associated with a decision variable.

Use the information below to answer the following questions. Consider the following maximal flow problem where node 1 is the source and node 6 is the destination. -Refer to the figure.What is the objective function?

In a maximal flow problem,the right-hand side of the flow balance constraints equals 1.

Which of the following models determines the path through the network that connects all the points?

In a maximal flow problem,if node 1 is the source and node 2 is the destination,the objective function of the LP problem is to maximize the flow along arc X₁₂ .

All supply and demand quantities in an assignment model equal one unit.

Which of the following is NOT a network flow model?

Use the information below to answer the following questions. Consider the following maximal flow problem where node 1 is the source and node 6 is the destination. -Refer to the figure.What is the constraint associated with node 6?

Introduction to Managerial Decision Making

Linear Programming Models: Graphical and Computer Methods

Linear Programming Modeling Applications with Computer Analyses in Excel

Linear Programming Sensitivity Analysis

Integer, Goal, and Nonlinear Programming Models

Project Management

Decision Analysis

Queuing Models

Simulation Modeling

Forecasting Models

Inventory Control Models

Filters

Exam 5: Transportation, Assignment, and Network Models

In a maximal flow problem,all the net flows are typically zeros.

In an unbalanced transportation problem where total demand exceeds total supply,the demand constraints will typically have "≤" inequalities.

In an unbalanced transportation problem where total supply exceeds total demand,the supply constraints will typically have "≥" inequalities.

The ending node of the shortest path problem has a demand value of +1 associated with it.

The addition of constraints other than supply and demand constraints may cause the optimal solution in network flow models to no longer be integers.

It is possible to solve small assignment problems by enumerating all possible outcomes rather than modeling them as linear programming problems.

Which of the following statements concerning the transshipment model are False?

Use the information below to answer the following questions. Consider the following maximal flow problem where node 1 is the source and node 6 is the destination. -Refer to the figure.What is the constraint associated with node 1?

In a maximal flow problem,each node in the network is associated with a decision variable.

Use the information below to answer the following questions. Consider the following maximal flow problem where node 1 is the source and node 6 is the destination. -Refer to the figure.What is the objective function?

In a maximal flow problem,the right-hand side of the flow balance constraints equals 1.

Which of the following models determines the path through the network that connects all the points?

In a maximal flow problem,if node 1 is the source and node 2 is the destination,the objective function of the LP problem is to maximize the flow along arc X₁₂ .

All supply and demand quantities in an assignment model equal one unit.

Which of the following is NOT a network flow model?

Use the information below to answer the following questions. Consider the following maximal flow problem where node 1 is the source and node 6 is the destination. -Refer to the figure.What is the constraint associated with node 6?

Introduction to Managerial Decision Making

Linear Programming Models: Graphical and Computer Methods

Linear Programming Modeling Applications with Computer Analyses in Excel

Linear Programming Sensitivity Analysis

Integer, Goal, and Nonlinear Programming Models

Project Management

Decision Analysis

Queuing Models

Simulation Modeling

Forecasting Models

Inventory Control Models

Filters