Scribd
Upload
6 views

Operations Research - Classes 12 to 13

OR Part 1

Uploaded by

shreyas28
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
6 views

Operations Research - Classes 12 to 13

OR Part 1

Uploaded by

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

Course Outline

 Linear Programming problems – Formulation, Graphical


method - Sensitivity Analysis and Duality
 Transportation, Transshipment and Assignment
problems
 Decision trees
 Network optimization models
 Integer programming problems
 Project management
 Simulation – A brief overview
 Waiting line models
 Multi-objective decision problems
 Dynamic Programming
Course Outline
 Linear Programming problems – Formulation, Graphical
method - Sensitivity Analysis and Duality
 Transportation, Transshipment and Assignment
problems
 Decision trees
 Network optimization models
 Integer programming problems
 Project management
 Simulation – A brief overview
 Waiting line models
 Multi-objective decision problems
 Dynamic Programming
Network Optimization
Models
 Minimum Spanning Tree Problem (MST)

 Maximal Flow Problem

 Shortest Path Problem (SPP)

 Eulerian Circuit

 Chinese Postman Problem


Network or Graph??
 In its simplest sense, a network is a set of
nodes/vertices with arcs/edges connecting them
2
 Undirected/Directed
4
 Connected Graph 1

 Sub-graph 3

 Tree: Connected sub-graph with no cycles


 Spanning Tree
Components of typical
networks
Nodes Arcs Flow

Intersections Roads Vehicles

Airports Air lanes Aircraft

Switching points Wires, channels Information via


data packets
Pumping stations Pipes Fluids

Work centers Materials-handling Jobs


routes
Minimum Spanning Tree
(MST)
4
2
6

3 7
4
6

2
5

1
7
3
4
6

2
5

3 7
Minimum Spanning Tree
(MST)
Minimum Spanning Tree
(MST)
Minimum Spanning Tree
(MST)
Minimum Spanning Tree
(MST)
A T

2 7 5
2

5 4
O B D
7
3 1
1
4

C E
4
Maximum Flow Problem
 Consider the following network connecting six cities
 Each circle in the picture represents a city
 The three numbers are the least amount you can ship
along the route, the maximum tonnage you can ship,
and the cost in dollars per ton shipped along this arc,
respectively.
 There are 30 tons of material at city 1 and all of it
should be shipped to city 6. At any of the intermediate
cities, the material reaching should be equal to
material leaving!
Maximum Flow Problem
(0,10,1)
2 4
(0
,1
, 2) 8,
2)
, 17
(0

(0,5,3) (0,5,6)
1 6

(0
,5
,3
(0
,2
5, ) , 3)
1) 17
,
(0
3 5
(0,20,5)
Maximum Flow Problem
Maximum Flow Problem

F
Maximum Flow Problem
Maximize F
F  f12  f13  f14
f12  f 32  f 52  f 21  f 23  f 25
f13  f 23  f 43  f 53  f 63  f 31  f 32  f 34  f 35  f 36
f14  f 34  f 74  f 41  f 43  f 47
f 25  f 35  f 65  f 85  f 52  f 53  f 56  f 58
f 36  f 56  f 76  f 86  f 96  f 63  f 65  f 67  f 68  f 69
f 47  f 67  f 97  f 74  f 76  f 79
f 58  f 68  f 98  f10 8  f 85  f 86  f 89  f 8 10
f 69  f 79  f 89  f10 9  f 96  f 97  f 98  f 9 10
f8 10  f 9 10 F
Maximum Flow Problem
f12 20 f 21 0 f13 15 f31 0 f14 22 f41 0
f 25 18 f52 0 f23 20 f32 10 f34 0 f43 5
f35 20 f53 0 f36 13 f63 0 f47 18 f74 0
f56 10 f65 0 f58 14 f85 0 f67 5 f76 0
f 68 25 f86 0 f69 5 f96 0 f79 20 f97 0
f89 10 f98 0 f8 10 30 f10  8 0 f9  10 25 f10  9 0
Shortest Path Problem
(SPP)
2 547 5 547 8 419
313 688 412 278 11
414
704 622 311
467
1 413 3 609 6 400 9 900 13
322 367
396 293 443 463
445 628 580 12
486 1
4 589 7 654 0
288

1. Dijkstra’s Algorithm – small problems


2. Mathematical Model – Additional complicating
constraints
Mathematical model - SPP
1, if traversed from node i to node j
X ij 
0, otherwise
Constraints:
1: X12+X13+X14-X21-X31-X41 = 1
2: X21+X23+X26-X12-X32-X62 =0
3: X31+X32+X34+X35+X36-X13-X23-X43-X53-X63 = 0
4: X41+X43+X45-X14-X34-X54 =0
5: X54+X53+X56-X45-X35-X65 =0
6: X62+X63+X65-X26-X36-X56 = -1
Mathematical model - SPP
n n
Minimize Z   Cij X ij
i 1 j 1, j i

Subject to

n n
 1, if i is a source node

 X ij   X ki 0, if i is a transhipment node
j 1; j i k 1; k i   1, if i is a destination node

1, if traversed from i to j
X ij 
0, otherwise
Shortest Path Problem
(SPP)
Equipment replacement
problem
Equipment replacement
problem

You might also like