Deck 5: Network Modeling

Question 1

The street intersections in a city road network represent

A)nodes.
B)arcs.
C)resources.
D)expenses.

Answer 1

A

Question 2

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?

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.

Answer 2

C

Question 3

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

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

Answer 3

B

Question 4

In a transshipment problem,which of the following statements is a correct representation of the balance-of-flow rule if Total Supply < Total Demand?

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

Question 5

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

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

Question 6

Which balance of flow rule should be applied at each node in a network flow problem when Total Supply > Total 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 7

How many constraints are there in a transshipment problem which has n nodes and m arcs?

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

Question 8

Decision variables in network flow problems are represented by

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

Question 9

What is the interpretation of units "shipped" along arcs from dummy supply nodes to demand nodes?

A)Indicates unmet demand at demand nodes
B)Indicates unmet supply at demand nodes
C)Indicates unmet demand at supply nodes
D)Indicates unmet supply at supply nodes

Question 10

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

A)X₁₂ + X₂₃ = 100
B)X₁₂ − X₂₃ ≤ 100
C)−X₁₂ + X₂₃ ≥ −100
D)X₁₂ − X₂₃ ≥ 100

Question 11

How could a network be modified if demand exceeds supply?

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

Question 12

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

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

Question 13

Almost all network problems can be viewed as special cases of the

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

Question 14

The right hand side value for the ending node in a shortest path problem has a value of

A)−1
B)0
C)1
D)2

Question 15

Supply quantities for supply nodes in a transshipment problem are customarily indicated by

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

Question 16

The arcs in a network indicate all of the following except?

A)routes
B)paths
C)constraints
D)connections

Question 17

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

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

Question 18

A node which can both send to and receive from other nodes is a

A)demand node.
B)supply node.
C)random node.
D)transshipment node.

Question 19

The right hand side value for the starting node in a shortest path problem has a value of

A)−1
B)0
C)1
D)2

Question 20

The constraint X₁₃ + X₂₃ − X₃₄ ≥ 50 indicates that

A)50 units are required at node 3.
B)50 units will be shipped from node 3.
C)50 units will be shipped in from node 1.
D)50 units must pass through node 3.

Question 21

Maximal flow problems are converted to transshipment problems by

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 22

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

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

Question 23

What is the constraint for node 2 in the following maximal flow problem?

A)X₁₂ − X₂₃ − X₂₄ = 0
B)X₁₂ + X₂₃ + X₂₄ = 0
C)X₁₂ ≤ 4
D)X₁₂ + X₁₃ − X₂₃ = 0

Question 24

Which method is preferred for solving fully connected transportation problems?

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

Question 25

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 flowchart depicts this problem.What is the balance of flow constraint for node 7 Diesel)?

A)X₃₅ + X₃₆ + X₃₇ = 75
B)X₃₇ + X₄₇ ≥ 75
C).90 X₃₇ + .95 X₄₇ = 75
D)X₃₇ + X₄₇ −X₃₆ − X₃₅ − X₄₅ − X₄₆ ≥ 75

Question 26

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)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 27

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

A)MIN X₄₁
B)MAX X₁₂ + X₁₃
C)MAX X₁₄
D)MAX X₄₁

Question 28

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

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)SUMPRODUCTB6:B16,G6:G16)

Question 29

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)?

A)X₁₃ + X₂₃ − .95 X₃₅ − .90 X₃₆ − .90 X₃₇ = 0
B).80 X₁₃ + .95 X₂₃ − X₃₅ − X₃₆ − X₃₇ = 0
C).80 X₁₃ + .95 X₂₃ − .90 X₃₆ − .90 X₃₇ ≥ 0
D)X₁₃ + X₂₃ − X₃₅ − X₃₆ − X₃₇ ≥ 0

Question 30

What is the objective function for the following shortest path problem?

A)−X₁₂ − X₁₃ = 0
B)MIN −50 X₁₂ − 200 X₁₃ + 100 X₂₄ + 35 X₃₄
C)MIN 50 X₁₂ + 200 X₁₃ + 100 X₂₄ + 35 X₃₄
D)MAX −50 X₁₂ − 200 X₁₃ + 100 X₂₄ + 35 X₃₄

Question 31

In generalized network flow problems

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 32

If a side constraint for a network flow model cannot be avoided,and non-integer solutions result,how can the solution be expressed as an integer solution?

A)Force all the arc flow decision variables to be integer.
B)Round off all the non-integer arc flow decision variables.
C)Increase the supply until the solutions are all integer using a dummy supply node.
D)Increase the demand until the solutions are all integer using a dummy demand node.

Question 33

A network flow problem that allows gains or losses along the arcs is called a

A)non-constant network flow model.
B)non-directional,shortest path model.
C)generalized network flow model.
D)transshipment model with linear side constraints.

Question 34

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

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.

Question 35

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

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 36

Which property of network flow models guarantees integer solutions?

A)linear constraints and balance of flow equation format
B)linear objective function coefficients
C)integer objective function coefficients
D)integer constraint RHS values and balance of flow equation format

Question 37

Which method is preferred for solving minimal spanning tree problems?

A)linear programming
B)transshipment models
C)simulation
D)manual algorithms

Question 38

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

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

Question 39

What is missing from transportation problems compared to transshipment problems?

A)arcs
B)demand nodes
C)transshipment nodes
D)supply nodes

Question 40

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

A)−X₁₂ − X₁₃ = 0
B)−X₁₂ − X₂₄ = 1
C)X₁₂ + X₁₃ = 0
D)−X₁₂ + X₂₄ = 0

Question 41

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

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

Question 42

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 network flow for this assignment problem assuming Joe would like to maximize the total preference in his worker-to-aircraft schedule.

Question 43

An oil company wants to create lube oil,gasoline and diesel fuel at two refineries.There are two sources of crude oil.The following Excel spreadsheet shows this problem.
What values would you enter in the Analytic Solver Platform task pane for the following Excel spreadsheet? Objective Cell:
Variables Cells: Constraints Cells:

Question 44

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:
$$\begin{array}{c}\text { 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}\end{array}$$
What values should go into cells G6:L13 in the following Excel spreadsheet?

Question 45

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

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 46

Draw the network representation of the following network flow problem.
MIN: ^{5 X}₁₂ ^{+ 3 X}₁₃ ^{+ 2 X}₁₄ ^{+ 3 X}₂₄ ^{+ 2 X}₃₄
Subject to: ^−X₁₂ ^{− X}₁₃ ^{− X}₁₄ ^{= −10}
X₁₂ − X₂₄ = 2 X₁₃ − X₃₄ = 3
X₁₄ + X₂₄ + X₃₄ = 5
X_ij ≥ 0 for all i and j

Question 47

Clifton Distributing has three plants and four distribution centers.The plants,their supply,the distribution centers,their demands,and the distance between each location is summarized in the following table:
$$\begin{array} { r r r r r r } \text { Distance } & \text { Center 1 } & \text { Center 2 } & \text { Center 3 } & \text { Center 4 } & \text { Supply } \\\hline \text { Plant A } & 45 & 60 & 53 & 75 & 500 \\\text { Plant B } & 81 & 27 & 49 & 62 & 70 \\\text { Plant C } & 55 & 40 & 35 & 60 & 650 \\\hline \text { Demant } & 350 & 325 & 400 & 375 &\end{array}$$
Draw the transportation network for Clifton's distribution problem.

Question 48

An oil company wants to create lube oil,gasoline and diesel fuel at two refineries.There are two sources of crude oil.The following network representation depicts this problem.
Write out the LP formulation for this problem.

Question 49

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:
Age in years
$\begin{array}{lll}&0-1&1-2\\\hline\text { Operating Cost } & \$ 15,000 & \$ 16,500 \\\text { Trade-in Value } & \$ 20,000 & \$ 16,000\end{array}$

Draw the network representation of this problem

Question 50

A company needs to ship 100 units from Roanoke to Washington at the lowest possible cost.The costs associated with shipping between the cities are:
To
$$\begin{array} { l c c c } \text { From } & \text { Lexington } & \text { Washington } & \text { Charlottesville } \\\hline \text { Roanoke } & 50 & - & 80 \\\text { Lexington } & - & 50 & 40 \\\text { Charlotterville } & - & 30 &\end{array}$$
Draw the network representation of this problem.

Question 51

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.

Question 52

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?

Question 53

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 listed below.Also,the decision variable associated with each pair of cities is shown next to the cost.
To
$$\begin{array} { l c c c c } \text { From } & \text { Portland } & \text { Spokane } & \text { Salt Lake City } & \text { Denver } \\\hline \text { Seattle } & \left. 100 \mathbf { X } _ { 12 } \right) & \left. 500 \mathbf { X } _ { 13 } \right) & \left. 600 \mathbf { X } _ { 14 } \right) & - \\\text { Portland } & - & \left. 350 \mathbf { X } _ { 23 } \right) & \left. 300 \mathbf { X } _ { 24 } \right) & - \\\text { Spokane } & - & - & \left. 250 \mathbf { X } _ { 34 } \right) & \left. 200 \mathrm { X } _ { 35 } \right) \\\text { Salt Lake } & - & - & - & \text { 200 } \left. \mathbf { X } _ { 45 } \right)\\\text{City}\end{array}$$
Write out the LP formulation for this problem.

Question 54

Clifton Distributing has three plants and four distribution centers.The plants,their supply,the distribution centers,their demands,and the distance between each location is summarized in the following table:
$$\begin{array} { r r r r r r } \text { Distance } & \text { Center 1 } & \text { Center 2 } & \text { Center 3 } & \text { Center 4 } & \text { Supply } \\\hline \text { Plant A } & 45 & 60 & 53 & 75 & 500 \\\text { Plant B } & 81 & 27 & 49 & 62 & 70 \\\text { Plant C } & 55 & 40 & 35 & 60 & 650 \\\hline \text { Demand } & 350 & 325 & 400 & 375 &\end{array}$$
Draw the balanced transportation network for Clifton's distribution problem.

Question 55

The following network depicts an assignment/transportation problem for Joe Fix's repair scheduling problem.Formulate the LP for Joe assuming he wishes to maximize the total repairperson to plane assignment preferences.

Question 56

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:

Question 57

The following network depicts a transportation/distribution problem for Clifton Distributing.Formulate the LP for Clifton assuming they wish to minimize the total product-miles incurred.

Question 58

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.

Question 59

The following network depicts a balanced transportation/distribution problem for Clifton Distributing.Formulate the LP for Clifton assuming they wish to minimize the total product-miles incurred.

Question 60

An oil company wants to create lube oil,gasoline and diesel fuel at two refineries.There are two sources of crude oil.The following Excel spreadsheet shows this problem.What formula should be entered in cell E6 and copied to cells E7:E15)in this spreadsheet?

Question 61

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.The following network flow model captures this problem.
Write out the LP formulation for this problem.

Question 62

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

A)have all directed arcs originating at them
B)have all directed arcs terminating at them
C)have some unidirectional arcs
D)are greater than the demand nodes

Question 63

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

Question 64

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

Question 65

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

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 66

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

A)have all directed arcs originating at them
B)have all directed arcs terminating at them
C)have some unidirectional arcs
D)are greater than the demand nodes

Question 67

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

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 68

Draw the network and indicate how many units are flowing along each arc based on the following Analytic Solver Platform solution.

Question 69

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

Question 70

A company wants to manage its distribution network which is depicted below.Identify the supply,demand and transshipment nodes in this problem.

Question 71

The following network depicts a balanced assignment/transportation problem for Joe Fix's repair scheduling problem.Formulate the LP for Joe assuming he wishes to maximize the total repairperson to plane assignment preferences.

Question 72

In the assignment problem:

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 73

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.

Question 74

Draw the network representation of this LP model.What type of problem is it?
MAX ^X₄₁
Subject to: ^X₄₁ ^{− X}₁₂ ^{− X}₁₃ ^{= 0}
X₁₂ − X₂₄ = 0 X₁₃ − X₃₄ = 0
X₂₄ + X₃₄ − X₄₁ = 0 0 ≤ X₁₂ ≤ 5,
0 ≤ X₁₃ ≤ 4,
0 ≤ X₂₄ ≤ 3,
0 ≤ X₃₄ ≤ 2,
0 ≤ X₄₁ ≤ ∞

Question 75

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

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

Question 76

The idea that the total flow into a node must be consumed at a node and the remainder must flow out of a node is referred to as:

A)the conservation of flow principle
B)the node-arc incidence matrix
C)a directed chain
D)integrality constraint

Question 77

Project 5.2 ? Small Production Planning Project
Fixed Charge Problem via Network Flow with Side Constraints)
Jack Small Enterprises runs two factories in Ohio,one in Toledo and one in Centerville.His factories produce a variety of products.Two of his product lines are polished wood clocks which he adorns with a regional theme.Naturally,clocks popular in the southwest are not as popular in the northeast,and vice versa.Each plant makes both of the clocks.These clocks are shipped to St Louis for distribution to the southeast and western states and to Pittsburgh for distribution to the south and northeast.
Jack is considering streamlining his plants by removing certain production lines from certain plants.Among his options is potentially eliminating the clock production line at either the Toledo or the Centerville plant.Each plant carries a fixed operating cost for setting up the line and a unit production cost,both in terms of money and factory worker hours.This information is summarized in the table below.

The Southwest clocks are sold for $23 each and the Northwest clocks are sold for $25 each.Demand rates used for production planning are 1875 Southwest clocks for sale out of the St Louis distribution center and 2000 Northeast clocks for sale out of the Pittsburgh distribution center.Assume all these units are sold.The per clock transportation costs from plant to distribution center is given in the following table.
cost per clock shipped)Cost to Ship to Distribution Center
$\begin{array}{lcc} \text { Plant } & \text { St Louis } & \text { Pittsburgh } \\\hline \text { Toledo } & \$ 2 & \$ 4 \\\text { Centerville } & \$ 3 & \$ 2\end{array}$

Develop a generalized network flow model for this problem and implement this model in solver.Use the model to answer the following questions.
a.Should any of the production lines be shut down?
b.How should worker hours be allocated to produce the clocks to meet the demand forecasts? Are there any excess hours,and if so how many?
c.What is the expected monthly profit?
d.If a plant is closed,what are the estimated monthly savings?

Question 78

Project 5.1 ? Recruit Training
You are a military training analyst in charge of initial training for the XXX career field and must decide how to best train the new recruits to satisfy the requirements for skilled recruits.There are six different courses A,B,C,D,E,
F)used for training in the XXX career field and four different sequences of courses that can be taken to achieve the required skill level.These sequences are A-E,B,C-F,and A-D-F.The table below provides information on the six courses.
$$\begin{array} { c c c c } \text { Caurse } & \text { Cost Per Student } & \text { Min. Num. af Trainees } & \text { Mar. Num. af Trainees } \\\hline \text { A } & 25 & 15 & 40 \\\text { B } & 55 & 10 & 50 \\\mathrm { C } & 30 & 15 & 50 \\\text { D } & 10 & 15 & 50 \\E & 20 & 10 & 50 \\F & 15 & 10 & 50\end{array}$$
There are 100 recruits available for training and a demand for 100 skilled recruits.Assume all recruits pass each course and that you are trying to put students in classes in order to minimize the total cost of training.Assume non- integer solutions are acceptable.Further,assume each course will be held.
a.Draw a network flow diagram describing the problem.
b.Formulate the associated network flow linear program.
c.Implement a spreadsheet model and use Risk Solver Platform RSP)to obtain a solution to the problem.Use your model to answer the following questions.
What is the expected student load for each course? Should any course be expanded?
Should any course or sequence be considered for elimination?
Next,assume that not all students pass each course.In fact only 90% of the students pass courses A,E,and F and only 95% of the students pass courses B,C,and D.Each course is considered independent.The requirement for 100 skilled recruits remains.Your job is now to determine the number of recruits to place into the training program to obtain the 100 trained recruits while continuing to minimize the total cost of training.
d.Re-draw the network flow diagram describing the problem to accommodate the above changes.
e.Formulate the associated generalized network flow linear program.
Implement a spreadsheet model of this changed model and use Risk Solver Platform RSP)
f.to obtain a solution to the expanded problem.How many recruits are needed and what is the change in total training cost?

Question 79

Draw the network and solution for the maximal flow problem represented by the following Excel spreadsheet.

Question 80

In the shortest route model,the originating and terminating network nodes are called:

A)source and sink
B)source and end
C)beginning and end
D)beginning and sink