Multi Criteria Decision Making (MCDM)
Multi Criteria Decision Making (MCDM)
Safety
Environment
Cost
Examples: Multi-Criteria Problems
Profitability
Growth and diversity of the product line
Increased market share
Maintained technical capability
Firm reputation and image
Examples: Multi-Criteria Problems
Cost
Health
Reliability
Importance of areas
Examples: Multi-Criteria Problems
Goal Programming:
Scoring Models
The blue point minimizes both Although orange is on the Pareto front,
f1 and f2 . There is only one moving to purple costs very little f2 for
Pareto-optimal solution. huge gains in f1
Goal Programming Versus
Linear Programming
A variation of linear programming that allows multiple
objectives (goals)—soft (goal) constraints or a combination of
soft and hard (nongoal) constraints - that can deviate,
allowing for tradeoffs rather than only optimal solutions.
GP models are similar to LP models in that both are
formulated under the same requirements and assumptions
(e.g., linearity, nonnegativity, certainty).
Weighted vs. Preemptive
Goal Programming
Weighted goal programming is designed for problems where all
the goals have been assigned some weights depending on situation.
Preemptive goal programming (Lexicographic GP) is used
when there are major differences in the importance of the goals.
The goals are listed in the order of their importance.
It begins by focusing solely on the most important goal.
It next does the same for the second most important goal (as is
possible without hurting the first goal).
The same continues without hurting the previous more important
goals
Goal Programming
Deviational variables di+ and di- are amounts a targeted
goal i is overachieved or underachieved, respectively.
The goals themselves are added to the constraint set with
di+ and di- acting as the surplus and slack variables.
One approach to goal programming is to satisfy goals in a
priority sequence. Second-priority goals are pursued
without reducing the first-priority goals, etc.
Goal Programming
Functional Constraints
Availability of floppy disk drives: 2x1 + x2 < 1000
Availability of zip disk drives: x2 < 500
Availability of cases: x1 + x2 < 600
Example:
Conceptual Products
Goals
(1) 200 CP400 computers weekly:
x1 + d1- - d1+ = 200
(2) 500 total computers weekly:
x1 + x2 + d2- - d2+ = 500
(3) $250(in thousands) profit:
.2x1 + .5x2 + d3- - d3+ = 250
(4) 400 total man-hours weekly:
x1 + 1.5x2 + d4- - d4+ = 400
Non-negativity:
x1, x2, di-, di+ > 0 for all i
Example:
Conceptual Products
Objective Functions
x1
200 400 600 800 1000 1200
Example:
Conceptual Products
Graphical Solution, Iteration 2
Now add Goal 1 as x1 > 200 and graph Goal 2:
x1 + x2 = 500. Note on the next slide that there is
still a set of points satisfying the first goal that
also satisfies this second goal by either meeting
or exceeding the requirements (where d2- = 0).
Example:
Conceptual Products
Goal 1 (Constraint) and Goal 2 Graphed
x2
x1
200 400 600 800 1000 1200
Example:
Conceptual Products
Graphical Solution, Iteration 3
add Goal 2 as x1 + x2 > 500 and Goal 3: .2x1 + .5x2 = 250.
Note on the next slide that no points satisfy the previous
functional constraints and goals and satisfy this
constraint.
Thus, to Min d3-, this minimum value is achieved when we
Max .2x1 + .5x2. Note that this occurs at x1 = 200 and x2 =
400, so that .2x1 + .5x2 = 240 or d3- = 10.
Example:
Conceptual Products
Goal 2 (Constraint) and Goal 3 Graphed
x2
Mathematical Model
Sj = S wi rij
i
where:
rij = rating for criterion i and decision alternative j
Sj = score for decision alternative j
Scoring Model for Job Selection
Importance Weight
Very unimportant 1
Somewhat unimportant 2
Average importance 3
Somewhat important 4
Very important 5
Scoring Model for Job Selection