[go: up one dir, main page]
Scribd
Upload
32 views2 pages

Orlin NF Chapter1

This document contains examples of constructing graphs to model and solve different optimization problems using network flows. It provides examples for modeling shortest path problems, assignment problems, job shop scheduling problems, maximum matching problems, and vehicle allocation problems as network flow problems on constructed graphs. The examples show how to define the nodes and arcs of graphs and set their costs and capacities to properly model the given problems.

Uploaded by

Abdulganiyu Ismaeel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
32 views2 pages

Orlin NF Chapter1

This document contains examples of constructing graphs to model and solve different optimization problems using network flows. It provides examples for modeling shortest path problems, assignment problems, job shop scheduling problems, maximum matching problems, and vehicle allocation problems as network flow problems on constructed graphs. The examples show how to define the nodes and arcs of graphs and set their costs and capacities to properly model the given problems.

Uploaded by

Abdulganiyu Ismaeel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CHAPTER 1

E X E R C I S E 1 . 1 . (1) Let G = (N, A) be the graph in which the shortest path problem needs to be solved.
Construct a graph G' = (N, A ∪ A1 ) such that A 1 consists of directed arcs from each node in N - {s} to the source
node s and has both lower and upper bounds equal to unity (see Figure S1.1(a)). We set the cost of every arc in A
equal to one and the cost of every arc in A1 to zero. In the optimal minimum cost circulation of G' , the arcs in A
with nonzero flow will define the shortest paths in G.

(2) Let G = (N1 ∪ N2 , A) be the graph in which the assignment problem needs to be solved. Construct the graph
G' = (N 1 ∪ N2 ∪ {p}, A ∪ A1 ) where p is a dummy node and A1 is defined as A1 = {(i, p) : i ∈ N2 } ∪ {(p, j) : j
∈ N1 }. For illustration, see Figure S1.1(b). The lower and upper bounds on the capacity of each arc in A1 is 1.
The lower bound on every arc in A is zero and its upper bound is 1. The cost of every arc in A 1 is zero.
N1 N2

2
4
1

3 5

p (dummy node)

Figure S1.1 (b)


(a)
(3) The construction is exactly similar to that in part (2) except that we set the upper and lower bounds on the
capacity of every arc (p, i) and (i, p) in A1 to |b(i)|. Further, the capacities and the costs of arcs in the transformed
problem are the same as those in the original problem.

EXERCISE 1.3. The solution to this exercise is exactly similar to that described in Application 1.2, except that
we define the arc cost cij as:

cij = Kj + c j ∑
j
D /  LL .
k
j
k
k=i+1

Note that this solution is based on the assumption that the solution must be contiguous, i.e., if length Li is cut
from a beam of length L j for i < j, then lengths Li+1 , L i+2 , ...., L j-1 must also be cut from the beam of length Lj .

EXERCISE 1.5. Construct the bipartite graph G = (NM ∪ NW, A) in which nodes in N M correspond to men,
nodes in NW correspond to women, and an arc (i, j) exists in A if and only if the man corresponding to node i is
Network Flows 1.2 Ahuja/Magnanti/Orlin

compatible with the woman corresponding to node j. Solve a maximum cardinality matching problem in the graph
G. The arcs in the matching correspond to the couples in the actual matching.

EXERCISE 1.7. Construct a graph having n+1 nodes, numbered 1 through (n+1). For every pair of nodes [i,
j], introduce the arc (i, j) if and only if i < j; let the cost of this arc be -cij . Find a shortest path from node 1 to n+1.
The node numbers lying on the shortest path will denote the word numbers where new lines should begin.

EXERCISE 1.9. Construct the graph G = (NS ∪ NP ∪{p}, A), where every node in NS corresponds to a shift,
every node in NP corresponds to a precinct, p is dummy node and A is defined as A = NS x NP ∪ {(p, i) : i ∈ NS }
∪ {(j, p) : j ∈ NP}. Let the lower and upper bounds on the capacities of the arcs in NS x N P correspond to the
minimum and maximum requirement of cars for a particular shift-precinct combination. Further, the lower bound of
each arc (j, p) correspond to the minimum number of cars required in the precinct corresponding to node j, and the
lower bound of each arc (p, i) corresponds to the minimum number of cars required in the shift corresponding to node
i. The cost of every arc emanating from node p is unity. (Hence the cost of the circulation will be equal to the
number of cars committed to the field). All other arc costs are zero. Figure S1.9 illustrates this formulation.

[lij, uij]
i j

Shifts Precincts [10,


1 [2,[33] 1' ∞]
,5
]
[5
,8
]

]
,7
[4 [14,
2 [6, 7]
[7, 2'
12
]
]
,5 ]
[3 5, 10
[ [13, ∞]
[6, 10] 3'
3

[18,∞]
[20, ∞] p

[10, Figure S1.9

You might also like