Introduction To Decision Analysis
Introduction To Decision Analysis
DECISION ANALYSIS
Safriyana
[email protected]
▪ Help us make a better business decision that
makes companies stay competitive in a
dynamically-changing environment
➢ Methods
1. Intuitive decision
2. Normative decision (Decision Analysis)
Normative Decision Analysis
Environment
Intelligence • Alternatives
• Uncertain
• Choice
• Complex • Possibilities
Preference • Model structure
• Dynamic • Infor.
• Evaluation Logical Decision Result
• Competition
Philosophic• Preference • Time preference
• Limited
• Risk preference
Information
Sensitivity
REACTION
Objective to be Achieved
Problems to be solved
Performance Decision
Criteria Maker
Alternatives
Tools/Plan/…
Decision Components
➢ Alternative
➢ Criteria/Factors
➢ Evaluation Model
➢ Computational Model
Examples:
Examples:
….
▪ In this scenario, the person in charge of making the
decision knows for sure the consequence of each
alternative, strategy or course of action to be taken
▪ In these circumstances, it is possible to foresee (if not
control) the facts and the results
▪ The decision-making process will be relatively
simple: the one that maximizes utility and responds
better to the objectives set will be chosen.
▪ The most common application
▪ Allocating limited resources among competing activities
in a best possible (i.e.optimal) way
▪ Uses a mathematical model to describe the levels
of concern
▪ Linear means mathematical functions in the model
are required to be linear functions
▪ Programming as a synonym for planning
▪ LP involves the planning of activities to obtain an
optimal result i.e. a result that teaches the
specified goal best among all feasible alternatives
Objective
Function
Maximize (or minimize) Z = c1 X1 + c2 X2 + ….+ cn Xn
Non-negativity
X1 ≥ 0, X2 ≥ 0, … , Xn ≥ 0 constraints
▪ Z = value of overall measure of performance
▪ xj = level of activity j (for j = 1, 2, …., n)
▪ cj = increase in Z that would result from each unit increase in
level of activity j
▪ bi= amount of resource i that is available for allocation of
activities (for i = 1, 2, …., m)
▪ aij = amount of resource i consumed by each unit of activity j
• Plant 1: X1 ≤ 4
• Plant 2: 2X2 ≤ 12
• Plant 3: 3X1 + 2X2≤ 18
• X1 ≥ 0, X2 ≥ 0
▪ X1= number of batches of product 1 produced per week
▪ X2 = number of batches of product 2 produced per week
▪ Z = total profit per week (in thousands of dollars) from producing these two
products
Maximize Z = 3 X1 + 5 X2
Subject to:
▪ X1 ≤ 4
▪ 2X2 ≤ 12
▪ 3X1 + 2X2 ≤ 18
and
▪ X1 ≥ 0, X2 ≥ 0
Maximize Z = 3 X1 + 5 X2
Subject to:
X1 ≤ 4
2X2 ≤ 12
3X1 + 2X2 ≤ 18
and
X1 ≥ 0, X2 ≥ 0
Maximize Z = 3 X1 + 5 X2
Subject to:
X1 ≤ 4
2X2 ≤ 12
3X1 + 2X2 ≤ 18
and
X1 ≥ 0, X2 ≥ 0
Maximize Z = 3 X1 + 5 X2
Subject to:
X1 ≤ 4
2X2 ≤ 12
3X1 + 2X2 ≤ 18
and
X1 ≥ 0, X2 ≥ 0
▪ The optimal solution is
▪ X1 = 2, and X2 = 6, with Z = 36
▪ Basic setup:
▪ Trees run left to right
Japanese
chronologically.
North Side ▪ Decision nodes are
represented as squares.
Greek
▪ Possible choices are
represented as lines (also
Vietnam called branches).
South Side ▪ The value associated with
each choice is at the end of
Thai the branch.
Example: deciding where to eat dinner
Speed
Japanese
1
North Side
Value =2
Greek
2
Value =4
Vietnam
4
South Side
Value =4
Thai
3
n
E V ( x ) = p ( x i) x i
i= 1
w h e re
x i = o u tc o m e i
p ( x i) = p r o b a b ilit y o f o u t c o m e i
States Of Nature
Good Foreign Poor Foreign
Decision Competitive Condition Competitive Condition
Queueing System
Queue
C S
Customers CCCCCCC C S Service
C S facility
C S
Served Customers
L = Expected number of customers in the system, including
those being served (the symbol L comes from Line Length).
Lq = Expected number of customers in the queue, which
excludes customers being served.
W = Expected waiting time in the system (including service
time) for an individual customer (the symbol W comes from
Waiting time).
Wq = Expected waiting time in the queue (excludes service
time) for an individual customer.
▪ Key problems in business, engineering and
sciences can be formulated in terms of: