Question 1

How could a network be modified if demand exceeds supply?

Accepted Answer

A)  add extra supply arcs 
B)  remove the extra demand arcs 
C)  add a dummy supply 
D)  add a dummy demand 
A)  add extra supply arcs 
B)  remove the extra demand arcs 
C)  add a dummy supply 
D)  add a dummy demand

Question 2

Demand quantities for demand nodes in a transshipment problem are customarily indicated by

Accepted Answer

A)  positive numbers. 
B)  negative numbers. 
C)  imaginary numbers. 
D)  either positive or negative numbers. 
A)  positive numbers. 
B)  negative numbers. 
C)  imaginary numbers. 
D)  either positive or negative numbers.

Question 3

What is the correct constraint for node 2 in the following diagram? ​   ​

Accepted Answer

A)  X12 + X23 = 100 
B)  X12 − X23 ≤ 100 
C)  −X12 + X23 ≥ −100 
D)  X12 − X23 ≥ 100 
A)  X12 + X23 = 100 
B)  X12 − X23 ≤ 100 
C)  −X12 + X23 ≥ −100 
D)  X12 − X23 ≥ 100

Question 4

Solve the following minimal spanning tree problem starting at node 1.
​

Accepted Answer

The answer of Solve the following minimal spanning tree problem...

Question 5

Consider the equipment replacement problem presented in the chapter. Recall that in the network model formulation of this problem a node represents a year when the equipment was purchased. An arc from node i to node j indicates that the equipment purchased in year i can be replaced at the beginning of year j. How could the network model below be modified to depict an equipment purchase in year 4 and operating costs only through the remainder of the planning window? ​   ​

Accepted Answer

A)  Modify the cost on arc 4-5 to account for only operating costs. 
B)  Add a second arc 4-5 to represent just the operating costs. 
C)  Add a dummy node, 6, so that arc 4-6 represents just the operating costs. 
D)  Add a dummy node, 6, so that arc 4-5 represents operating costs and 5-6 represents new equipment purchase. 
A)  Modify the cost on arc 4-5 to account for only operating costs. 
B)  Add a second arc 4-5 to represent just the operating costs. 
C)  Add a dummy node, 6, so that arc 4-6 represents just the operating costs. 
D)  Add a dummy node, 6, so that arc 4-5 represents operating costs and 5-6 represents new equipment purchase.

Question 6

The equipment replacement problem is a common type of business problem that can be modeled as a shortest path problem.

Accepted Answer

A) True 
 B)False

Question 7

Consider modeling a warehouse with three in-flow arcs and three outflow arcs. The warehouse node is a transshipment node but has a capacity of 100. How would one modify the network model to avoid adding a side constraint that limits either the sum of in-flows or the sum of the out-flows to 100?

Accepted Answer

A)  Place a limit of 34 on each in-flow arc. 
B)  Add a side constraint limiting the out-flow arcs sum to 100. 
C)  Separate the warehouse node into two nodes, connected by a single arc, with capacity of 100. 
D)  It cannot be accomplished, a side constraint must be added. 
A)  Place a limit of 34 on each in-flow arc. 
B)  Add a side constraint limiting the out-flow arcs sum to 100. 
C)  Separate the warehouse node into two nodes, connected by a single arc, with capacity of 100. 
D)  It cannot be accomplished, a side constraint must be added.

Question 8

A trucking company wants to find the quickest route from Seattle to Denver. What values should be placed in cells L6:L10 of the following Excel spreadsheet?

Accepted Answer

The answer of A trucking company wants to find the...

Question 9

Which formula should be used to determine the Net Flow values in cell K6 in the following spreadsheet model?

Accepted Answer

A)  SUMIF($C$6:$C$16,I6,$B$6:$B$16)−SUMIF($E$6:$E$16,I6,$B$6:$B$16) 
B)  SUMIF($I$6:$I$12,B6,$B$6:$B$16)−SUMIF($I$6:$I$12,I6,$B$6:$B$16) 
C)  SUMIF($E$6:$E$16,I6,$B$6:$B$16)−SUMIF($C$6:$C$16,I6,$B$6:$B$16) 
D)  SUMPRODUCT(B6:B16,G6:G16) 
A)  SUMIF($C$6:$C$16,I6,$B$6:$B$16)−SUMIF($E$6:$E$16,I6,$B$6:$B$16) 
B)  SUMIF($I$6:$I$12,B6,$B$6:$B$16)−SUMIF($I$6:$I$12,I6,$B$6:$B$16) 
C)  SUMIF($E$6:$E$16,I6,$B$6:$B$16)−SUMIF($C$6:$C$16,I6,$B$6:$B$16) 
D)  SUMPRODUCT(B6:B16,G6:G16)

Question 10

Maximal flow problems are converted to transshipment problems by

Accepted Answer

A)  connecting the supply and demand nodes with a return arc 
B)  adding extra supply nodes 
C)  adding supply limits on the supply nodes 
D)  requiring integer solutions 
A)  connecting the supply and demand nodes with a return arc 
B)  adding extra supply nodes 
C)  adding supply limits on the supply nodes 
D)  requiring integer solutions

Question 11

A factory which ships items through the network would be represented by which type of node?

Accepted Answer

A)  demand 
B)  supply 
C)  random 
D)  decision 
A)  demand 
B)  supply 
C)  random 
D)  decision

Question 12

What happens to the solution of a network flow model if side constraints are added that do not obey the balance of flow rules?

Accepted Answer

A)  The model solution is not guaranteed to be integer. 
B)  The model solution will more accurately reflect reality. 
C)  The model solution will be integer but more accurate. 
D)  The model solution is not guaranteed to be feasible. 
A)  The model solution is not guaranteed to be integer. 
B)  The model solution will more accurately reflect reality. 
C)  The model solution will be integer but more accurate. 
D)  The model solution is not guaranteed to be feasible.

Question 13

The demand nodes in the graphical representation of the transshipment problem:

Accepted Answer

A)  have total demanded quantities expressed as positive numbers 
B)  have all directed arcs originating at them 
C)  have some unidirectional arcs 
D)  have total available quantities expressed as negative numbers 
A)  have total demanded quantities expressed as positive numbers 
B)  have all directed arcs originating at them 
C)  have some unidirectional arcs 
D)  have total available quantities expressed as negative numbers

Question 14

Which method is preferred for solving fully connected transportation problems?

Accepted Answer

A)  linear programming 
B)  network flow methods 
C)  trial and error 
D)  simulation 
A)  linear programming 
B)  network flow methods 
C)  trial and error 
D)  simulation

Question 15

The equipment replacement problem is an example of which network problem?

Accepted Answer

A)  transportation problem. 
B)  shortest path problem. 
C)  maximal flow problem. 
D)  minimal spanning tree problem. 
A)  transportation problem. 
B)  shortest path problem. 
C)  maximal flow problem. 
D)  minimal spanning tree problem.

Question 16

A company wants to determine the optimal replacement policy for its delivery truck. New trucks cost $30,000. The company does not keep trucks longer than 2 years and has estimated the annual operating costs and trade-in values for trucks during each of the 2 years as:   ​
Draw the network representation of this problem.

Accepted Answer

The answer of A company wants to determine the optimal...

Question 17

The assignment problem is equivalent to a transportation problem with

Accepted Answer

A)  the sums of all rows and columns equal to one. 
B)  binary decision variables. 
C)  non-negativity constraints removed. 
D)  all of the above. 
A)  the sums of all rows and columns equal to one. 
B)  binary decision variables. 
C)  non-negativity constraints removed. 
D)  all of the above.

Question 18

An oil company wants to create lube oil, gasoline and diesel fuel at two refineries. There are two sources of crude oil. Consider arc 2-4. The per unit shipping cost of crude B from source 2 (node 2) to refinery 2 (node 4) is $11 and the yield is 85 percent. The following network representation depicts this problem. What is the balance of flow constraint for node 3 (Refinery 1)? ​   ​

Accepted Answer

A)  X13 + X23 − .95 X35 − .90 X36 − .90 X37 = 0 
B)  .80 X13 + .95 X23 − X35 − X36 − X37 = 0 
C)  .80 X13 + .95 X23 − .90 X36 − .90 X37 ≥ 0 
D)  X13 + X23 − X35 − X36 − X37 ≥ 0 
A)  X13 + X23 − .95 X35 − .90 X36 − .90 X37 = 0 
B)  .80 X13 + .95 X23 − X35 − X36 − X37 = 0 
C)  .80 X13 + .95 X23 − .90 X36 − .90 X37 ≥ 0 
D)  X13 + X23 − X35 − X36 − X37 ≥ 0

Question 19

Which balance of flow rule should be applied at each node in a network flow problem when Total Supply > Total Demand?

Accepted Answer

A)  Inflow − Outflow ≤ Supply or Demand 
B)  Inflow − Outflow ≥ Supply or Demand 
C)  Inflow − Outflow = Supply or Demand 
D)  Inflow − Supply ≥ Outflow or Demand 
A)  Inflow − Outflow ≤ Supply or Demand 
B)  Inflow − Outflow ≥ Supply or Demand 
C)  Inflow − Outflow = Supply or Demand 
D)  Inflow − Supply ≥ Outflow or Demand

Question 20

Decision variables in network flow problems are represented by

Accepted Answer

A)  nodes. 
B)  arcs. 
C)  demands. 
D)  supplies. 
A)  nodes. 
B)  arcs. 
C)  demands. 
D)  supplies.

How could a network be modified if demand exceeds supply?

Demand quantities for demand nodes in a transshipment problem are customarily indicated by

What is the correct constraint for node 2 in the following diagram?

Solve the following minimal spanning tree problem starting at node 1.

The equipment replacement problem is a common type of business problem that can be modeled as a shortest path problem.

Consider modeling a warehouse with three in-flow arcs and three outflow arcs. The warehouse node is a transshipment node but has a capacity of 100. How would one modify the network model to avoid adding a side constraint that limits either the sum of in-flows or the sum of the out-flows to 100?

A trucking company wants to find the quickest route from Seattle to Denver. What values should be placed in cells L6:L10 of the following Excel spreadsheet?

Which formula should be used to determine the Net Flow values in cell K6 in the following spreadsheet model?

Maximal flow problems are converted to transshipment problems by

A factory which ships items through the network would be represented by which type of node?

What happens to the solution of a network flow model if side constraints are added that do not obey the balance of flow rules?

The demand nodes in the graphical representation of the transshipment problem:

Which method is preferred for solving fully connected transportation problems?

The equipment replacement problem is an example of which network problem?

The assignment problem is equivalent to a transportation problem with

Which balance of flow rule should be applied at each node in a network flow problem when Total Supply > Total Demand?

Decision variables in network flow problems are represented by

Introduction to Modeling and Decision Analysis

Introduction to Optimization and Linear Programming

Modeling and Solving Lp Problems in a Spreadsheet

Sensitivity Analysis and the Simplex Method

Integer Linear Programming

Goal Programming and Multiple Objective Optimization

Nonlinear Programming Evolutionary Optimization

Regression Analysis

Data Mining

Time Series Forecasting

Introduction to Simulation Using Analytic Solver Platform

Queuing Theory

Decision Analysis

Project Management Online

Filters

Exam 5: Network Modeling

How could a network be modified if demand exceeds supply?

Demand quantities for demand nodes in a transshipment problem are customarily indicated by

What is the correct constraint for node 2 in the following diagram? ​ ​

Solve the following minimal spanning tree problem starting at node 1. ​

The equipment replacement problem is a common type of business problem that can be modeled as a shortest path problem.

Consider modeling a warehouse with three in-flow arcs and three outflow arcs. The warehouse node is a transshipment node but has a capacity of 100. How would one modify the network model to avoid adding a side constraint that limits either the sum of in-flows or the sum of the out-flows to 100?

A trucking company wants to find the quickest route from Seattle to Denver. What values should be placed in cells L6:L10 of the following Excel spreadsheet?

Which formula should be used to determine the Net Flow values in cell K6 in the following spreadsheet model?

Maximal flow problems are converted to transshipment problems by

A factory which ships items through the network would be represented by which type of node?

What happens to the solution of a network flow model if side constraints are added that do not obey the balance of flow rules?

The demand nodes in the graphical representation of the transshipment problem:

Which method is preferred for solving fully connected transportation problems?

The equipment replacement problem is an example of which network problem?

The assignment problem is equivalent to a transportation problem with

Which balance of flow rule should be applied at each node in a network flow problem when Total Supply > Total Demand?

Decision variables in network flow problems are represented by

Introduction to Modeling and Decision Analysis

Introduction to Optimization and Linear Programming

Modeling and Solving Lp Problems in a Spreadsheet

Sensitivity Analysis and the Simplex Method

Integer Linear Programming

Goal Programming and Multiple Objective Optimization

Nonlinear Programming Evolutionary Optimization

Regression Analysis

Data Mining

Time Series Forecasting

Introduction to Simulation Using Analytic Solver Platform

Queuing Theory

Decision Analysis

Project Management Online

Filters

What is the correct constraint for node 2 in the following diagram?

Solve the following minimal spanning tree problem starting at node 1.