OR

Session-8,9,10
Problem-8(part-a)
Problem-8(part-b)
Example problem-9
Example problem-10
Additional theories
Slack
Complementary slackness theorem
“In the optimal solution table of an LP problem, if the slack variable is zero, then
the corresponding shadow price(dual) exists”.
 B

A D

Can you construct a round trip to visit all four sections of the city crossing each bridge
exactly once? A section could be visited multiple times if necessary

 Prussian city of Konigsberg

 Founded in 1254 on the bank of river Pergel
 Solution

Impossible to enter and exit all sections using distinct bridges as

the number of incident into each node is odd. Hence no desired
solution
Social network
Supply chain network
Network
Optimization Models
Network problem types
▪ Minimum spanning tree problem
▪ Shortest Path Problem
▪ The maximum flow problem
▪ The minimum cost flow problem
▪ Special cases
 The transportation problem
 The assignment problem
 The transhipment problem
The Terminology of Networks
▪ Network consists of a set of points and a set of lines connecting
points
▪ Node: point (vertex) in the network
▪ Lines: links, arcs, edges, or branches
– Labeled by naming the node at each end
▪ From node precedes the to node
– Have a flow of some type through them
▪ Directed arcs have unidirectional flow
▪ Undirected arcs (links) allow bidirectional flow

16
The Terminology of Networks
▪ Undirected path from node i to node j
– Sequence of connecting arcs whose direction can be with toward or away
from node j

▪ Connected network
– Every pair of nodes in the network has at least one undirected path
between them

▪ Tree (spanning tree)

– Connected network with no undirected cycles

17
The Terminology of Networks
▪ Directed network
– Network has only directed arcs

▪ Undirected network
– Network has only undirected arcs

▪ Path between two nodes

– A sequence of distinct arcs connecting the nodes

▪ Directed path from node i to node j

– Sequence of connecting arcs toward node j

18
The Terminology of Networks

19
The Terminology of Networks

20
The Terminology of Networks
▪ Arc capacity
– Maximum amount of flow that can be carried on a directed arc

▪ Supply node
– Flow out exceeds flow in

▪ Demand node
– Flow in exceeds flow out

▪ Transshipment node
– Flow in equals flow out

21
Prototype Example
▪ The road system for Seervada
Park
– Location O: park entrance
– Location T: a scenic wonder
– Trams transport sightseers from
park entrance to location T and
back

22
Prototype Example
▪ Park management faces three
problems
– Determine where telephone lines should be
laid
▪ A minimum spanning tree problem
– Determine the route with the smallest total
distance
▪ A shortest-path problem
– Determine how to route tram to maximize
number of trips during peak season
▪ A maximum flow problem

23
The Minimum Spanning Tree Problem
▪ Given: nodes of a network, potential links, and positive length of
each link if it is inserted into the network
– Design the network by inserting links
– A path must exist between every pair of nodes

▪ Problem: minimize total length of links inserted into the network

▪ Network of n nodes requires only n−1 links
– Choose the links to form a spanning tree
– If a network has n nodes, then the maximum number of spanning trees
possible is nn-2

24
The Minimum Spanning Tree Problem
▪ Applications
– Design of telecommunications networks
– Design of a lightly-used transportation network to minimize cost of
providing links
– Design network of power transmission lines
– Electrical equipment wiring
– Piping systems

25
The Minimum Spanning Tree Problem
▪ Algorithm
– Select any node arbitrarily and then add a link to connect it to its nearest
node
– Identify the unconnected node that is closest to a connected node, and
add a link between them
▪ Repeat until all nodes have been connected
– Ties may be broken arbitrarily
▪ There may be multiple optimal solutions

26
The Minimum Spanning Tree Problem

27
The Shortest-Path Problem
▪ Consider an undirected, connected
network
– Contains origin and destination nodes
– Each link has a nonnegative distance

▪ The problem
– Find the shortest path from origin to
destination

28
The Shortest-Path Problem

▪ Network simplex method

– An alternate option for solving shortest-path problems

▪ Three categories of applications

– Minimize total distance traveled
– Minimize total cost of a sequence of activities
– Minimize total time of a sequence of activities

30
The Maximum Flow Problem

31
The Maximum Flow Problem
▪ General problem description
– All flow through a directed, connected network
originates at a source, and terminates at a sink
▪ Remaining nodes are transshipment nodes
– Flow through an arc is allowed in only one
direction (indicated by the arrowhead)
▪ Maximum flow is given by arc capacity
– Objective: maximize total flow from source to
sink

32
The Maximum Flow Problem
▪ Applications
– Maximize flow through company’s distribution network from factories to
customers
– Maximize flow through company’s supply network from vendors to
factories
– Maximize oil flow through a system of pipelines
– Maximize water flow through aqueducts
– Maximize flow of vehicles through a transportation network

33
The Minimum Cost Flow Problem

▪ General description of the minimum cost flow problem

– The network is directed and connected
– At least one of the nodes is a supply node, and one of the other nodes is a
demand node
▪ All remaining nodes are transshipment nodes
– Flow is only allowed in direction of the arrowhead
▪ Arc capacity gives maximum allowable flow

34
The Minimum Cost Flow Problem

▪ General description (cont’d.)

– Network has enough arcs with sufficient capacity to enable all flow
generated at supply nodes to reach all demand nodes
– Cost of flow through each arc is proportional to the amount of flow
– Objective: minimize total cost of sending available supply through the
network to meet the given demand

35
The Minimum Cost Flow Problem
▪ Special cases that fit the minimum cost flow problem
– The transportation problem
– The assignment problem

36