Group 6

Optimization 2
(for FERMers)

Prof. DrSc. Nguyen Dinh

International University
 Net work flow problems
vUse the algorithm for maximum flow
problems to solve the next 2
exercises 9.3-3 and 9.5-1.

www.themegallery.com
it may (a) Formulate this problem as a shortest-path problem.
years. (b)Chapter 1: Net
Use the algorithm work
described flow
in Sec. 9.3problems
to solve this shortest-
ciated path problem.
wance, C (c) Formulate and solve a spreadsheet model for this problem.
d trad-
9.3-3.* Use the algorithm described in Sec. 9.3 to find the short-
est path through each of the following networks, where the num-
bers represent actual distances between the corresponding nodes.
(a)
(a)
A
3 7
4
1 D
31,000 5 6
21,000 6
12,000 (Origin) O B 1 T (Destination)
4
8
2 E
should 5
years. 5
C
 453

be 9.5-1.* For networks (a) and (b), use the augmenting path algo-
ery rithm described in Sec. 9.5 to find the flow pattern giving the max-
ni- imum flow from the source to the sink, given that the arc capacity
from node i to node j is the number nearest node i along the arc
the between these nodes.

m.

4
www.themegallery.com
directly connected by special phone lines in order to connect every rithm described in Sec. 9.5 to find the flow pattern giving the max-
branch office (directly or indirectly) to the main office at a mini- imum flow from the source to the sink, given that the arc capacity
mum total cost. from node i to node j is the number nearest node i along the arc
(a) Describe how this problem fits the network description of the between these nodes.
minimum spanning tree problem.
(b) Use the algorithm described in Sec. 9.4 to solve the problem.

(a)
(a) 2 4

5 4
6 1
F 1 3 7 F
Source 4 Sink
1 3 3
6 9

4 4

(b) (b)
4
4
7
3
2 7 7
8 2 5
1 3 8
F 5 9 F
Source Sink
9 4 3
3 6 7
8
3

6 2

A www.themegallery.com
vUse the network simplex method to
solve the following problem.

www.themegallery.com
 the feasible spanning
! F, B ! D, and E ! Formulate the network representation of this problem as a mini-
! C and F ! D) are mum cost flow problem. Use the northwest corner rule to obtain
an initial BF solution. Then use the network simplex method your-
ourself (without an au- self (without an automatic computer routine) to solve the problem.
his problem. D,I 9.7-8. Consider the minimum cost flow problem shown below,
problem formulated in where the bi values are given by the nodes, the cij values are given
by the arcs, and the finite uij values are given in parentheses by the
the feasible spanning arcs. Obtain an initial BF solution by solving the feasible spanning
wo rail lines plus fac- tree with basic arcs A ! C, B ! A, C ! D, and C ! E, where
distribution center. one of the nonbasic arcs (D ! A) is a reverse arc. Then use the
ourself (without an au- network simplex method yourself (without an automatic computer
his problem. routine) to solve this problem.

w problem formulated [50] ["70]

F solution that corre- 6 (uAD ! 40)
A D
use the network sim-
c computer routine) to
4 [0] 3
on problem given in 1 C
on as a minimum cost
northwest corner rule 2 5
8.2. Then use the net-
n automatic computer B E
the optimal solution 5 (uBE ! 40)
[80] ["60]

www.themegallery.com
 (b) Find three directed cycles. Then identify an undirected cycle C (
that includes every node. (d)
(c) Identify a set of arcs that forms a spanning tree.

Review problems
(d) Use the process illustrated in Fig. 9.3 to grow a tree one arc
at a time until a spanning tree has been formed. Then repeat (e)
this process to obtain another spanning tree. [Do not duplicate
ocumentation of thetree
the spanning software.
identified in part (c).]
9.3-1. You need to take a trip by car to another town that you 9.3
have never visited before. Therefore, you are studying a map to pur
determine the shortest route to your destination. Depending on to a
which route you choose, there are five other towns (call them A, be
B, C, D, E) that you might pass through on the way. The map How
) shows the mileage along each road that directly connects two
towns without any intervening towns. These numbers are sum-
marized in the following table, where a dash indicates that there
is no road directly connecting these two towns without going
e through any other towns.

o
m. Miles between Adjacent Towns
al Town A B C D E Destination

Origin 40 60 50 — — —
A 10 — 70 — —
B 20 55 40 —
C — 50 —
D 10 60
E 80

www.themegallery.com
 C — 50 —
D 10 60
E 80

(a) Formulate this problem as a shortest-path problem by drawing

a network where nodes represent towns, links represent roads,
and numbers indicate the length of each link in miles.
tify (b) Use the algorithm described in Sec. 9.3 to solve this shortest-
path problem.
cle C (c) Formulate and solve a spreadsheet model for this problem.
(d) If each number in the table represented your cost (in dollars)
for driving your car from one town to the next, would the an-
arc swer in part (b) or (c) now give your minimum cost route?
eat (e) If each number in the table represented your time (in minutes)
ate for driving your car from one town to the next, would the an-
swer in part (b) or (c) now give your minimum time route?

you 9.3-2. At a small but growing airport, the local airline company is
p to purchasing a new tractor for a tractor-trailer train www.themegallery.com
to bring luggage
vNote: Do not try to answer question
c) in the previous problem 9.3-1.

www.themegallery.com
 D,I (b) Use the network simplex method yourself (without an au-
inserting all th
tomatic computer routine) to solve this problem. D,I 9.7-8. Conside
C (c) Formulate a
(a) Formulate
9.7-3. the network
Reconsider representation
the minimum cost flowofproblem
this problem in where
as a min-
formulated C (d) the values
Usebithe com
imum
Prob. cost
9.6-2. flow problem. by the arcs, and the
v Solving the next exercises, using the max flow
(b) Formulate the linear programming model for this problem. 9.6-5.Obtain
arcs. The anAudio
init
(a) Obtain an initial BF solution by solving the feasible spanning
algorithm.
management
tree with basic has
arcd
tree that corresponds to using just the two rail lines plus fac-
9.6-3. Reconsider Prob. 9.3-1. Now formulate this problem as a one speakers
of theneeded
nonbasif
tory 1 shipping to warehouse 2 via the distribution center.
minimum cost flow problem by showing the appropriate network network to supply the spe
simplex m
D,I (b) Use the network simplex method yourself (without an au-
representation. speakerstoissolve
routine) shownth
tomatic computer routine) to solve this problem.

D,I 9.7-4. Reconsider the minimum cost flow problem formulated [50]
in Prob. 9.6-3. Starting with the initial BF solution that corre- 6
A
sponds to replacing the tractor every year, use the network sim-
plex method yourself (without an automatic computer routine) to
solve this problem. 4

D,I 9.7-5. For the P & T Co. transportation problem given in 1

Table 8.2, consider its network representation as a minimum cost
flow problem presented in Fig. 8.2. Use the northwest corner rule 2
to obtain an initial BF solution from Table 8.2. Then use www.themegallery.com
the net-
Group 6