Question 1

The number of constraints in network flow problems is determined by the number of

Accepted Answer

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

Question 2

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

Accepted Answer

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

Question 3

A manufacturing company has a pool of 50 labor hours.A customer has requested two products,Product A and Product B,and has requested 15 and 20 of each respectively.It requires 2 hours of labor to produce Product A and 3 hours of labor to produce Product B.The company can obtain up to 50 additional hours of labor if required.In- house labor costs $25 per hour while contracted labor costs $45 per hour.Draw the network flow model that captures this problem.

Accepted Answer

The answer of A manufacturing company has a pool of...

Question 4

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 5

How many arcs are required to make a spanning tree in a network with n nodes and m arcs?

Accepted Answer

A) n 
B) n − 1 
C) m 
D) m − 1 
A) n 
B) n − 1 
C) m 
D) m − 1

Question 6

In generalized network flow problems

Accepted Answer

A) solutions may not be integer values. 
B) flows along arcs may increase or decrease. 
C) it can be difficult to tell if total supply is adequate to meet total demand. 
D) all of these. 
A) solutions may not be integer values. 
B) flows along arcs may increase or decrease. 
C) it can be difficult to tell if total supply is adequate to meet total demand. 
D) all of these.

Question 7

A company wants to determine the optimal replacement policy for its photocopier.The company does not keep photocopiers longer than 4 years.The company has estimated the annual costs for photocopiers during each of the 4 years and developed the following network representation of the problem.
Write out the LP formulation for this problem.

Accepted Answer

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

Question 8

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

Accepted Answer

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

Question 9

What is the constraint for node 2 in the following shortest path problem?

Accepted Answer

A) −X12 − X13 = 0 
B) −X12 − X24 = 1 
C) X12 + X13 = 0 
D) −X12 + X24 = 0 
A) −X12 − X13 = 0 
B) −X12 − X24 = 1 
C) X12 + X13 = 0 
D) −X12 + X24 = 0

Question 10

The minimal spanning tree solution algorithm works by defining a subnetwork and

Accepted Answer

A) adding the least expensive arc which connects any node in the current subnetwork to any node not in the current subnetwork. 
B) adding the most expensive arc which connects any node in the current subnetwork to any node not in the current subnetwork. 
C) adding the least expensive arc which connects unconnected nodes in the current subnetwork. 
D) adding the least expensive arc which connects the most recently added node in the current subnetwork to the closest node not in the current subnetwork. 
A) adding the least expensive arc which connects any node in the current subnetwork to any node not in the current subnetwork. 
B) adding the most expensive arc which connects any node in the current subnetwork to any node not in the current subnetwork. 
C) adding the least expensive arc which connects unconnected nodes in the current subnetwork. 
D) adding the least expensive arc which connects the most recently added node in the current subnetwork to the closest node not in the current subnetwork.

Question 11

Joe Fix plans the repair schedules each day for the Freeway Airline.Joe has 3 planes in need of repair and 5 repair personnel at his disposal.Each plane requires a single repairperson,except plane 3,which needs 2 personnel.Anyone not assigned to maintaining an airplane works in the maintenance shop for the day not modeled).Each repairperson has different likes and dislikes regarding the types of repairs they prefer.For each plane,Joe has pulled the expected maintenance and determined the total preference matrix for his repair personnel.The preference matrix is:
 $\begin{array}{lrrr} 
& \text { Plane 1 } & \text { Plane 2 } & \text { Plane 3 } \
\hline \text { Repair Person 1 } & 11 & 9 & 21 \
\text { Repair Person 2 } & 17 & 7 & 13 \
\text { Repair Person 3 } & 9 & 12 & 17 \
\text { Repair Person 4 } & 14 & 8 & 28 \
\text { Repair Person 5 } & 12 & 5 & 12
\end{array}$ 
Draw the balanced network flow for this assignment problem assuming Joe would like to maximize the total preference in his worker-to-aircraft schedule.

Accepted Answer

The answer of Joe Fix plans the repair schedules each...

Question 12

A minimum or maximum flow restriction in the network flow problem can be modeled by

Accepted Answer

A) adding dummy nodes 
B) adding dummy arcs 
C) adding additional flow restrictions on affected arcs 
D) all of the above 
A) adding dummy nodes 
B) adding dummy arcs 
C) adding additional flow restrictions on affected arcs 
D) all of the above

Question 13

What formula would be entered in cell G18 in this Excel model?

Accepted Answer

A) SUMPRODUCTK6:K12,L6:L12) 
B) SUMPRODUCTB6:B16,G6:G16) 
C) SUMPRODUCTG6:G16,K6:K12) 
D) SUMPRODUCTB6:G16,L6:L12) 
A) SUMPRODUCTK6:K12,L6:L12) 
B) SUMPRODUCTB6:B16,G6:G16) 
C) SUMPRODUCTG6:G16,K6:K12) 
D) SUMPRODUCTB6:G16,L6:L12)

Question 14

In the generalized network flow problem solver could not find a feasible solution.This means that:

Accepted Answer

A) the total supply is not capable of meeting the total demand 
B) the total supply is capable of meeting the total demand 
C) the total demand is not capable of meeting the total supply 
D) dummy demand is needed in the formulation 
A) the total supply is not capable of meeting the total demand 
B) the total supply is capable of meeting the total demand 
C) the total demand is not capable of meeting the total supply 
D) dummy demand is needed in the formulation

Question 15

A maximal flow problem differs from other network models in which way?

Accepted Answer

A) arcs are two directional 
B) multiple supply nodes are used 
C) arcs have limited capacity 
D) arcs have unlimited capacity 
A) arcs are two directional 
B) multiple supply nodes are used 
C) arcs have limited capacity 
D) arcs have unlimited capacity

Question 16

A company needs to ship 100 units from Seattle to Denver at the lowest possible cost.The costs associated with shipping between the cities are:
To
 $$\begin{array} { l c c c c } 
\text { From } & \text { Portland } & \text { Spokane } & \text { Salt Lake City } & \text { Denver } \
\hline \text { Seattle } & 100 & 500 & 600 & - \
\text { Portland } & - & 350 & 300 & - \
\text { Spokane } & - & - & 250 & 200 \
\text { Salt Lake City } & - & - & - & 200
\end{array}$$ 
What values would you enter in the Analytic Solver Platform task pane for the following Excel spreadsheet? Objective Cell:
Variables Cells: Constraints Cells:

Accepted Answer

S1U1B0Objective Cell

Question 17

What is the objective function in the following maximal flow problem?

Accepted Answer

A) MIN X41 
B) MAX X12 + X13 
C) MAX X14 
D) MAX X41 
A) MIN X41 
B) MAX X12 + X13 
C) MAX X14 
D) MAX X41

Question 18

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 19

In the assignment problem:

Accepted Answer

A) the sums of all rows and columns must be equal to one. 
B) the number of rows is greater than the number of columns 
C) the number of rows is smaller than the number of columns 
D) there is no limit on the sum of all rows 
A) the sums of all rows and columns must be equal to one. 
B) the number of rows is greater than the number of columns 
C) the number of rows is smaller than the number of columns 
D) there is no limit on the sum of all rows

Question 20

When might a network flow model for a transportation/assignment problem be preferable to a matrix form for the problem?

Accepted Answer

A) When an integer solution is required. 
B) When the problem is large and not fully connected. 
C) When the problem is large and fully connected. 
D) When supply exceeds demand. 
A) When an integer solution is required. 
B) When the problem is large and not fully connected. 
C) When the problem is large and fully connected. 
D) When supply exceeds demand.

The number of constraints in network flow problems is determined by the number of

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

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

How many arcs are required to make a spanning tree in a network with n nodes and m arcs?

In generalized network flow problems

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

What is the constraint for node 2 in the following shortest path problem?

The minimal spanning tree solution algorithm works by defining a subnetwork and

A minimum or maximum flow restriction in the network flow problem can be modeled by

What formula would be entered in cell G18 in this Excel model?

In the generalized network flow problem solver could not find a feasible solution.This means that:

A maximal flow problem differs from other network models in which way?

What is the objective function in the following maximal flow problem?

How could a network be modified if demand exceeds supply?

In the assignment problem:

When might a network flow model for a transportation/assignment problem be preferable to a matrix form for the problem?

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

The number of constraints in network flow problems is determined by the number of

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

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

How many arcs are required to make a spanning tree in a network with n nodes and m arcs?

In generalized network flow problems

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

What is the constraint for node 2 in the following shortest path problem?

The minimal spanning tree solution algorithm works by defining a subnetwork and

A minimum or maximum flow restriction in the network flow problem can be modeled by

What formula would be entered in cell G18 in this Excel model?

In the generalized network flow problem solver could not find a feasible solution.This means that:

A maximal flow problem differs from other network models in which way?

What is the objective function in the following maximal flow problem?

How could a network be modified if demand exceeds supply?

In the assignment problem:

When might a network flow model for a transportation/assignment problem be preferable to a matrix form for the problem?

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 and Evolutionary Optimization

Regression Analysis

Data Mining

Time Series Forecasting

Introduction to Simulation Using Analytic Solver Platform

Queuing Theory

Decision Analysis

Project Management Online

Filters