{"id":23239,"date":"2022-01-06T06:00:38","date_gmt":"2022-01-06T06:00:38","guid":{"rendered":"https:\/\/assignmenttutors.net\/blog\/chalmers-university-of-technology-econ-121-smda-chapter-05-network\/"},"modified":"2022-01-06T06:00:38","modified_gmt":"2022-01-06T06:00:38","slug":"chalmers-university-of-technology-econ-121-smda-chapter-05-network","status":"publish","type":"post","link":"https:\/\/assignmenttutors.net\/blog\/chalmers-university-of-technology-econ-121-smda-chapter-05-network\/","title":{"rendered":"Chalmers university of technology econ 121 smda chapter 05 – network"},"content":{"rendered":"
\n

\u00a0<\/span><\/h2>\n

MULTIPLE CHOICE<\/span><\/strong><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0 1.\u00a0\u00a0 Almost all network problems can be viewed as special cases of the<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

transshipment problem.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

shortest path problem.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

maximal flow problem.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

minimal spanning tree problem.<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0 2.\u00a0\u00a0 The arcs in a network indicate all of the following except?<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

routes<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

paths<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

constraints<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

connections<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0 3.\u00a0\u00a0 A factory which ships items through the network would be represented by which type of node?<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

demand<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

supply<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

random<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

decision<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0 4.\u00a0\u00a0 A node which can both send to and receive from other nodes is a<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

demand node.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

supply node.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

random node.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

transshipment node.<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0 5.\u00a0\u00a0 Demand quantities for demand nodes in a transshipment problem are customarily indicated by<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

positive numbers.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

negative numbers.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

imaginary numbers.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

either positive or negative numbers.<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0 6.\u00a0\u00a0 Decision variables in network flow problems are represented by<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

nodes.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

arcs.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

demands.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

supplies.<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0 7.\u00a0\u00a0 The number of constraints in network flow problems is determined by the number of<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

nodes.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

arcs.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

demands.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

supplies.<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0 8.\u00a0\u00a0 How many constraints are there in a transshipment problem which has n<\/em> nodes and m<\/em> arcs?<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0 9.\u00a0\u00a0 In a transshipment problem, which of the following statements is a correct representation of the balance-of-flow rule if Total Supply < Total Demand?<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

Inflow <\/span>–<\/span> Outflow <\/span>\u00b3<\/span> Supply or Demand<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

Inflow + Outflow <\/span>\u00b3<\/span> Supply or Demand<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

Inflow <\/span>–<\/span> Outflow <\/span>\u00a3<\/span> Supply or Demand<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

Inflow + Outflow <\/span>\u00a3<\/span> Supply or Demand<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 10.\u00a0\u00a0 Supply quantities for supply nodes in a transshipment problem are customarily indicated by<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

positive numbers.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

negative numbers.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

imaginary numbers.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

either positive or negative numbers.<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 11.\u00a0\u00a0 What is the correct constraint for node 2 in the following diagram?<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\"\"<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

X12<\/sub> + X23<\/sub> = 100<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

X12<\/sub><\/span>–<\/span> X23<\/sub><\/span>\u00a3<\/span> 100<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

–<\/span>X12<\/sub> + X23<\/sub><\/span>\u00b3<\/span>–<\/span>100<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

X12<\/sub><\/span>–<\/span> X23<\/sub><\/span>\u00b3<\/span> 100<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 12.\u00a0\u00a0 The constraint X13<\/sub> + X23<\/sub><\/span>–<\/span> X34<\/sub><\/span>\u00b3<\/span> 50 indicates that<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

50 units are required at node 3.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

50 units will be shipped from node 3.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

50 units will be shipped in from node 1.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

50 units must pass through node 3.<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 13.\u00a0\u00a0 Which balance of flow rule should be applied at each node in a network flow problem when Total Supply > Total Demand?<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

Inflow <\/span>–<\/span> Outflow <\/span>\u00a3<\/span> Supply or Demand<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

Inflow <\/span>–<\/span> Outflow <\/span>\u00b3<\/span> Supply or Demand<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

Inflow <\/span>–<\/span> Outflow = Supply or Demand<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

Inflow <\/span>–<\/span> Supply <\/span>\u00b3<\/span> Outflow or Demand<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 14.\u00a0\u00a0 What formula would be entered in cell G18 in this Excel model?<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

A<\/span><\/p>\n<\/td>\n

\n

B<\/span><\/p>\n<\/td>\n

\n

C<\/span><\/p>\n<\/td>\n

\n

D<\/span><\/p>\n<\/td>\n

\n

E<\/span><\/p>\n<\/td>\n

\n

F<\/span><\/p>\n<\/td>\n

\n

G<\/span><\/p>\n<\/td>\n

\n

H<\/span><\/p>\n<\/td>\n

\n

I<\/span><\/p>\n<\/td>\n

\n

J<\/span><\/p>\n<\/td>\n

\n

K<\/span><\/p>\n<\/td>\n

\n

L<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Supply\/<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Ship<\/span><\/p>\n<\/td>\n

\n

From<\/span><\/p>\n<\/td>\n

\n

To<\/span><\/p>\n<\/td>\n

\n

Unit Cost<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Nodes<\/span><\/p>\n<\/td>\n

\n

Net Flow<\/span><\/p>\n<\/td>\n

\n

Demand<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

55<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

LAV<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

PHO<\/span><\/p>\n<\/td>\n

\n

60<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

LAV<\/span><\/p>\n<\/td>\n

\n

–<\/span>100<\/span><\/p>\n<\/td>\n

\n

–<\/span>100<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

7<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

45<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

LAV<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

REN<\/span><\/p>\n<\/td>\n

\n

120<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

PHO<\/span><\/p>\n<\/td>\n

\n

50<\/span><\/p>\n<\/td>\n

\n

50<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

8<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

PHO<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

LAX<\/span><\/p>\n<\/td>\n

\n

160<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

LAX<\/span><\/p>\n<\/td>\n

\n

30<\/span><\/p>\n<\/td>\n

\n

30<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

9<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

LAX<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

SAN<\/span><\/p>\n<\/td>\n

\n

70<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

REN<\/span><\/p>\n<\/td>\n

\n

45<\/span><\/p>\n<\/td>\n

\n

45<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

10<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

25<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

SAN<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

LAX<\/span><\/p>\n<\/td>\n

\n

90<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

SAN<\/span><\/p>\n<\/td>\n

\n

90<\/span><\/p>\n<\/td>\n

\n

90<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

11<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

SAN<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

REN<\/span><\/p>\n<\/td>\n

\n

70<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

DEN<\/span><\/p>\n<\/td>\n

\n

35<\/span><\/p>\n<\/td>\n

\n

35<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

12<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

SAN<\/span><\/p>\n<\/td>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

DEN<\/span><\/p>\n<\/td>\n

\n

90<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

7<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

–<\/span>150<\/span><\/p>\n<\/td>\n

\n

–<\/span>150<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

13<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

DEN<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

SAN<\/span><\/p>\n<\/td>\n

\n

50<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

14<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

7<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

REN<\/span><\/p>\n<\/td>\n

\n

190<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

15<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

115<\/span><\/p>\n<\/td>\n

\n

7<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

SAN<\/span><\/p>\n<\/td>\n

\n

90<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

16<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

35<\/span><\/p>\n<\/td>\n

\n

7<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

DEN<\/span><\/p>\n<\/td>\n

\n

100<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

17<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

18<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Total<\/span><\/p>\n<\/td>\n

\n

25600<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

SUMPRODUCT(K6:K12,L6:L12)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

SUMPRODUCT(B6:B16,G6:G16)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

SUMPRODUCT(G6:G16,K6:K12)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

SUMPRODUCT(B6:G16,L6:L12)<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 15.\u00a0\u00a0 How could a network be modified if demand exceeds supply?<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

add extra supply arcs<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

remove the extra demand arcs<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

add a dummy supply<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

add a dummy demand<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 16.\u00a0\u00a0 What is the interpretation of units “shipped” along arcs from dummy supply nodes to demand nodes?<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

Indicates unmet demand at demand nodes<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

Indicates unmet supply at demand nodes<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

Indicates unmet demand at supply nodes<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

Indicates unmet supply at supply nodes<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 17.\u00a0\u00a0 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?<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\"\"<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

Modify the cost on arc 4-5 to account for only operating costs.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

Add a second arc 4-5 to represent just the operating costs.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

Add a dummy node, 6, so that arc 4-6 represents just the operating costs.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

Add a dummy node, 6, so that arc 4-5 represents operating costs and 5-6 represents new equipment purchase.<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 18.\u00a0\u00a0 The street intersections in a city road network represent<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

nodes.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

arcs.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

resources.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

expenses.<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 19.\u00a0\u00a0 The right hand side value for the starting node in a shortest path problem has a value of<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 20.\u00a0\u00a0 The right hand side value for the ending node in a shortest path problem has a value of<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 21.\u00a0\u00a0 What is the constraint for node 2 in the following shortest path problem?<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\"\"<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

–<\/span>X12<\/sub><\/span>–<\/span> X13<\/sub> = 0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

–<\/span>X12<\/sub><\/span>–<\/span> X24<\/sub> = 1<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

X12<\/sub> + X13<\/sub> = 0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

–<\/span>X12<\/sub> + X24<\/sub> = 0<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 22.\u00a0\u00a0 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)?<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\"\"<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

X13<\/sub> + X23<\/sub><\/span>–<\/span> .95 X35<\/sub><\/span>–<\/span> .90 X36<\/sub><\/span>–<\/span> .90 X37<\/sub> = 0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

.80 X13<\/sub> + .95 X23<\/sub><\/span>–<\/span> X35<\/sub><\/span>–<\/span> X36<\/sub><\/span>–<\/span> X37<\/sub> = 0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

.80 X13<\/sub> + .95 X23<\/sub><\/span>–<\/span> .90 X36<\/sub><\/span>–<\/span> .90 X37<\/sub><\/span>\u00b3<\/span> 0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

X13<\/sub> + X23<\/sub><\/span>–<\/span> X35<\/sub><\/span>–<\/span> X36<\/sub><\/span>–<\/span> X37<\/sub><\/span>\u00b3<\/span> 0<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 23.\u00a0\u00a0 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)?<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\"\"<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

X35<\/sub> + X36<\/sub> + X37<\/sub> = 75<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

X37<\/sub> + X47<\/sub><\/span>\u00b3<\/span> 75<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

.90 X37<\/sub> + .95 X47<\/sub> = 75<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

X37<\/sub> + X47<\/sub><\/span>–<\/span>X36<\/sub><\/span>–<\/span> X35<\/sub><\/span>–<\/span> X45<\/sub><\/span>–<\/span> X46<\/sub><\/span>\u00b3<\/span> 75<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 24.\u00a0\u00a0 A network flow problem that allows gains or losses along the arcs is called a<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

non-constant network flow model.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

non-directional, shortest path model.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

generalized network flow model.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

transshipment model with linear side constraints.<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 25.\u00a0\u00a0 What is the objective function for the following shortest path problem?<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\"\"<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

–<\/span>X12<\/sub><\/span>–<\/span> X13<\/sub> = 0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

MIN <\/span>–<\/span>50 X12<\/sub><\/span>–<\/span> 200 X13<\/sub> + 100 X24<\/sub> + 35 X34<\/sub><\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

MIN 50 X12<\/sub> + 200 X13<\/sub> + 100 X24<\/sub> + 35 X34<\/sub><\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

MAX <\/span>–<\/span>50 X12<\/sub><\/span>–<\/span> 200 X13<\/sub> + 100 X24<\/sub> + 35 X34<\/sub><\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 26.\u00a0\u00a0 Which formula should be used to determine the Net Flow values in cell K6 in the following spreadsheet model?<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

A<\/span><\/p>\n<\/td>\n

\n

B<\/span><\/p>\n<\/td>\n

\n

C<\/span><\/p>\n<\/td>\n

\n

D<\/span><\/p>\n<\/td>\n

\n

E<\/span><\/p>\n<\/td>\n

\n

F<\/span><\/p>\n<\/td>\n

\n

G<\/span><\/p>\n<\/td>\n

\n

H<\/span><\/p>\n<\/td>\n

\n

I<\/span><\/p>\n<\/td>\n

\n

J<\/span><\/p>\n<\/td>\n

\n

K<\/span><\/p>\n<\/td>\n

\n

L<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Supply\/<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Ship<\/span><\/p>\n<\/td>\n

\n

From<\/span><\/p>\n<\/td>\n

\n

To<\/span><\/p>\n<\/td>\n

\n

Unit Cost<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Nodes<\/span><\/p>\n<\/td>\n

\n

Net Flow<\/span><\/p>\n<\/td>\n

\n

Demand<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

55<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

LAV<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

PHO<\/span><\/p>\n<\/td>\n

\n

60<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

LAV<\/span><\/p>\n<\/td>\n

\n

–<\/span>100<\/span><\/p>\n<\/td>\n

\n

–<\/span>100<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

7<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

45<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

LAV<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

REN<\/span><\/p>\n<\/td>\n

\n

120<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

PHO<\/span><\/p>\n<\/td>\n

\n

50<\/span><\/p>\n<\/td>\n

\n

50<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

8<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

PHO<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

LAX<\/span><\/p>\n<\/td>\n

\n

160<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

LAX<\/span><\/p>\n<\/td>\n

\n

30<\/span><\/p>\n<\/td>\n

\n

30<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

9<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

LAX<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

SAN<\/span><\/p>\n<\/td>\n

\n

70<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

REN<\/span><\/p>\n<\/td>\n

\n

45<\/span><\/p>\n<\/td>\n

\n

45<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

10<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

25<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

SAN<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

LAX<\/span><\/p>\n<\/td>\n

\n

90<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

SAN<\/span><\/p>\n<\/td>\n

\n

90<\/span><\/p>\n<\/td>\n

\n

90<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

11<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

SAN<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

REN<\/span><\/p>\n<\/td>\n

\n

70<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

DEN<\/span><\/p>\n<\/td>\n

\n

35<\/span><\/p>\n<\/td>\n

\n

35<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

12<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

SAN<\/span><\/p>\n<\/td>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

DEN<\/span><\/p>\n<\/td>\n

\n

90<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

7<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

–<\/span>150<\/span><\/p>\n<\/td>\n

\n

–<\/span>150<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

13<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

DEN<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

SAN<\/span><\/p>\n<\/td>\n

\n

50<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

14<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

7<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

REN<\/span><\/p>\n<\/td>\n

\n

190<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

15<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

115<\/span><\/p>\n<\/td>\n

\n

7<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

SAN<\/span><\/p>\n<\/td>\n

\n

90<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

16<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

35<\/span><\/p>\n<\/td>\n

\n

7<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

DEN<\/span><\/p>\n<\/td>\n

\n

100<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

17<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

18<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Total<\/span><\/p>\n<\/td>\n

\n

25600<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

SUMIF($C$6:$C$16,I6,$B$6:$B$16)<\/span>–<\/span>SUMIF($E$6:$E$16,I6,$B$6:$B$16)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

SUMIF($I$6:$I$12,B6,$B$6:$B$16)<\/span>–<\/span>SUMIF($I$6:$I$12,I6,$B$6:$B$16)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

SUMIF($E$6:$E$16,I6,$B$6:$B$16)<\/span>–<\/span>SUMIF($C$6:$C$16,I6,$B$6:$B$16)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

SUMPRODUCT(B6:B16,G6:G16)<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 27.\u00a0\u00a0 Which property of network flow models guarantees integer solutions?<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

linear constraints and balance of flow equation format<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

linear objective function coefficients<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

integer objective function coefficients<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

integer constraint RHS values and balance of flow equation format<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 28.\u00a0\u00a0 In generalized network flow problems<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

solutions may not be integer values.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

flows along arcs may increase or decrease.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

it can be difficult to tell if total supply is adequate to meet total demand.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

all of these.<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 29.\u00a0\u00a0 What happens to the solution of a network flow model if side constraints are added that do not obey the balance of flow rules?<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

The model solution is not guaranteed to be integer.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

The model solution will more accurately reflect reality.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

The model solution will be integer but more accurate.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

The model solution is not guaranteed to be feasible.<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 30.\u00a0\u00a0 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?<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

Place a limit of 34 on each in-flow arc.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

Add a side constraint limiting the out-flow arcs sum to 100.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

Separate the warehouse node into two nodes, connected by a single arc, with capacity of 100.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

It cannot be accomplished, a side constraint must be added.<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 31.\u00a0\u00a0 The equipment replacement problem is an example of which network problem?<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

transportation problem.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

shortest path problem.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

maximal flow problem.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

minimal spanning tree problem.<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 32.\u00a0\u00a0 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?<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

Force all the arc flow decision variables to be integer.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

Round off all the non-integer arc flow decision variables.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

Increase the supply until the solutions are all integer using a dummy supply node.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

Increase the demand until the solutions are all integer using a dummy demand node.<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 33.\u00a0\u00a0 A maximal flow problem differs from other network models in which way?<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

arcs are two directional<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

multiple supply nodes are used<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

arcs have limited capacity<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

arcs have unlimited capacity<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 34.\u00a0\u00a0 Maximal flow problems are converted to transshipment problems by<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

connecting the supply and demand nodes with a return arc<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

adding extra supply nodes<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

adding supply limits on the supply nodes<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

requiring integer solutions<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 35.\u00a0\u00a0 What is the objective function in the following maximal flow problem?<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\"\"<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

MIN X41<\/sub><\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

MAX X12<\/sub> + X13<\/sub><\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

MAX X14<\/sub><\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

MAX X41<\/sub><\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 36.\u00a0\u00a0 What is the constraint for node 2 in the following maximal flow problem?<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\"\"<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

X12<\/sub><\/span>–<\/span> X23<\/sub><\/span>–<\/span> X24<\/sub> = 0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

X12<\/sub> + X23<\/sub> + X24<\/sub> = 0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

X12<\/sub><\/span>\u00a3<\/span> 4<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

X12<\/sub> + X13<\/sub><\/span>–<\/span> X23<\/sub> = 0<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 37.\u00a0\u00a0 What is missing from transportation problems compared to transshipment problems?<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

arcs<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

demand nodes<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

transshipment nodes<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

supply nodes<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 38.\u00a0\u00a0 Which method is preferred for solving fully connected transportation problems?<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

linear programming<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

network flow methods<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

trial and error<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

simulation<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 39.\u00a0\u00a0 When might a network flow model for a transportation\/assignment problem be preferable to a matrix form for the problem?<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

When an integer solution is required.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

When the problem is large and not fully connected.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

When the problem is large and fully connected.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

When supply exceeds demand.<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 40.\u00a0\u00a0 Which method is preferred for solving minimal spanning tree problems?<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

linear programming<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

transshipment models<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

simulation<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

manual algorithms<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 41.\u00a0\u00a0 How many arcs are required to make a spanning tree in a network with n<\/em> nodes and m<\/em> arcs?<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 42.\u00a0\u00a0 The minimal spanning tree solution algorithm works by defining a subnetwork and<\/span><\/p>\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

adding the least expensive arc which connects any node in the current subnetwork to any node not in the current subnetwork.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

adding the most expensive arc which connects any node in the current subnetwork to any node not in the current subnetwork.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

adding the least expensive arc which connects unconnected nodes in the current subnetwork.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

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.<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PROBLEM<\/span><\/strong><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 43.\u00a0\u00a0 Draw the network representation of the following network flow problem.<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n\n
\n

MIN:<\/span><\/p>\n<\/td>\n

\n

5 X12<\/sub> + 3 X13<\/sub> + 2 X14<\/sub> + 3 X24<\/sub> + 2 X34<\/sub><\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Subject to:<\/span><\/p>\n<\/td>\n

\n

–<\/span>X12<\/sub><\/span>–<\/span> X13<\/sub><\/span>–<\/span> X14<\/sub> = <\/span>–<\/span>10<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

X12<\/sub><\/span>–<\/span> X24<\/sub> = 2<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

X13<\/sub><\/span>–<\/span> X34<\/sub> = 3<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

X14<\/sub> + X24<\/sub> + X34<\/sub> = 5<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Xij<\/sub><\/span>\u00b3<\/span> 0 for all i and j<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 44.\u00a0\u00a0 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:<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n
\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Age in years<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0-1<\/span><\/p>\n<\/td>\n

\n

1-2<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Operating Cost<\/span><\/p>\n<\/td>\n

\n

$15,000<\/span><\/p>\n<\/td>\n

\n

$16,500<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Trade-in Value<\/span><\/p>\n<\/td>\n

\n

$20,000<\/span><\/p>\n<\/td>\n

\n

$16,000<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

Draw the network representation of this problem.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 45.\u00a0\u00a0 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.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

Write out the LP formulation for this problem.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\"\"<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 46.\u00a0\u00a0 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:<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n
\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

To<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

From<\/span><\/p>\n<\/td>\n

\n

Lexington<\/span><\/p>\n<\/td>\n

\n

Washington<\/span><\/p>\n<\/td>\n

\n

Charlottesville<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Roanoke<\/span><\/p>\n<\/td>\n

\n

50<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

80<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Lexington<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

50<\/span><\/p>\n<\/td>\n

\n

40<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Charlottesville<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

30<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

Draw the network representation of this problem.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 47.\u00a0\u00a0 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.<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n\n
\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

To<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

From<\/span><\/p>\n<\/td>\n

\n

Portland<\/span><\/p>\n<\/td>\n

\n

Spokane<\/span><\/p>\n<\/td>\n

\n

Salt Lake City<\/span><\/p>\n<\/td>\n

\n

Denver<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Seattle<\/span><\/p>\n<\/td>\n

\n

100 (X12<\/sub>)<\/span><\/p>\n<\/td>\n

\n

500 (X13<\/sub>)<\/span><\/p>\n<\/td>\n

\n

600 (X14<\/sub>)<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Portland<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

350 (X23<\/sub>)<\/span><\/p>\n<\/td>\n

\n

300 (X24<\/sub>)<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Spokane<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

250 (X34<\/sub>)<\/span><\/p>\n<\/td>\n

\n

200 (X35<\/sub>)<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Salt Lake City<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

200 (X45<\/sub>)<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

Write out the LP formulation for this problem.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 48.\u00a0\u00a0 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:<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n\n
\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

To<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

From<\/span><\/p>\n<\/td>\n

\n

Portland<\/span><\/p>\n<\/td>\n

\n

Spokane<\/span><\/p>\n<\/td>\n

\n

Salt Lake City<\/span><\/p>\n<\/td>\n

\n

Denver<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Seattle<\/span><\/p>\n<\/td>\n

\n

100<\/span><\/p>\n<\/td>\n

\n

500<\/span><\/p>\n<\/td>\n

\n

600<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Portland<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

350<\/span><\/p>\n<\/td>\n

\n

300<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Spokane<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

250<\/span><\/p>\n<\/td>\n

\n

200<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Salt Lake City<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

200<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

What values should go into cells G6:L13 in the following Excel spreadsheet?<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

A<\/span><\/p>\n<\/td>\n

\n

B<\/span><\/p>\n<\/td>\n

\n

C<\/span><\/p>\n<\/td>\n

\n

D<\/span><\/p>\n<\/td>\n

\n

E<\/span><\/p>\n<\/td>\n

\n

F<\/span><\/p>\n<\/td>\n

\n

G<\/span><\/p>\n<\/td>\n

\n

H<\/span><\/p>\n<\/td>\n

\n

I<\/span><\/p>\n<\/td>\n

\n

J<\/span><\/p>\n<\/td>\n

\n

K<\/span><\/p>\n<\/td>\n

\n

L<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Supply\/<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Ship<\/span><\/p>\n<\/td>\n

\n

From<\/span><\/p>\n<\/td>\n

\n

To<\/span><\/p>\n<\/td>\n

\n

Unit Cost<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Nodes<\/span><\/p>\n<\/td>\n

\n

Net Flow<\/span><\/p>\n<\/td>\n

\n

Demand<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

SEA<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

POR<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

SEA<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

7<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

SEA<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

SPO<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

POR<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

8<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

SEA<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

SPO<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

9<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

POR<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

SPO<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

10<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

POR<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

DEN<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

11<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

SPO<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

12<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

SPO<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

DEN<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

13<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

DEN<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

14<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

15<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Total cost<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 49.\u00a0\u00a0 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:<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n\n
\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

To<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

From<\/span><\/p>\n<\/td>\n

\n

Portland<\/span><\/p>\n<\/td>\n

\n

Spokane<\/span><\/p>\n<\/td>\n

\n

Salt Lake City<\/span><\/p>\n<\/td>\n

\n

Denver<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Seattle<\/span><\/p>\n<\/td>\n

\n

100<\/span><\/p>\n<\/td>\n

\n

500<\/span><\/p>\n<\/td>\n

\n

600<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Portland<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

350<\/span><\/p>\n<\/td>\n

\n

300<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Spokane<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

250<\/span><\/p>\n<\/td>\n

\n

200<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Salt Lake City<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

–<\/span><\/p>\n<\/td>\n

\n

200<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

What values would you enter in the Risk Solver Platform (RSP) task pane for the following Excel spreadsheet?<\/span><\/p>\n

\u00a0<\/span><\/p>\n

Objective Cell:<\/span><\/p>\n

\u00a0<\/span><\/p>\n

Variables Cells:<\/span><\/p>\n

\u00a0<\/span><\/p>\n

Constraints Cells:<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

A<\/span><\/p>\n<\/td>\n

\n

B<\/span><\/p>\n<\/td>\n

\n

C<\/span><\/p>\n<\/td>\n

\n

D<\/span><\/p>\n<\/td>\n

\n

E<\/span><\/p>\n<\/td>\n

\n

F<\/span><\/p>\n<\/td>\n

\n

G<\/span><\/p>\n<\/td>\n

\n

H<\/span><\/p>\n<\/td>\n

\n

I<\/span><\/p>\n<\/td>\n

\n

J<\/span><\/p>\n<\/td>\n

\n

K<\/span><\/p>\n<\/td>\n

\n

L<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Supply\/<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Ship<\/span><\/p>\n<\/td>\n

\n

From<\/span><\/p>\n<\/td>\n

\n

To<\/span><\/p>\n<\/td>\n

\n

Unit Cost<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Nodes<\/span><\/p>\n<\/td>\n

\n

Net Flow<\/span><\/p>\n<\/td>\n

\n

Demand<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

SEA<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

POR<\/span><\/p>\n<\/td>\n

\n

100<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

SEA<\/span><\/p>\n<\/td>\n

\n

–<\/span>100<\/span><\/p>\n<\/td>\n

\n

–<\/span>100<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

7<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

SEA<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

SPO<\/span><\/p>\n<\/td>\n

\n

500<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

POR<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

8<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

SEA<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

600<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

SPO<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

9<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

POR<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

SPO<\/span><\/p>\n<\/td>\n

\n

350<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

10<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

POR<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

300<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

DEN<\/span><\/p>\n<\/td>\n

\n

100<\/span><\/p>\n<\/td>\n

\n

100<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

11<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

SPO<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

250<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

12<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

SPO<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

DEN<\/span><\/p>\n<\/td>\n

\n

200<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

13<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

DEN<\/span><\/p>\n<\/td>\n

\n

200<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

14<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

15<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Total cost<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 50.\u00a0\u00a0 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?<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

A<\/span><\/p>\n<\/td>\n

\n

B<\/span><\/p>\n<\/td>\n

\n

C<\/span><\/p>\n<\/td>\n

\n

D<\/span><\/p>\n<\/td>\n

\n

E<\/span><\/p>\n<\/td>\n

\n

F<\/span><\/p>\n<\/td>\n

\n

G<\/span><\/p>\n<\/td>\n

\n

H<\/span><\/p>\n<\/td>\n

\n

I<\/span><\/p>\n<\/td>\n

\n

J<\/span><\/p>\n<\/td>\n

\n

K<\/span><\/p>\n<\/td>\n

\n

L<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Select<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Driving<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Supply\/<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Route<\/span><\/p>\n<\/td>\n

\n

From<\/span><\/p>\n<\/td>\n

\n

To<\/span><\/p>\n<\/td>\n

\n

Time<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Nodes<\/span><\/p>\n<\/td>\n

\n

Net Flow<\/span><\/p>\n<\/td>\n

\n

Demand<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

SEA<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

POR<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

SEA<\/span><\/p>\n<\/td>\n

\n

–<\/span>1<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

7<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

SEA<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

SPO<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

POR<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

8<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

SEA<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

12<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

SPO<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

9<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

SEA<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

DEN<\/span><\/p>\n<\/td>\n

\n

18<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

10<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

POR<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

SPO<\/span><\/p>\n<\/td>\n

\n

9<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

DEN<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

11<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

POR<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

12<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

12<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

POR<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

DEN<\/span><\/p>\n<\/td>\n

\n

16<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

13<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

SPO<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

10<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

14<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

SPO<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

DEN<\/span><\/p>\n<\/td>\n

\n

15<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

15<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

SLC<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

DEN<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

16<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

17<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Total Driving Time<\/span><\/p>\n<\/td>\n

\n

17<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 51.\u00a0\u00a0 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.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\"\"<\/span><\/p>\n

\u00a0<\/span><\/p>\n

Write out the LP formulation for this problem.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 52.\u00a0\u00a0 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?<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

A<\/span><\/p>\n<\/td>\n

\n

B<\/span><\/p>\n<\/td>\n

\n

C<\/span><\/p>\n<\/td>\n

\n

D<\/span><\/p>\n<\/td>\n

\n

E<\/span><\/p>\n<\/td>\n

\n

F<\/span><\/p>\n<\/td>\n

\n

G<\/span><\/p>\n<\/td>\n

\n

H<\/span><\/p>\n<\/td>\n

\n

I<\/span><\/p>\n<\/td>\n

\n

J<\/span><\/p>\n<\/td>\n

\n

K<\/span><\/p>\n<\/td>\n

\n

L<\/span><\/p>\n<\/td>\n

\n

M<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

7<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

8<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

9<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

10<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

11<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

12<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

13<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

14<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

15<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

16<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

17<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Total cost<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 53.\u00a0\u00a0 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.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

What values would you enter in the Risk Solver Platform (RSP) task pane for the following Excel spreadsheet?<\/span><\/p>\n

\u00a0<\/span><\/p>\n

Objective Cell:<\/span><\/p>\n

\u00a0<\/span><\/p>\n

Variables Cells:<\/span><\/p>\n

\u00a0<\/span><\/p>\n

Constraints Cells:<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

A<\/span><\/p>\n<\/td>\n

\n

B<\/span><\/p>\n<\/td>\n

\n

C<\/span><\/p>\n<\/td>\n

\n

D<\/span><\/p>\n<\/td>\n

\n

E<\/span><\/p>\n<\/td>\n

\n

F<\/span><\/p>\n<\/td>\n

\n

G<\/span><\/p>\n<\/td>\n

\n

H<\/span><\/p>\n<\/td>\n

\n

I<\/span><\/p>\n<\/td>\n

\n

J<\/span><\/p>\n<\/td>\n

\n

K<\/span><\/p>\n<\/td>\n

\n

L<\/span><\/p>\n<\/td>\n

\n

M<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Unit<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Net<\/span><\/p>\n<\/td>\n

\n

Supply\/<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

Flow from Node<\/span><\/p>\n<\/td>\n

\n

Yield<\/span><\/p>\n<\/td>\n

\n

Flow into Node<\/span><\/p>\n<\/td>\n

\n

Cost<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Nodes<\/span><\/p>\n<\/td>\n

\n

Flow<\/span><\/p>\n<\/td>\n

\n

Demand<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

Crude A<\/span><\/p>\n<\/td>\n

\n

0.90<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

Refinery 1<\/span><\/p>\n<\/td>\n

\n

15<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

Crude A<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

–<\/span>120<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

7<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

Crude A<\/span><\/p>\n<\/td>\n

\n

0.85<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

Refinery 2<\/span><\/p>\n<\/td>\n

\n

13<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

Crude B<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

–<\/span>60<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

8<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

Crude B<\/span><\/p>\n<\/td>\n

\n

0.80<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

Refinery 1<\/span><\/p>\n<\/td>\n

\n

9<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

Refinery 1<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

9<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

Crude B<\/span><\/p>\n<\/td>\n

\n

0.85<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

Refinery 2<\/span><\/p>\n<\/td>\n

\n

11<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

Refinery 2<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

10<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

Refinery 1<\/span><\/p>\n<\/td>\n

\n

0.95<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

Lube Oil<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

Lube Oil<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

75<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

11<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

Refinery 1<\/span><\/p>\n<\/td>\n

\n

0.90<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

Gasoline<\/span><\/p>\n<\/td>\n

\n

7<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

Gasoline<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

50<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

12<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

Refinery 1<\/span><\/p>\n<\/td>\n

\n

0.90<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

7<\/span><\/p>\n<\/td>\n

\n

Diesel<\/span><\/p>\n<\/td>\n

\n

8<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

7<\/span><\/p>\n<\/td>\n

\n

Diesel<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

25<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

13<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

Refinery 2<\/span><\/p>\n<\/td>\n

\n

0.90<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

Lube Oil<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

14<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

Refinery 2<\/span><\/p>\n<\/td>\n

\n

0.95<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

Gasoline<\/span><\/p>\n<\/td>\n

\n

9<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

15<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

Refinery 2<\/span><\/p>\n<\/td>\n

\n

0.95<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

7<\/span><\/p>\n<\/td>\n

\n

Diesel<\/span><\/p>\n<\/td>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

16<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

17<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Total cost<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 54.\u00a0\u00a0 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:<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n
\n

Distance<\/span><\/p>\n<\/td>\n

\n

Center 1<\/span><\/p>\n<\/td>\n

\n

Center 2<\/span><\/p>\n<\/td>\n

\n

Center 3<\/span><\/p>\n<\/td>\n

\n

Center 4<\/span><\/p>\n<\/td>\n

\n

Supply<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Plant A<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>45<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>60<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>53<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>75<\/span><\/p>\n<\/td>\n

\n

500<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Plant B<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>81<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>27<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>49<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>62<\/span><\/p>\n<\/td>\n

\n

700<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Plant C<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>55<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>40<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>35<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>60<\/span><\/p>\n<\/td>\n

\n

650<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Demand<\/span><\/p>\n<\/td>\n

\n

350<\/span><\/p>\n<\/td>\n

\n

325<\/span><\/p>\n<\/td>\n

\n

400<\/span><\/p>\n<\/td>\n

\n

375<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

Draw the transportation network for Clifton’s distribution problem.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 55.\u00a0\u00a0 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.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\"\"<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 56.\u00a0\u00a0 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:<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n
\n

Distance<\/span><\/p>\n<\/td>\n

\n

Center 1<\/span><\/p>\n<\/td>\n

\n

Center 2<\/span><\/p>\n<\/td>\n

\n

Center 3<\/span><\/p>\n<\/td>\n

\n

Center 4<\/span><\/p>\n<\/td>\n

\n

Supply<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Plant A<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>45<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>60<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>53<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>75<\/span><\/p>\n<\/td>\n

\n

500<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Plant B<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>81<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>27<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>49<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>62<\/span><\/p>\n<\/td>\n

\n

700<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Plant C<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>55<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>40<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>35<\/span><\/p>\n<\/td>\n

\n

\u00a0 <\/span>60<\/span><\/p>\n<\/td>\n

\n

650<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Demand<\/span><\/p>\n<\/td>\n

\n

350<\/span><\/p>\n<\/td>\n

\n

325<\/span><\/p>\n<\/td>\n

\n

400<\/span><\/p>\n<\/td>\n

\n

375<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

Draw the balanced transportation network for Clifton’s distribution problem.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

ANS:\u00a0 <\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 57.\u00a0\u00a0 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.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\"\"<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 58.\u00a0\u00a0 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:<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n\n
\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Plane 1<\/span><\/p>\n<\/td>\n

\n

Plane 2<\/span><\/p>\n<\/td>\n

\n

Plane 3<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Repair Person 1<\/span><\/p>\n<\/td>\n

\n

11<\/span><\/p>\n<\/td>\n

\n

\u00a0 9<\/span><\/p>\n<\/td>\n

\n

21<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Repair Person 2<\/span><\/p>\n<\/td>\n

\n

17<\/span><\/p>\n<\/td>\n

\n

\u00a0 7<\/span><\/p>\n<\/td>\n

\n

13<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Repair Person 3<\/span><\/p>\n<\/td>\n

\n

\u00a0 9<\/span><\/p>\n<\/td>\n

\n

12<\/span><\/p>\n<\/td>\n

\n

17<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Repair Person 4<\/span><\/p>\n<\/td>\n

\n

14<\/span><\/p>\n<\/td>\n

\n

\u00a0 8<\/span><\/p>\n<\/td>\n

\n

28<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Repair Person 5<\/span><\/p>\n<\/td>\n

\n

12<\/span><\/p>\n<\/td>\n

\n

\u00a0 5<\/span><\/p>\n<\/td>\n

\n

12<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

Draw the network flow for this assignment problem assuming Joe would like to maximize the total preference in his worker-to-aircraft schedule.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

ANS:\u00a0 <\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 59.\u00a0\u00a0 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.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\"\"<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 60.\u00a0\u00a0 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:<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n\n
\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Plane 1<\/span><\/p>\n<\/td>\n

\n

Plane 2<\/span><\/p>\n<\/td>\n

\n

Plane 3<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Repair Person 1<\/span><\/p>\n<\/td>\n

\n

11<\/span><\/p>\n<\/td>\n

\n

\u00a0 9<\/span><\/p>\n<\/td>\n

\n

21<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Repair Person 2<\/span><\/p>\n<\/td>\n

\n

17<\/span><\/p>\n<\/td>\n

\n

\u00a0 7<\/span><\/p>\n<\/td>\n

\n

13<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Repair Person 3<\/span><\/p>\n<\/td>\n

\n

\u00a0 9<\/span><\/p>\n<\/td>\n

\n

12<\/span><\/p>\n<\/td>\n

\n

17<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Repair Person 4<\/span><\/p>\n<\/td>\n

\n

14<\/span><\/p>\n<\/td>\n

\n

\u00a0 8<\/span><\/p>\n<\/td>\n

\n

28<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Repair Person 5<\/span><\/p>\n<\/td>\n

\n

12<\/span><\/p>\n<\/td>\n

\n

\u00a0 5<\/span><\/p>\n<\/td>\n

\n

12<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

Draw the balanced network flow for this assignment problem assuming Joe would like to maximize the total preference in his worker-to-aircraft schedule.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

ANS:\u00a0 <\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 61.\u00a0\u00a0 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.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\"\"<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 62.\u00a0\u00a0 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.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 63.\u00a0\u00a0 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.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\"\"<\/span><\/p>\n

\u00a0<\/span><\/p>\n

Write out the LP formulation for this problem.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 64.\u00a0\u00a0 A company wants to manage its distribution network which is depicted below. Identify the supply, demand and transshipment nodes in this problem.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\"\"<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 65.\u00a0\u00a0 Draw the network and indicate how many units are flowing along each arc based on the following Risk Solver Platform (RSP) solution.<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\n

Units<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Unit<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Net<\/span><\/p>\n<\/td>\n

\n

Supply\/<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

of Flow<\/span><\/p>\n<\/td>\n

\n

From<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

To<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Cost<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Nodes<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Flow<\/span><\/p>\n<\/td>\n

\n

Demand<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

A<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

B<\/span><\/p>\n<\/td>\n

\n

20<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

A<\/span><\/p>\n<\/td>\n

\n

–<\/span>40<\/span><\/p>\n<\/td>\n

\n

–<\/span>40<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

35<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

A<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

C<\/span><\/p>\n<\/td>\n

\n

15<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

B<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

B<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

D<\/span><\/p>\n<\/td>\n

\n

30<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

C<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

25<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

C<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

D<\/span><\/p>\n<\/td>\n

\n

10<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

D<\/span><\/p>\n<\/td>\n

\n

10<\/span><\/p>\n<\/td>\n

\n

10<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

C<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

E<\/span><\/p>\n<\/td>\n

\n

25<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

E<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

15<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

D<\/span><\/p>\n<\/td>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

F<\/span><\/p>\n<\/td>\n

\n

10<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

F<\/span><\/p>\n<\/td>\n

\n

15<\/span><\/p>\n<\/td>\n

\n

15<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

E<\/span><\/p>\n<\/td>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

F<\/span><\/p>\n<\/td>\n

\n

30<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Total<\/span><\/p>\n<\/td>\n

\n

1150<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

ANS:\u00a0 <\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 66.\u00a0\u00a0 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.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\"\"<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 67.\u00a0\u00a0 Draw the network and solution for the maximal flow problem represented by the following Excel spreadsheet.<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\n

Units<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Upper<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Net<\/span><\/p>\n<\/td>\n

\n

Supply\/<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

of Flow<\/span><\/p>\n<\/td>\n

\n

From<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

To<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Bound<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Nodes<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Flow<\/span><\/p>\n<\/td>\n

\n

Demand<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

A<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

B<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

A<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

8<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

A<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

C<\/span><\/p>\n<\/td>\n

\n

8<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

B<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

B<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

D<\/span><\/p>\n<\/td>\n

\n

6<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

C<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

B<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

E<\/span><\/p>\n<\/td>\n

\n

2<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

D<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

C<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

D<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

E<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n

\n

0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

3<\/span><\/p>\n<\/td>\n

\n

C<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

E<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

8<\/span><\/p>\n<\/td>\n

\n

4<\/span><\/p>\n<\/td>\n

\n

D<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

E<\/span><\/p>\n<\/td>\n

\n

9<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

12<\/span><\/p>\n<\/td>\n

\n

5<\/span><\/p>\n<\/td>\n

\n

E<\/span><\/p>\n<\/td>\n

\n

1<\/span><\/p>\n<\/td>\n

\n

A<\/span><\/p>\n<\/td>\n

\n

999<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

12<\/span><\/p>\n<\/td>\n

\n

Maximal flow<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

ANS:\u00a0 <\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 68.\u00a0\u00a0 Draw the network representation of this LP model. What type of problem is it?<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n
\n

MAX<\/span><\/p>\n<\/td>\n

\n

X41<\/sub><\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Subject to:<\/span><\/p>\n<\/td>\n

\n

X41<\/sub><\/span>–<\/span> X12<\/sub><\/span>–<\/span> X13<\/sub> = 0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

X12<\/sub><\/span>–<\/span> X24<\/sub> = 0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

X13<\/sub><\/span>–<\/span> X34<\/sub> = 0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

X24<\/sub> + X34<\/sub><\/span>–<\/span> X41<\/sub> = 0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0 <\/span>\u00a3<\/span> X12<\/sub><\/span>\u00a3<\/span> 5,<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0 <\/span>\u00a3<\/span> X13<\/sub><\/span>\u00a3<\/span> 4,<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0 <\/span>\u00a3<\/span> X24<\/sub><\/span>\u00a3<\/span> 3,<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0 <\/span>\u00a3<\/span> X34<\/sub><\/span>\u00a3<\/span> 2,<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

0 <\/span>\u00a3<\/span> X41<\/sub><\/span>\u00a3<\/span>\u00a5<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 69.\u00a0\u00a0 Solve the following minimal spanning tree problem starting at node 1.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\"\"<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 70.\u00a0\u00a0 Solve the following minimal spanning tree problem starting at node 1.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\"\"<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 71.\u00a0\u00a0 Solve the following minimal spanning tree problem starting at node 1.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\"\"<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PROJECT<\/span><\/strong><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 72.\u00a0\u00a0 Project 5.1 <\/strong><\/span>–<\/span><\/strong> Recruit Training<\/span><\/strong><\/p>\n

\u00a0<\/span><\/p>\n

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.<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n\n\n
\n

Course<\/span><\/p>\n<\/td>\n

\n

Cost Per Student<\/span><\/p>\n<\/td>\n

\n

Min. Num. of Trainees<\/span><\/p>\n<\/td>\n

\n

Max. Num. of Trainees<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

A<\/span><\/p>\n<\/td>\n

\n

25<\/span><\/p>\n<\/td>\n

\n

15<\/span><\/p>\n<\/td>\n

\n

40<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

B<\/span><\/p>\n<\/td>\n

\n

55<\/span><\/p>\n<\/td>\n

\n

10<\/span><\/p>\n<\/td>\n

\n

50<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

C<\/span><\/p>\n<\/td>\n

\n

30<\/span><\/p>\n<\/td>\n

\n

15<\/span><\/p>\n<\/td>\n

\n

50<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

D<\/span><\/p>\n<\/td>\n

\n

10<\/span><\/p>\n<\/td>\n

\n

15<\/span><\/p>\n<\/td>\n

\n

50<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

E<\/span><\/p>\n<\/td>\n

\n

20<\/span><\/p>\n<\/td>\n

\n

10<\/span><\/p>\n<\/td>\n

\n

50<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

F<\/span><\/p>\n<\/td>\n

\n

15<\/span><\/p>\n<\/td>\n

\n

10<\/span><\/p>\n<\/td>\n

\n

50<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

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.<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

Draw<\/span><\/strong> a network flow diagram describing the problem.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

Formulate<\/span><\/strong> the associated network flow linear program.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

Implement<\/span><\/strong> a spreadsheet model and use Risk Solver Platform (RSP) to obtain a solution to the problem. Use your model to answer the following questions.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

What is the expected student load for each course?<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Should any course be expanded?<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Should any course or sequence be considered for elimination?<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

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.<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n
\n

d.<\/span><\/p>\n<\/td>\n

\n

Re-draw<\/span><\/strong> the network flow diagram describing the problem to accommodate the above changes.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

e.<\/span><\/p>\n<\/td>\n

\n

Formulate<\/span><\/strong> the associated generalized network flow linear program.<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

f.<\/span><\/p>\n<\/td>\n

\n

Implement<\/span><\/strong> 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?<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

PTS:\u00a0\u00a0 1<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0\u00a0 73.\u00a0\u00a0 Project 5.2 <\/strong><\/span>–<\/span><\/strong> Small Production Planning Project<\/span><\/strong><\/p>\n

\u00a0<\/span><\/p>\n

(Fixed Charge Problem via Network Flow with Side Constraints)<\/span><\/p>\n

\u00a0<\/span><\/p>\n

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 Pittsburg for distribution to the south and northeast.<\/span><\/p>\n

\u00a0<\/span><\/p>\n

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.<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n
\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

Production Cost<\/span><\/p>\n

per Clock<\/span><\/p>\n<\/td>\n

\n

Clocks Produced<\/span><\/p>\n

per Hour<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n

Available<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n

Plant<\/span><\/p>\n<\/td>\n

\n

Fixed Cost for<\/span><\/p>\n

Line<\/span><\/p>\n<\/td>\n

\n

Southwest<\/span><\/p>\n

Clock<\/span><\/p>\n<\/td>\n

\n

Northeast<\/span><\/p>\n

Clock<\/span><\/p>\n<\/td>\n

\n

Southwest<\/span><\/p>\n

Clock<\/span><\/p>\n<\/td>\n

\n

Northwest<\/span><\/p>\n

Clock<\/span><\/p>\n<\/td>\n

\n

Hours per<\/span><\/p>\n

Month<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Toledo<\/span><\/p>\n<\/td>\n

\n

$20,000<\/span><\/p>\n<\/td>\n

\n

$10<\/span><\/p>\n<\/td>\n

\n

$12<\/span><\/p>\n<\/td>\n

\n

5\u00a0\u00a0 <\/span><\/p>\n<\/td>\n

\n

6\u00a0\u00a0 <\/span><\/p>\n<\/td>\n

\n

500<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Centerville<\/span><\/p>\n<\/td>\n

\n

$24,000<\/span><\/p>\n<\/td>\n

\n

$\u00a0 9<\/span><\/p>\n<\/td>\n

\n

$13<\/span><\/p>\n<\/td>\n

\n

5.5<\/span><\/p>\n<\/td>\n

\n

6.2<\/span><\/p>\n<\/td>\n

\n

675<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

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 Pittsburg distribution center. Assume all these units are sold. The per clock transportation costs from plant to distribution center is given in the following table.<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n
\n

(cost per clock shipped)<\/span><\/p>\n<\/td>\n

\n

Cost to Ship to Distribution Center<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Plant<\/span><\/p>\n<\/td>\n

\n

St Louis<\/span><\/p>\n<\/td>\n

\n

Pittsburg<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Toledo<\/span><\/p>\n<\/td>\n

\n

$2<\/span><\/p>\n<\/td>\n

\n

$4<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

Centerville<\/span><\/p>\n<\/td>\n

\n

$3<\/span><\/p>\n<\/td>\n

\n

$2<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

Develop a generalized network flow model for this problem and implement this model in solver. Use the model to answer the following questions.<\/span><\/p>\n

\u00a0<\/span><\/p>\n\n\n\n\n\n\n\n\n\n
\n

a.<\/span><\/p>\n<\/td>\n

\n

Should any of the production lines be shut down?<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

b.<\/span><\/p>\n<\/td>\n

\n

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?<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

c.<\/span><\/p>\n<\/td>\n

\n

What is the expected monthly profit?<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n

\n

\u00a0<\/span><\/p>\n<\/td>\n<\/tr>\n

\n

d.<\/span><\/p>\n<\/td>\n

\n

If a plant is closed, what are the estimated monthly savings?<\/span><\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/span><\/p>\n

\u00a0<\/p>\n

\u00a0<\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

\u00a0 MULTIPLE CHOICE \u00a0 \u00a0\u00a0\u00a0\u00a0 1.\u00a0\u00a0 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. \u00a0 \u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 PTS:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 1 \u00a0 \u00a0\u00a0\u00a0\u00a0 2.\u00a0\u00a0 The arcs in a network indicate all of the following except? a. routes […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[16],"tags":[],"class_list":["post-23239","post","type-post","status-publish","format-standard","hentry","category-education"],"_links":{"self":[{"href":"https:\/\/assignmenttutors.net\/blog\/wp-json\/wp\/v2\/posts\/23239","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/assignmenttutors.net\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/assignmenttutors.net\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/assignmenttutors.net\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/assignmenttutors.net\/blog\/wp-json\/wp\/v2\/comments?post=23239"}],"version-history":[{"count":0,"href":"https:\/\/assignmenttutors.net\/blog\/wp-json\/wp\/v2\/posts\/23239\/revisions"}],"wp:attachment":[{"href":"https:\/\/assignmenttutors.net\/blog\/wp-json\/wp\/v2\/media?parent=23239"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/assignmenttutors.net\/blog\/wp-json\/wp\/v2\/categories?post=23239"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/assignmenttutors.net\/blog\/wp-json\/wp\/v2\/tags?post=23239"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}