Spreadsheet Modeling And Decision Analysis 7th Edition By Cliff Ragsdale – Test Bank

Complete Test Bank With Answers

 

 

Sample Questions Posted Below

 

• Almost all network problems can be viewed as special cases of the
  • transshipment problem.
  • shortest path problem.
  • maximal flow problem.
  • minimal spanning tree problem.

ANSWER:  a

• The arcs in a network indicate all of the following except?
  • routes
  • paths
  • constraints
  • connections

ANSWER:  c

• A factory which ships items through the network would be represented by which type of node?
  • demand
  • supply
  • random
  • decision

ANSWER:  b

• A node which can both send to and receive from other nodes is a
  • demand node.
  • supply node.
  • random node.
  • transshipment node.

ANSWER:  d

• Demand quantities for demand nodes in a transshipment problem are customarily indicated by
  • positive numbers.
  • negative numbers.
  • imaginary numbers.
  • either positive or negative numbers.

ANSWER:  a

• Decision variables in network flow problems are represented by
  • nodes.
  • arcs.
  • demands.
  • supplies.

ANSWER:  b

• The number of constraints in network flow problems is determined by the number of
  • nodes.
  • arcs.
  • demands.
  • supplies.

ANSWER:  a

• How many constraints are there in a transshipment problem which has n nodes and m arcs?
  • n
  • m
  • (n + m)
  • (m − n)

ANSWER:  a

• In a transshipment problem, which of the following statements is a correct representation of the balance-of-flow rule if Total Supply < Total Demand?
  • Inflow − Outflow ≥ Supply or Demand
  • Inflow + Outflow ≥ Supply or Demand
  • Inflow − Outflow ≤ Supply or Demand
  • Inflow + Outflow ≤ Supply or Demand

ANSWER:  c

• Supply quantities for supply nodes in a transshipment problem are customarily indicated by
  • positive numbers.
  • negative numbers.
  • imaginary numbers.
  • either positive or negative numbers.

ANSWER:  b

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

a. X12 + X23 = 100 b. X12 − X23 ≤ 100

c. −X12 + X23 ≥ −100 d. X12 − X23 ≥ 100

ANSWER:  d

• The constraint X13 + X23 − X34 ≥ 50 indicates that
  • 50 units are required at node 3.
  • 50 units will be shipped from node 3.
  • 50 units will be shipped in from node 1.
  • 50 units must pass through node 3.

ANSWER:  a

• Which balance of flow rule should be applied at each node in a network flow problem when Total Supply > Total Demand?
  • Inflow − Outflow ≤ Supply or Demand
  • Inflow − Outflow ≥ Supply or Demand
  • Inflow − Outflow = Supply or Demand
  • Inflow − Supply ≥ Outflow or Demand

ANSWER:  b

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

	A	B	C	D	E	F	G	H	I	J	K	L
1
2
3
4												Supply/
5		Ship	From	To	Unit Cost		Nodes	Net Flow	Demand
6		55	1	LAV	2	PHO	60		1	LAV	−100	−100
7		45	1	LAV	4	REN	120		2	PHO	50	50
8		5	2	PHO	3	LAX	160		3	LAX	30	30
9		0	3	LAX	5	SAN	70		4	REN	45	45
10		25	5	SAN	3	LAX	90		5	SAN	90	90
11		0	5	SAN	4	REN	70		6	DEN	35	35
12		0	5	SAN	6	DEN	90		7	SLC	−150	−150
13		0	6	DEN	5	SAN	50
14		0	7	SLC	4	REN	190
15		115	7	SLC	5	SAN	90
16		35	7	SLC	6	DEN	100
17
18						Total	25600

• • SUMPRODUCT(K6:K12,L6:L12)
  • SUMPRODUCT(B6:B16,G6:G16)
  • SUMPRODUCT(G6:G16,K6:K12)
  • SUMPRODUCT(B6:G16,L6:L12)

ANSWER:  b

• How could a network be modified if demand exceeds supply?
  • add extra supply arcs
  • remove the extra demand arcs
  • add a dummy supply
  • add a dummy demand

ANSWER:  c

• What is the interpretation of units “shipped” along arcs from dummy supply nodes to demand nodes?
  • Indicates unmet demand at demand nodes
  • Indicates unmet supply at demand nodes
  • Indicates unmet demand at supply nodes
  • Indicates unmet supply at supply nodes

ANSWER:  a

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

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

ANSWER:  c

• The street intersections in a city road network represent
  • nodes.
  • arcs.
  • resources.
  • expenses.

ANSWER:  a

• The right hand side value for the starting node in a shortest path problem has a value of
  • −1
  • 0
  • 1
  • 2

ANSWER:  a

• The right hand side value for the ending node in a shortest path problem has a value of
  • −1
  • 0
  • 1
  • 2

ANSWER:  c

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

a. −X12 − X13 = 0 b. −X12 − X24 = 1 c. X12 + X13 = 0 d. −X12 + X24 = 0

ANSWER:  d

• 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. 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

ANSWER:  b

 

• 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. X35 + X36 + X37 = 75 b. X37 + X47 ≥ 75

c. .90 X37 + .95 X47 = 75

d. X37 + X47 −X36 − X35 − X45 − X46 ≥ 75

ANSWER:  c

• A network flow problem that allows gains or losses along the arcs is called a
  • non-constant network flow model.
  • non-directional, shortest path model.
  • generalized network flow model.
  • transshipment model with linear side constraints.

ANSWER:  c

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

a. −X12 − X13 = 0

b. MIN −50 X12 − 200 X13 + 100 X24 + 35 X34

c. MIN 50 X12 + 200 X13 + 100 X24 + 35 X34

d. MAX −50 X12 − 200 X13 + 100 X24 + 35 X34

ANSWER:  c

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

	A	B	C	D	E	F	G	H	I	J	K	L
1
2
3
4												Supply/
5		Ship	From	To	Unit Cost		Nodes	Net Flow	Demand
6		55	1	LAV	2	PHO	60		1	LAV	−100	−100
7		45	1	LAV	4	REN	120		2	PHO	50	50
8		5	2	PHO	3	LAX	160		3	LAX	30	30
9		0	3	LAX	5	SAN	70		4	REN	45	45
10		25	5	SAN	3	LAX	90		5	SAN	90	90
11		0	5	SAN	4	REN	70		6	DEN	35	35
12		0	5	SAN	6	DEN	90		7	SLC	−150	−150
13		0	6	DEN	5	SAN	50
14		0	7	SLC	4	REN	190
15		115	7	SLC	5	SAN	90
16		35	7	SLC	6	DEN	100
17
18						Total	25600

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)

ANSWER:  c

• Which property of network flow models guarantees integer solutions?
  • linear constraints and balance of flow equation format
  • linear objective function coefficients
  • integer objective function coefficients
  • integer constraint RHS values and balance of flow equation format

ANSWER:  d

• In generalized network flow problems
  • solutions may not be integer values.
  • flows along arcs may increase or decrease.
  • it can be difficult to tell if total supply is adequate to meet total demand.
  • all of these.

ANSWER:  d

• 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 model solution is not guaranteed to be integer.
  • The model solution will more accurately reflect reality.
  • The model solution will be integer but more accurate.
  • The model solution is not guaranteed to be feasible.

ANSWER:  a

• 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?
  • Place a limit of 34 on each in-flow arc.
  • Add a side constraint limiting the out-flow arcs sum to 100.
  • Separate the warehouse node into two nodes, connected by a single arc, with capacity of 100.
  • It cannot be accomplished, a side constraint must be added.

ANSWER:  c

• The equipment replacement problem is an example of which network problem?
  • transportation problem.
  • shortest path problem.
  • maximal flow problem.
  • minimal spanning tree problem.

ANSWER:  b

• 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?
  • Force all the arc flow decision variables to be integer.
  • Round off all the non-integer arc flow decision variables.
  • Increase the supply until the solutions are all integer using a dummy supply node.
  • Increase the demand until the solutions are all integer using a dummy demand node.

ANSWER:  a

• A maximal flow problem differs from other network models in which way?
  • arcs are two directional
  • multiple supply nodes are used
  • arcs have limited capacity
  • arcs have unlimited capacity

ANSWER:  c

• Maximal flow problems are converted to transshipment problems by
  • connecting the supply and demand nodes with a return arc
  • adding extra supply nodes
  • adding supply limits on the supply nodes
  • requiring integer solutions

ANSWER:  a

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

• • MIN X41
  • MAX X12 + X13
  • MAX X14
  • MAX X41

ANSWER:  d

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

a. X12 − X23 − X24 = 0 b. X12 + X23 + X24 = 0 c. X12 ≤ 4

d. X12 + X13 − X23 = 0

ANSWER:  a

• What is missing from transportation problems compared to transshipment problems?
  • arcs
  • demand nodes
  • transshipment nodes
  • supply nodes

ANSWER:  c

• Which method is preferred for solving fully connected transportation problems?
  • linear programming
  • network flow methods
  • trial and error
  • simulation

ANSWER:  a

• When might a network flow model for a transportation/assignment problem be preferable to a matrix form for the problem?
  • When an integer solution is required.
  • When the problem is large and not fully connected.
  • When the problem is large and fully connected.
  • When supply exceeds demand.

ANSWER:  b

• Which method is preferred for solving minimal spanning tree problems?
  • linear programming
  • transshipment models
  • simulation
  • manual algorithms

ANSWER:  d

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

ANSWER:  b

• The minimal spanning tree solution algorithm works by defining a subnetwork and
  • adding the least expensive arc which connects any node in the current subnetwork to any node not in the current subnetwork.
  • adding the most expensive arc which connects any node in the current subnetwork to any node not in the current subnetwork.
  • adding the least expensive arc which connects unconnected nodes in the current subnetwork.
  • 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.

ANSWER:  a

• Draw the network representation of the following network flow problem.

MIN: 5 X12 + 3 X13 + 2 X14 + 3 X24 + 2 X34

Subject to: −X12 − X13 − X14 = −10

X12 − X24 = 2 X13 − X34 = 3

X14 + X24 + X34 = 5

Xij ≥ 0 for all i and j

ANSWER:  

• 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

	0-1	1-2
Operating Cost	$15,000	$16,500
Trade-in Value	$20,000	$16,000

           Draw the network representation of this problem

ANSWER:   

• 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.

ANSWER:  MIN: 26 X12 + 50 X13 + 25 X23 + 50 X24 + 28 X34 + 40 X35 + 17 X45

Subject to: −X12 − X13 = −1

X12 − X23 − X24 = 0

X13 + X23 − X34 − X35 = 0 X24 + X34 − X45 = 0

X45 + X35 = 1

• 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

From	Lexington	Washington	Charlottesville
Roanoke	50	−	80
Lexington	−	50	40
Charlottesville	−	30

Draw the network representation of this problem.

ANSWER:  

• 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

From	Portland	Spokane	Salt Lake City	Denver
Seattle Portland Spokane	100 (X12) − −	500 (X13) 350 (X23) −	600 (X14) 300 (X24) 250 (X34)	− − 200 (X35)
Salt Lake City	−	−	−	200 (X45)

Write out the LP formulation for this problem.

ANSWER:  MIN: 100 X12 + 500 X13 + 600 X14 + 350 X23 + 300 X24 + 250 X34 + 200 X35 + 200 X45

Subject to: −X12 − X13 − X14 ≥ −100

X12 − X23 − X24 = 0 X13 − X34 − X35 = 0

X14 + X24 + X34 − X45 = 0 X35 + X45 ≥ 100

Xij ≥ 0

• 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
From	Portland	Spokane	Salt Lake City	Denver
Seattle	100	500	600	−
Portland	−	350	300	−
Spokane	−	−	250	200
Salt Lake City	−	−	−	200

What values should go into cells G6:L13 in the following Excel spreadsheet?

	A	B	C	D	E	F	G	H	I	J	K	L
1
2
3
4												Supply/
5		Ship	From	To	Unit Cost		Nodes	Net Flow	Demand
6			1	SEA	2	POR			1	SEA
7			1	SEA	3	SPO			2	POR
8			1	SEA	4	SLC			3	SPO
9			2	POR	3	SPO			4	SLC
10			2	POR	4	SLC			5	DEN
11			3	SPO	4	SLC
12			3	SPO	5	DEN
13			4	SLC	5	DEN
14
15				Total cost

ANSWER:

	A	B	C	D	E	F	G	H	I	J	K	L
1
2
3
4												Supply/
5		Ship	From	To	Unit Cost		Nodes	Net Flow	Demand
6			1	SEA	2	POR	100		1	SEA	−100	−100
7			1	SEA	3	SPO	500		2	POR	0	0
8			1	SEA	4	SLC	600		3	SPO	0	0
9			2	POR	3	SPO	350		4	SLC	0	0
10			2	POR	4	SLC	300		5	DEN	100	100
11			3	SPO	4	SLC	250
12			3	SPO	5	DEN	200
13			4	SLC	5	DEN	200
14
15				Total cost

• 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

From	Portland	Spokane	Salt Lake City	Denver
Seattle	100	500	600	−
Portland	−	350	300	−
Spokane	−	−	250	200
Salt Lake City	−	−	−	200

What values would you enter in the Analytic Solver Platform task pane for the following Excel spreadsheet? Objective Cell:

Variables Cells: Constraints Cells:

	A	B	C	D	E	F	G	H	I	J	K	L
1
2
3
4												Supply/
5		Ship	From	To	Unit Cost		Nodes	Net Flow	Demand
6			1	SEA	2	POR	100		1	SEA	−100	−100
7			1	SEA	3	SPO	500		2	POR	0	0
8			1	SEA	4	SLC	600		3	SPO	0	0
9			2	POR	3	SPO	350		4	SLC	0	0
10			2	POR	4	SLC	300		5	DEN	100	100
11			3	SPO	4	SLC	250
12			3	SPO	5	DEN	200
13			4	SLC	5	DEN	200
14
15				Total cost

ANSWER:  Objective Cell:

G15

Variables Cells:

B6:B13

Constraints Cells:

B6:B13 ≥ 0 K6:K10 = L6:L10

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

	A	B	C	D	E	F	G	H	I	J	K	L
1
2
3
4		Select					Driving					Supply/
5		Route	From	To	Time		Nodes	Net Flow	Demand
6		0	1	SEA	2	POR	3		1	SEA	−1
7		0	1	SEA	3	SPO	4		2	POR	0
8		1	1	SEA	4	SLC	12		3	SPO	0
9		0	1	SEA	5	DEN	18		4	SLC	0
10		0	2	POR	3	SPO	9		5	DEN	1
11		0	2	POR	4	SLC	12
12		0	2	POR	5	DEN	16
13		0	3	SPO	4	SLC	10
14		0	3	SPO	5	DEN	15
15		1	4	SLC	5	DEN	5
16
17			Total Driving Time	17

ANSWER:

	A	B	C	D	E	F	G	H	I	J	K	L
1
2
3
4		Select					Driving					Supply/
5		Route	From	To	Time		Nodes	Net Flow	Demand
6		0	1	SEA	2	POR	3		1	SEA	−1	−1
7		0	1	SEA	3	SPO	4		2	POR	0	0
8		1	1	SEA	4	SLC	12		3	SPO	0	0
9		0	1	SEA	5	DEN	18		4	SLC	0	0
10		0	2	POR	3	SPO	9		5	DEN	1	1
11		0	2	POR	4	SLC	12
12		0	2	POR	5	DEN	16
13		0	3	SPO	4	SLC	10
14		0	3	SPO	5	DEN	15
15		1	4	SLC	5	DEN	5
16
17			Total Driving Time	17

• 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.

ANSWER:  MIN: 15X13 + 13X14 + 9X23 + 11X24 + 4X35 + 7X36 + 8X37 + 3X45 + 9X46 + 6X47

Subject to: −X13 − X14 = −100

−X23 − X24 = −50

0.80X13 + 0.95X23 − X35 − X36 − X37 = 0

0.85X14 + 0.85X24 − X45 − X46 − X47 = 0

0.95X35 + 0.90X45 = 50

0.90X36 + 0.95X46 = 25

0.90X37 + 0.95X47 = 75

Xij ≥ 0

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

	A	B	C	D	E	F	G	H	I	J	K	L	M
1
2
3
4								Unit				Net	Supply/
5		Flow from Node	Yield	Flow into Node	Cost		Nodes	Flow	Demand
6		1	Crude A	0.90		3	Refinery 1	15		1	Crude A		−120
7		1	Crude A	0.85		4	Refinery 2	13		2	Crude B		−60
8		2	Crude B	0.80		3	Refinery 1	9		3	Refinery 1		0
9		2	Crude B	0.85		4	Refinery 2	11		4	Refinery 2		0
10		3	Refinery 1	0.95		5	Lube Oil	4		5	Lube Oil		75
11		3	Refinery 1	0.90		6	Gasoline	7		6	Gasoline		50
12		3	Refinery 1	0.90		7	Diesel	8		7	Diesel		25
13		4	Refinery 2	0.90		5	Lube Oil	3
14		4	Refinery 2	0.95		6	Gasoline	9
15		4	Refinery 2	0.95		7	Diesel	6
16
17							Total cost

ANSWER:  D6*A6, copied to E7:E15

• 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:

	A	B	C	D	E	F	G	H	I	J	K	L	M
1
2
3
4								Unit				Net	Supply/
5		Flow from Node	Yield		Flow into Node	Cost		Nodes	Flow	Demand
6		1	Crude A	0.90		3	Refinery 1	15		1	Crude A		−120
7		1	Crude A	0.85		4	Refinery 2	13		2	Crude B		−60
8		2	Crude B	0.80		3	Refinery 1	9		3	Refinery 1		0
9		2	Crude B	0.85		4	Refinery 2	11		4	Refinery 2		0
10		3	Refinery 1	0.95		5	Lube Oil	4		5	Lube Oil		75
11		3	Refinery 1	0.90		6	Gasoline	7		6	Gasoline		50
12		3	Refinery 1	0.90		7	Diesel	8		7	Diesel		25
13		4	Refinery 2	0.90		5	Lube Oil	3
14		4	Refinery 2	0.95		6	Gasoline	9
15		4	Refinery 2	0.95		7	Diesel	6
16
17							Total cost

ANSWER:  Objective Cell:

H17

Variables Cells:

A6:A15

Constraints Cells:

A6:A15 ≥ 0 L6:L12 ≥ M6:M12

• 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:

Distance	Center 1	Center 2	Center 3	Center 4	Supply
Plant A	45	60	53	75	500
Plant B	81	27	49	62	700
Plant C	55	40	35	60	650
Demand	350	325	400	375

Draw the transportation network for Clifton’s distribution problem.

ANSWER:  

• 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.

ANSWER:  Let Xij = flow from plant i (A, B, or C) to distribution center j (Center 1, 2, 3, or 4).

MIN: 45 X14 + 60X15 + 53X16 + 75X17 + 81X24 + 27X25 + 49X26 + 62X27

+ 55X34 + 40X35 + 35X36 + 60X37 Subject to: −X14 − X15 − X16 − X17 ≥ −500

−X24 − X25 − X26 − X27 ≥ −700

−X34 − X35 − X36 − X37 ≥ −650 X14 + X24 + X34 ≥ 350

X15 + X25 + X35 ≥ 325 X16 + X26 + X36 ≥ 400 X17 + X27 + X37 ≥ 375

All Xij ≥ 0

• 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:

Distance	Center 1	Center 2	Center 3	Center 4	Supply
Plant A	45	60	53	75	500
Plant B	81	27	49	62	700
Plant C	55	40	35	60	650
Demand	350	325	400	375

Draw the balanced transportation network for Clifton’s distribution problem.

ANSWER:  

• 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.

ANSWER:  Let Xij = flow from plant i (A, B, or C) to distribution center j (Center 1, 2, 3, or 4).

MIN: 45X14 + 60X15 + 53X16 + 75X17 + 81X24 + 27X25 + 49X26 + 62X27

+ 55X34 + 40X35 + 35X36 + 60X37 Subject to: −X14 − X15 − X16 − X17 − X18 = −500

−X24 − X25 − X26 − X27 − X28 = −700

−X34 − X35 − X36 − X37 − X38 = −650 X14 + X24 + X34 = 350

X15 + X25 + X35 = 325 X16 + X26 + X36 = 400 X17 + X27 + X37 = 375 X18 + X28 + X38 = 400

All Xij ≥ 0

• 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:

	Plane 1	Plane 2	Plane 3
Repair Person 1	11	9	21
Repair Person 2	17	7	13
Repair Person 3	9	12	17
Repair Person 4	14	8	28
Repair Person 5	12	5	12

Draw the network flow for this assignment problem assuming Joe would like to maximize the total preference in his worker-to-aircraft schedule.

ANSWER:  

• 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.

ANSWER:  Let Xij = assignment of repairperson i (1, 2, 3, 4, or 5) to plane j (1, 2, or 3).

MIN: 11X16 + 9X17 + 21X18 + 17X26 + 7X27 + 13X28 + 9X36 + 12X37

+ 17X38 + 14X46 + 8X47 + 28X48 + 12X56 + 5X57 + 12X58

Subject to: −X16 − X17 − X18 ≥ −1

−X26 − X27 − X28 ≥ −1

−X36 − X37 − X38 ≥ −1

−X46 − X47 − X48 ≥ −1

−X56 − X57 − X58 ≥ −1

X16 + X26 + X36 + X46 + X56 = 1 X17 + X27 + X37 + X47 + X57 = 1 X18 + X28 + X38 + X48 + X58 = 2

All Xij ≥ 0

• 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:

	Plane 1	Plane 2	Plane 3
Repair Person 1	11	9	21
Repair Person 2	17	7	13
Repair Person 3	9	12	17
Repair Person 4	14	8	28
Repair Person 5	12	5	12

Draw the balanced network flow for this assignment problem assuming Joe would like to maximize the total preference in his worker-to-aircraft schedule.

ANSWER:  

• 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.

ANSWER:  Let Xij = assignment of repairperson i (1, 2, 3, 4, or 5) to plane j (1, 2, or 3).

MIN: 11X16 + 9X17 + 21X18 + 17X26 + 7X27 + 13X28 + 9X36 + 12X37

+ 17X38 + 14X46 + 8X47 + 28X48 + 12X56 + 5X57 + 12X58 Subject to: −X16 − X17 − X18 − X19 = −1

−X26 − X27 − X28 − X29 = −1

−X36 − X37 − X38 − X39 = −1

−X46 − X47 − X48 − X49 = −1

−X56 − X57 − X58 − X59 = −1 X16 + X26 + X36 + X46 + X56 = 1 X17 + X27 + X37 + X47 + X57 = 1 X18 + X28 + X38 + X48 + X58 = 2 X19 + X29 + X39 + X49 + X59 = 1

All Xij ≥ 0

• 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.

ANSWER:  

• 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.

ANSWER:  MINIMIZE 25X13 + 25X14 + 45X23 + 45X24

Subject to: −X13 − X14 ≥ −50

−X23 − X24 ≥ −50 0.50X13 + 0.50X23 ≥ 15

0.33X14 + 0.33X24 ≥ 20

Xij ≥ 0 for i = 1,2; j = 3,4

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

ANSWER:  Supply 1

Demand 6

Transsshipment 2, 3, 4, 5

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

Units					Unit				Net	Supply/
of Flow	From		To		Cost		Nodes		Flow	Demand
5	1	A	2	B	20		1	A	−40	−40
35	1	A	3	C	15		2	B	5	5
0	2	B	4	D	30		3	C	5	5
25	3	C	4	D	10		4	D	10	10
5	3	C	5	E	25		5	E	5	5
15	4	D	6	F	10		6	F	15	15
0	5	E	6	F	30
				Total	1150

ANSWER:  

• A railroad needs to move the maximum amount of material through its rail network. Formulate the LP model to determine this maximum amount based on the following network diagram.

ANSWER:  MAX: Subject	X61 to: X61 − X12 − X13 = 0
	X12 − X25 = 0
	X13 − X35 − X34 = 0
	X34 − X46 = 0
	X25 + X35 − X56 = 0
	X56 + X46 − X61 = 0
	0 ≤ X12 ≤ 5	0 ≤ X13 ≤ 4
	0 ≤ X25 ≤ 6	0 ≤ X35 ≤ 6
	0 ≤ X34 ≤ 6	0 ≤ X56 ≤ 8
	0 ≤ X46 ≤ 2	0 ≤ X61 ≤ ∞

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

Units					Upper				Net	Supply/
of Flow	From		To		Bound		Nodes		Flow	Demand
4	1	A	2	B	4		1	A	0	0
8	1	A	3	C	8		2	B	0	0
4	2	B	4	D	6		3	C	0	0
0	2	B	5	E	2		4	D	0	0
4	3	C	4	D	4		5	E	0	0
4	3	C	5	E	5
8	4	D	5	E	9
12	5	E	1	A	999
12	Maximal flow

ANSWER:

• Draw the network representation of this LP model. What type of problem is it?

MAX X41

Subject to: X41 − X12 − X13 = 0

X12 − X24 = 0 X13 − X34 = 0

X24 + X34 − X41 = 0 0 ≤ X12 ≤ 5,

0 ≤ X13 ≤ 4,

0 ≤ X24 ≤ 3,

0 ≤ X34 ≤ 2,

0 ≤ X41 ≤ ∞

ANSWER:  It is a maximal flow problem.

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

ANSWER:  Arc Value 

1 − 2	4
2 − 4	3
3 − 5	2
4 − 5	4
5 − 6	6
Total	19

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

ANSWER:  Arc Value 

1 − 2	4
2 − 5	2
3 − 5	5
3 − 4	4
Total	15

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

ANSWER:  Arc Value 

1 − 2	5
1 − 3	4
2 − 4	6
3 − 5	4
5 − 6	2
Total	21

 

• 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.

Course	Cost Per Student	Min. Num. of Trainees	Max. Num. of Trainees
A	25	15	40
B	55	10	50
C	30	15	50
D	10	15	50
E	20	10	50
F	15	10	50

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.

• Draw a network flow diagram describing the problem.

• Formulate the associated network flow linear program.

• 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.

• Re-draw the network flow diagram describing the problem to accommodate the above changes.

• Formulate the associated generalized network flow linear program.

Implement a spreadsheet model of this changed model and use Risk Solver Platform (RSP)

• to obtain a solution to the expanded problem. How many recruits are needed and what is the change in total training cost?

ANSWER:  a. Draw a network flow diagram describing the problem.

b.	Formulate the associated network flow linear program.
	Minimize	25 X1A + 55 X1B + 30 X1C + 10 X1D + 20 X1E + 15 X1F
	Subject to:	X1A  X1B  X1C = 100
		X1A  X1E  X1D = 0
		X1B  XB,TP = 0
		X1C  X1F = 0
		XAD  XDF = 0
		XAE  XE.TP = 0
		XCF + XDF  XF,TP = 0
		XB,TP + XE,TP + XF,TP = 100
			10  X1A  50
			15  X1A  40
			10  X1B  50
			15  X1C  50
			10  XAE  50
			15  XAD  50
			10  XB,TP  50
			10  XCF  50
			10  XDF  50
			10  XE,TP  50
			10  XF,TP  50

 

c.	Implement your model in Excel and solve the model. Answer each of the following:
	Load for each course:
		A  40	D  15
		B  25	E  25
		C  35	F  50
	Should any course be expanded:
		Courses A and F are running at capacity
	Should any course or sequence be considered for elimination:
		Sequence A-D-F. Course D is at a minimum level. This minimum forces underutilization of course B.

d.	(5 points) Re-draw and properly label the network flow diagram of part (a) to accommodate the above changes.

 

e.	Formulate this modified model.
	Minimize	25 X1A + 55 X1B + 30 X1C + 10 X1D + 20 X1E + 15 X1F
	Subject to:	X1A  X1B  X1C  0
		0.90 X1A  X1E  X1D = 0
		0.95 X1B  XB,TP = 0
		0.95 X1C  X1F = 0
		0.95 XAD  XDF = 0
		0.90 XAE  XE.TP = 0
		0.90 XCF + XDF  XF,TP = 0
		XB,TP + XE,TP + XF,TP = 100
			15  X1A  40
			10  X1B  50
			15  X1C  50
			10  XAE  50
			15  XAD  50
			10  XCF + XDF  50
f.	Implement this changed model in Excel and solve. How many recruits are needed and what is the change in total training cost?
	A total of 116 recruits are needed, increasing costs to $5,538.95.

 

• 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.

		Production Cost per Clock	Clocks Produced per Hour	Available
Plant	Fixed Cost for Line	Southwest Clock	Northeast Clock	Southwest Clock	Northwest Clock	Hours per Month
Toledo	$20,000	$10	$12	5	6	500
Centerville	$24,000	$  9	$13	5.5	6.2	675

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

Plant	St Louis	Pittsburgh
Toledo	$2	$4
Centerville	$3	$2

Develop a generalized network flow model for this problem and implement this model in solver. Use the model to answer the following questions.

• Should any of the production lines be shut down?
• 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?
• What is the expected monthly profit?
• If a plant is closed, what are the estimated monthly savings?

 

ANSWER:  The following network diagram captures the Small Production problem:

The decision whether to keep open or close a plant is captured in the early arcs, which are modeled as binary, flow equal zero or flow equal one. Once opened, the flow opening that plant is transformed into the hours available at that plant. These hours are then used to produce either the Southwest Clock (product 1) or the Northeast Clock (product 2). Any unused hours flow into the collection node, Unused Hours. These products has a per unit production cost captured by the next set of flows. Distribution  costs and the distribution plan are captured in the arcs between the Prod # Cost nodes and the St Louis and Pittsburgh nodes. Finally, sales of the products are captured in the flows from the warehouses to the Prod # Sales nodes. These final nodes indicate the product demand set for the problem.

This problem is essentially a generalized network flow problem with side constraints. Analysis of this problem indicates closing Toledo. Both clock products are produced at Centerville. The 675 hours available at Centerville are allocated as follows: 340.9 hours for the Southwest Clock, 322.6 hours for the Northeast Clock, and the remaining 11.5 hours unused. This yields an expected monthly profit of $16,625 on these clock products. This is a savings of $20,000. With both plants open, the expected loss per month is $3,375 as Toledo will produce the Southwest Clocks leaving an excess of 125 hours and Centerville will produce the Northeast Clocks leaving an excess of 352.4 hours.

• The supply nodes in the graphical representation of the transshipment problem:
  • have all directed arcs originating at them
  • have all directed arcs terminating at them
  • have some unidirectional arcs
  • are greater than the demand nodes

ANSWER:  a

• The supply nodes in the graphical representation of the transshipment problem:
  • have total available quantities expressed as negative numbers
  • have all directed arcs terminating at them
  • have some unidirectional arcs
  • have total demanded quantities expressed as positive numbers

ANSWER:  a

• The demand nodes in the graphical representation of the transshipment problem:
  • have all directed arcs originating at them
  • have all directed arcs terminating at them
  • have some unidirectional arcs
  • are greater than the demand nodes

ANSWER:  b

• The demand nodes in the graphical representation of the transshipment problem:
  • have total demanded quantities expressed as positive numbers
  • have all directed arcs originating at them
  • have some unidirectional arcs
  • have total available quantities expressed as negative numbers

ANSWER:  a

• The transshipment nodes in the graphical representation of the transshipment problem:
  • have total demanded quantities expressed as positive numbers
  • have all directed arcs originating at them
  • have some unidirectional arcs
  • have all directed arcs terminating at them

ANSWER:  a

• In the shortest route model, the originating and terminating network nodes are called:
  • source and sink
  • source and end
  • beginning and end
  • beginning and sink

ANSWER:  a

• 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:
  • the conservation of flow principle
  • the node-arc incidence matrix
  • a directed chain
  • integrality constraint

ANSWER:  a

• In the assignment problem:
  • the sums of all rows and columns must be equal to one.
  • the number of rows is greater than the number of columns
  • the number of rows is smaller than the number of columns
  • there is no limit on the sum of all rows

ANSWER:  a

• The assignment problem is equivalent to a transportation problem with
  • the sums of all rows and columns equal to one.
  • binary decision variables.
  • non-negativity constraints removed.
  • all of the above.

ANSWER:  d

• In the generalized network flow problem solver could not find a feasible solution. This means that:
  • the total supply is not capable of meeting the total demand
  • the total supply is capable of meeting the total demand
  • the total demand is not capable of meeting the total supply
  • dummy demand is needed in the formulation

ANSWER:  a

• A minimum or maximum flow restriction in the network flow problem can be modeled by
  • adding dummy nodes
  • adding dummy arcs
  • adding additional flow restrictions on affected arcs
  • all of the above

ANSWER:  d

• For a network with n nodes, a spanning tree is
  • a set of (n-1) arcs that connects all nodes and contains no loops
  • a set of dummy arcs
  • a set of n arcs that connects all nodes
  • a random subset of arcs covering all nodes

ANSWER:  a