The Hong Kong University of Science and Technology
IELM 2

Fall 2015
Facilities Planning
Objectives and Agenda:
1. Different types of Facilities Planning Problems
2. Intro to Graphs as a tool for deterministic optimization
3. Finding the Minimum Spanning Tree (MST) in a graph
4. Optimum solution of a Facilities Planning Pr
The Hong Kong University of Science and Technology
IELM 2

Fall 2015
Facilities Planning
Objectives and Agenda:
1. Examples of Shortest Path Problem
2. Finding shortest paths: Dijkstras method
3. Other applications of Shortest path problem
Example (Shortest Path Problem)
What is the shortest route from Point A to Point B ?
The Hong Kong University of Science and Technology
IELM 2

Fall 2015
Optimization: Linear Programming
Agenda:
1. A brief historical perspective
2. Some applications of LP
3. Convex shapes
4. A geometric introduction to linear programing (LP)
5. Using Excel to solve LP problems
A brief history
Humans have known about solvin
The Hong Kong University of Science and Technology
IELM 2

Fall 2015
Proof of correctness, Prims algorithm.
Proof: using induction on the ith step
Our claim is that the edge that is included in the ith step must be part of a Minimum Spanning Tree
Since this is true for each step, i = 1, 2, n1, (if total number of vertic
The Hong Kong University of Science and Technology
IELM 2

Fall 2015
IELM 2010. Industrial Engineering & Modern Logistics
Fall 2015, Assignment 1. Due: Sept 24. Max score: 10
Q1. Reading assignment
Look up the description/reviews of the suggested readings books (use google and/or reviews on
Amazon.com) and identify the boo
The Hong Kong University of Science and Technology
IELM 2

Fall 2015
Logistics Routing Plans: Max Flow Problem
Objectives and Agenda:
1. Examples for flow of materials over channels that have
limited capacity
2. Finding maximum flows: FordFulkerson Method
Logistics supply problem: Example 1
5
10
PokFuLam
30
50
ai
Ch
an
W
The Hong Kong University of Science and Technology
IELM 2

Fall 2015
IELM 2010 Tutorial
5
By CHEUNG Chong Mo, Terence
6th October 2015
Inequalities vs.
equalities
1. 2x + y 10
2. x y 2
y
10
8
So, 3x 12? 3y 6?
6
x  y= 2
4
2
(0,0)
2
2
4
6
2x + y = 10
8
x
Convexity
Definition: Line segment joining any 2 points lies
insi
The Hong Kong University of Science and Technology
IELM 2

Fall 2015
IELM 2010 Tutorial
2
By CHEUNG Chong Mo, Terence
16th September 2015
Facilities Planning Problem
Example: New China Oil co.
7 oil wells 1 Refinery
Where to locate the refinery to minimize pipeline costs.
R
?
Assumption: The refinery must be located on
one
The Hong Kong University of Science and Technology
IELM 2

Fall 2015
IELM 2010. Industrial Engineering & Modern Logistics
Fall 2015, Assignment 1. Due: Sept 24. Max score: 10
Q1. Reading assignment
Look up the description/reviews of the suggested readings books (use google and/or reviews on
Amazon.com) and identify the boo
The Hong Kong University of Science and Technology
IELM 2

Fall 2015
IELM 2010 Tutorial
4
By CHEUNG Chong Mo, Terence
30th September 2015
Max Flow Problem
Three fundamental concepts:
1. Flow cancellation
2. Augmentation flow
3. Residual network
Max Flow Problem
This is capacity, not
cost or distance now
Flow cancellation
The Hong Kong University of Science and Technology
IELM 2

Fall 2015
IELM 2010 Tutorial
3
By CHEUNG Chong Mo, Terence
23rd September 2015
Outline
Difference between minimum spanning tree and
shortest path problems
Shortest Path Problem (Dijkstras method)
Difference between
minimum spanning tree
and shortest path
Minimum
The Hong Kong University of Science and Technology
IELM 2

Fall 2015
IELM 2010 Tutorial 1
By CHEUNG Chong Mo, Terence
What is Industrial Engineering?
The Engineering of making smart decisions
Decisions of what? The design, installation and
operation of integrated systems
i.e. product design, ergonomic, facility layout
d
The Hong Kong University of Science and Technology
IELM 2

Fall 2015
IELM 2010. Industrial Engineering & Modern Logistics
Fall 2015, Assignment 2. Due: October 6. Max score: 16
Q1. Shortest paths
[2+5]
(a) Suppose that we find the shortest path from some node, s, to a node, t, on a weighted,
undirected graph G. Will the sh