Modeling
Modeling
Identify elements
appropriate objectives, constraints, interrelationships with
other areas of the organization, alternative courses of
action, time constraints
OR/MS teams work in advisory capacity
Ascertain appropriate objectives from management
Concerned with the entire organization
Objectives need to be specific
Example: maximum profit in the long run; minimum waiting
time
Data gathering
Complete problem understanding
Input to model 2
Often challenging and time consuming
Formulating a Mathematical Model
Decision variables:
Represent the decisions to be made
Objective function
Performance measure expressed as a function of the
decision variables
Example: profit, P = 3x1 + 4x2 + 5x3
Constraints
Restrictions of values of decision variables
model
Example: the number 10 in the above equation
gathering data
4
Deriving Solutions from the Model
optimal solution
(Sensitivity analysis) 5
Testing the Model (Model validation)
the past
etc.
6
Preparing to Apply the Model
implementation procedures
May develop a decision support system (DSS)
Decision-support system
Interactive, computer-based system
decision-making
7
Implementation
Operations management
8
Summary
Overlapping phases:
Defining Problem and Gathering Data
Implementation
Note
This “case study” aims to provide a concrete background for appreciating
the “modeling approach.”
It is not required to fully understand the technical details.
10
Network design problem
Single product
Two plants p1 and p2: have same production costs
– Plant P1 has an annual capacity of 200,000 units.
– Plant p2 has an annual capacity of 60,000 units.
Two warehouses w1 and w2: same handling costs.
Three markets areas c1,c2 and c3 with demands of
50,000, 100,000 and 50,000, respectively.
Distribution costs per unit
WH\Facility P1 P2 C1 C2 C3
W1 0 4 3 4 5
W2 5 2 2 1 2 11
Problem: To find a distribution strategy that specifies the
flow of products from the suppliers through the warehouses
to the market areas without violating plant p2 production
capacity constraint, that satisfies market area demands,
and that minimizes total distribution costs.
$0
$3 D = 50,000
Cap = 200,000
$4
$5
$5 D = 100,000
$4 $2
$2 $1
Cap = 60,000
$2
D = 50,000
Production costs are the same, warehousing costs are the same
12
Model formulation
– a linear programming model
Let: x ijpw = the flow from plant i to warehouse j
x wm
jk = the flow from warehouse j to market k
pw pw pw pw
min: 0x 1,1 + 5x1,2 + 4x 2,1 + 2x 2,2
wm
+ 3x1,1 + 4x wm
1,2 +5x wm
1,3 + 2x wm
2,1 +1x wm
2,2 +2x wm
2,3
pw pw
s.t . x 2,1 +x 2,2 ≤60 , 000
pw pw
x 1,1 +x 2,1 =x wm
1,1 +x wm
1,2 +x wm
1,3
pw pw
x 1,2 +x 2,2 =x wm
2,1 +x wm
2,2 +x wm
2,3
wm wm
x 1,1 +x 2,1 = 50 ,000
wm
x 1,2 +x wm
2,2 =100 , 000
wm
x 1,3 +x wm
2,2 = 50 ,000
13
A heuristic algorithm:
– Assign each market to closest WH. Then assign each plant based on cost.
D = 50,000
Cap = 200,000
$5 x 140,000 D = 100,000
$2 x 50,000
$2 x 60,000 $1 x 100,000
Cap = 60,000
$2 x 50,000
D = 50,000
Facility P1 P2 C1 C2 C3
Warehouse
W1 140000 0 50000 40000 50000
W2 0 60000 0 60000 0
Why DSS?
– Some decisions are better made by computers
– Some decisions are better made by people
– DSS allow computers and people to work
together to make better decisions
Components:
– Input data
– Analytical tools
– Output and Presentation tools
19
A DSS for Network Design
-- IBM ILOG LogicNet Plus
20
21
IBM LogicNet Plus (cont)
22
IBM LogicNet Plus (cont)
Review
This slides
25
Assignment
– More about Excel
You can always refer to this tutorial (or a similar one) for the