SlideShare a Scribd company logo
1
Slide
© 2005 Thomson/South-Western
Lesson 10
Multicriteria Decisions within LP Framework
 Goal Programming
 Goal Programming: Formulation
and Graphical Solution
 Scoring Model for Job Selection
2
Slide
© 2005 Thomson/South-Western
Goal Programming
 Goal programming may be used to solve linear
programs with multiple objectives, with each
objective viewed as a "goal".
 In goal programming, di
+ and di
- , deviation
variables, are the 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.
3
Slide
© 2005 Thomson/South-Western
Goal Programming
 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.
 For each priority level, the objective function is to
minimize the (weighted) sum of the goal deviations.
 Previous "optimal" achievements of goals are added to
the constraint set so that they are not degraded while
trying to achieve lesser priority goals.
4
Slide
© 2005 Thomson/South-Western
Goal Programming Formulation
Step 1: Decide the priority level of each goal.
Step 2: Decide the weight on each goal.
If a priority level has more than one goal, for
each goal i decide the weight, wi , to be placed
on the deviation(s), di
+ and/or di
-, from the goal.
5
Slide
© 2005 Thomson/South-Western
Goal Programming Formulation
Step 3: Set up the initial linear program.
Min w1d1
+ + w2d2
-
s.t. Functional Constraints,
and Goal Constraints
Step 4: Solve the current linear program.
If there is a lower priority level, go to step 5.
Otherwise, a final solution has been reached.
6
Slide
© 2005 Thomson/South-Western
Goal Programming Formulation
Step 5: Set up the new linear program.
Consider the next-lower priority level goals and
formulate a new objective function based on these
goals. Add a constraint requiring the achievement of
the next-higher priority level goals to be maintained.
The new linear program might be:
Min w3d3
+ + w4d4
-
s.t. Functional Constraints,
Goal Constraints, and
w1d1
+ + w2d2
- = k
Go to step 4. (Repeat steps 4 and 5 until all priority
levels have been examined.)
7
Slide
© 2005 Thomson/South-Western
Example: Conceptual Products
Conceptual Products is a computer company that
produces the CP400 and CP500 computers. The
computers use different
mother boards produced
in abundant supply by the
company, but use the same
cases and disk drives. The
CP400 models use two floppy disk drives and no zip
disk drives whereas the CP500 models use one
floppy disk drive and one zip disk drive.
8
Slide
© 2005 Thomson/South-Western
Example: Conceptual Products
Conceptual Products is a computer company that
produces the CP400 and CP500 computers. Many of
the components used in the two
computer models are produced in
abundant supply by the company.
However, the memory modules,
external hard drives, and cases are
bought from suppliers.
The CP400 model uses two memory modules and
no external hard drive, whereas the CP500 uses one
memory module and one external hard drive. Both
models use one case.
9
Slide
© 2005 Thomson/South-Western
Example: Conceptual Products
Suppliers can provide Conceptual Products with
1000 memory modules, 500 external hard drives, and
600 cases on a weekly basis. It takes one hour to
manufacture a CP400 and its profit is $200 and it takes
one and one-half hours to manufacture a CP500 and
its profit is $500.
10
Slide
© 2005 Thomson/South-Western
Example: Conceptual Products
The company has four goals:
Priority 1: Meet a state contract of 200 CP400
machines weekly. (Goal 1)
Priority 2: Make at least 500 total computers
weekly. (Goal 2)
Priority 3: Make at least $250,000 weekly. (Goal 3)
Priority 4: Use no more than 400 man-hours per
week. (Goal 4)
11
Slide
© 2005 Thomson/South-Western
 Variables
x1 = number of CP400 computers produced weekly
x2 = number of CP500 computers produced weekly
di
- = amount the right hand side of goal i is deficient
di
+ = amount the right hand side of goal i is exceeded
 Functional Constraints
Availability of memory modules: 2x1 + x2 < 1000
Availability of external hard drives: x2 < 500
Availability of cases: x1 + x2 < 600
Goal Programming: Formulation
12
Slide
© 2005 Thomson/South-Western
 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
Goal Programming: Formulation
13
Slide
© 2005 Thomson/South-Western
 Objective Functions
Priority 1: Minimize the amount the state contract
is not met: Min d1
-
Priority 2: Minimize the number under 500
computers produced weekly: Min d2
-
Priority 3: Minimize the amount under $250,000
earned weekly: Min d3
-
Priority 4: Minimize the man-hours over 400 used
weekly: Min d4
+
Goal Programming: Formulation
14
Slide
© 2005 Thomson/South-Western
 Formulation Summary
Min P1(d1
-) + P2(d2
-) + P3(d3
-) + P4(d4
+)
s.t. 2x1 +x2 < 1000
+x2 < 500
x1 +x2 < 600
x1 +d1
- -d1
+ = 200
x1 +x2 +d2
- -d2
+ = 500
.2x1+ .5x2 +d3
- -d3
+ = 250
x1+1.5x2 +d4
- -d4
+ = 400
x1, x2, d1
-, d1
+, d2
-, d2
+, d3
-, d3
+, d4
-, d4
+ > 0
Goal Programming: Formulation
15
Slide
© 2005 Thomson/South-Western
 Iteration 1
To solve graphically, first graph the functional
constraints. Then graph the first goal: x1 = 200. Note
on the next slide that there is a set of points that
exceed x1 = 200 (where d1
- = 0).
Goal Programming:
Graphical Solution
16
Slide
© 2005 Thomson/South-Western
 Functional Constraints and Goal 1 Graphed
2x1 + x2 < 1000
Goal 1: x1 > 200
x1 + x2 < 600
x2 < 500
Points
Satisfying
Goal 1
x1
x2
Goal Programming:
Graphical Solution
1000
800
600
400
200
200 400 600 800 1000 1200
17
Slide
© 2005 Thomson/South-Western
 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 (where d2
- = 0).
Goal Programming:
Graphical Solution
18
Slide
© 2005 Thomson/South-Western
 Goal 1 (Constraint) and Goal 2 Graphed
2x1 + x2 < 1000
Goal 1: x1 > 200
x1 + x2 < 600
x2 < 500
Points Satisfying
Both Goals 1 and 2
x1
x2
Goal 2: x1 + x2 > 500
Goal Programming:
Graphical Solution
200 400 600 800 1000 1200
1000
800
600
400
200
19
Slide
© 2005 Thomson/South-Western
 Iteration 3
Now 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.
Goal Programming:
Graphical Solution
20
Slide
© 2005 Thomson/South-Western
 Goal 2 (Constraint) and Goal 3 Graphed
2x1 + x2 < 1000
Goal 1: x1 > 200
x1 + x2 < 600 x2 < 500
Points Satisfying
Both Goals 1 and 2
x1
x2
Goal 2: x1 + x2 > 500
Goal 3: .2x1 + .5x2 = 250
(200,400)
Goal Programming:
Graphical Solution
200 400 600 800 1000 1200
1000
800
600
400
200
21
Slide
© 2005 Thomson/South-Western
Scoring Model for Job Selection
A graduating college student with a double major
in Finance and Accounting has received
the following three job offers:
•financial analyst for an investment
firm in Chicago
•accountant for a manufacturing
firm in Denver
•auditor for a CPA firm in Houston
22
Slide
© 2005 Thomson/South-Western
Scoring Model for Job Selection
 The student made the following comments:
•“The financial analyst position
provides the best opportunity for my
long-run career advancement.”
•“I would prefer living in Denver
rather than in Chicago or Houston.”
•“I like the management style and
philosophy at the Houston CPA firm
the best.”
 Clearly, this is a multicriteria decision.
23
Slide
© 2005 Thomson/South-Western
Scoring Model for Job Selection
 Considering only the long-run career
advancement criterion:
•The financial analyst position in
Chicago is the best decision alternative.
 Considering only the location criterion:
•The accountant position in Denver
is the best decision alternative.
 Considering only the style criterion:
•The auditor position in Houston is the best
alternative.
24
Slide
© 2005 Thomson/South-Western
Steps Required to Develop a Scoring Model
 Step 1: List the decision-making criteria.
 Step 2: Assign a weight to each criterion.
 Step 3: Rate how well each decision alternative
satisfies each criterion.
 Step 4: Compute the score for each decision
alternative.
 Step 5: Order the decision alternatives from
highest score to lowest score. The
alternative with the highest score is the
recommended alternative.
25
Slide
© 2005 Thomson/South-Western
 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
26
Slide
© 2005 Thomson/South-Western
Scoring Model: Step 1
 List of Criteria
•Career advancement
•Location
•Management
•Salary
•Prestige
•Job Security
•Enjoyable work
27
Slide
© 2005 Thomson/South-Western
Scoring Model: Step 2
 Five-Point Scale Chosen
Importance Weight
Very unimportant 1
Somewhat unimportant 2
Average importance 3
Somewhat important 4
Very important 5
28
Slide
© 2005 Thomson/South-Western
Scoring Model: Step 2
 Assigning a Weight to Each Criterion
Criterion Importance Weight
Career advancement Very important 5
Location Average importance 3
Management Somewhat important 4
Salary Average importance 3
Prestige Somewhat unimportant 2
Job security Somewhat important 4
Enjoyable work Very important 5
29
Slide
© 2005 Thomson/South-Western
 Nine-Point Scale Chosen
Level of Satisfaction Rating
Extremely low 1
Very low 2
Low 3
Slightly low 4
Average 5
Slightly high 6
High 7
Very high 8
Extremely high 9
Scoring Model: Step 3
30
Slide
© 2005 Thomson/South-Western
 Rate how well each decision alternative satisfies
each criterion.
Decision Alternative
Analyst Accountant Auditor
Criterion Chicago Denver Houston
Career advancement 8 6 4
Location 3 8 7
Management 5 6 9
Salary 6 7 5
Prestige 7 5 4
Job security 4 7 6
Enjoyable work 8 6 5
Scoring Model: Step 3
31
Slide
© 2005 Thomson/South-Western
 Compute the score for each decision alternative.
Decision Alternative 1 - Analyst in Chicago
Criterion Weight (wi ) Rating (ri1) wiri1
Career advancement 5 x 8 = 40
Location 3 3 9
Management 4 5 20
Salary 3 6 18
Prestige 2 7 14
Job security 4 4 16
Enjoyable work 5 8 40
Score 157
Scoring Model: Step 4
32
Slide
© 2005 Thomson/South-Western
 Compute the score for each decision alternative.
S1 = 5(8)+3(3)+4(5)+3(6)+2(7)+4(4)+5(8) = 157
S2 = 5(6)+3(8)+4(6)+3(7)+2(5)+4(7)+5(6) = 167
S3 = 5(4)+3(7)+4(9)+3(5)+2(4)+4(6)+5(5) = 149
 
j i ij
i
s w r
Scoring Model: Step 4
33
Slide
© 2005 Thomson/South-Western
 Compute the score for each decision alternative.
Decision Alternative
Analyst Accountant Auditor
Criterion Chicago Denver Houston
Career advancement 40 30 20
Location 9 24 21
Management 20 24 36
Salary 18 21 15
Prestige 14 10 8
Job security 16 28 24
Enjoyable work 40 30 25
Score 157 167 149
Scoring Model: Step 4
34
Slide
© 2005 Thomson/South-Western
 Order the decision alternatives from highest
score to lowest score. The alternative with the highest
score is the recommended alternative.
•The accountant position in Denver has the highest
score and is the recommended decision alternative.
•Note that the analyst position in Chicago ranks first
in 4 of 7 criteria compared to only 2 of 7 for the
accountant position in Denver.
•But when the weights of the criteria are considered,
the Denver position is superior to the Chicago job.
Scoring Model: Step 5
35
Slide
© 2005 Thomson/South-Western
Scoring Model for Job Selection
 Partial Spreadsheet Showing Steps 1 - 3
A B C D E
1 RATINGS
2 Analyst Accountant Auditor
3 Criteria Weight Chicago Denver Houston
4 Career Advance. 5 8 6 4
5 Location 3 3 8 7
6 Management 4 5 6 9
7 Salary 3 6 7 5
8 Prestige 2 7 5 4
9 Job Security 4 4 7 6
10 Enjoyable Work 5 8 6 5
36
Slide
© 2005 Thomson/South-Western
Scoring Model for Job Selection
 Partial Spreadsheet Showing Formulas of Step 4
A B C D E
12 SCORING CALCULATIONS
13 Analyst Accountant Auditor
14 Criteria Chicago Denver Houston
15 Career Advance. =B4*C4 =B4*D4 =B4*E4
16 Location =B5*C5 =B5*D5 =B5*E5
17 Management =B6*C6 =B6*D6 =B6*E6
18 Salary =B7*C7 =B7*D7 =B7*E7
19 Prestige =B8*C8 =B8*D8 =B8*E8
20 Job Security =B9*C9 =B9*D9 =B9*E9
21 Enjoyable Work =B10*C10 =B10*D10 =B10*E10
22 Score =sum(C16:C22) =sum(D16:D22) =sum(E16:E22)
37
Slide
© 2005 Thomson/South-Western
Scoring Model for Job Selection
 Partial Spreadsheet Showing Results of Step 4
A B C D E
12 SCORING CALCULATIONS
13 Analyst Accountant Auditor
14 Criteria Chicago Denver Houston
15 Career Advance. 40 30 20
16 Location 9 24 21
17 Management 20 24 36
18 Salary 18 21 15
19 Prestige 14 10 8
20 Job Security 16 28 24
21 Enjoyable Work 40 30 25
22 Score 157 167 149
38
Slide
© 2005 Thomson/South-Western
End of Lesson 10

More Related Content

What's hot

04 analisis formasi mesin mesin
04 analisis formasi mesin mesin04 analisis formasi mesin mesin
04 analisis formasi mesin mesin
Anugrah Tito
 
Linear Programming 1
Linear Programming 1Linear Programming 1
Linear Programming 1
irsa javed
 
Linear programming - Model formulation, Graphical Method
Linear programming  - Model formulation, Graphical MethodLinear programming  - Model formulation, Graphical Method
Linear programming - Model formulation, Graphical Method
Joseph Konnully
 
Operation research unit 1: LPP Big M and Two Phase method
Operation research unit 1: LPP Big M and Two Phase methodOperation research unit 1: LPP Big M and Two Phase method
Operation research unit 1: LPP Big M and Two Phase method
Dr. L K Bhagi
 
Simplex method concept,
Simplex method concept,Simplex method concept,
Simplex method concept,
Dronak Sahu
 
Pot p emograman linear 2016
Pot  p emograman linear 2016Pot  p emograman linear 2016
Pot p emograman linear 2016
ogie saputra
 
Tutorial: Python, PuLP and GLPK
Tutorial: Python, PuLP and GLPKTutorial: Python, PuLP and GLPK
Tutorial: Python, PuLP and GLPK
sucha
 
Dual simplexmethod
Dual simplexmethodDual simplexmethod
Dual simplexmethod
Joseph Konnully
 
Decision Theory
Decision TheoryDecision Theory
Decision Theory
BhushanPhirke
 
Unit 4 or
Unit 4 orUnit 4 or
SUCCESS STORY: Lightning Reporting - Reducing Report Lead Time from 16 to 4.5...
SUCCESS STORY: Lightning Reporting - Reducing Report Lead Time from 16 to 4.5...SUCCESS STORY: Lightning Reporting - Reducing Report Lead Time from 16 to 4.5...
SUCCESS STORY: Lightning Reporting - Reducing Report Lead Time from 16 to 4.5...
GoLeanSixSigma.com
 
Metode numerik untuk menyelesaikan sistem persamaan linier
Metode numerik untuk menyelesaikan sistem persamaan linierMetode numerik untuk menyelesaikan sistem persamaan linier
Metode numerik untuk menyelesaikan sistem persamaan linier
ahmad puji ardi
 
Mencari Nilai Modus Suatu Data Menggunakan Turbo Pascal
Mencari  Nilai Modus Suatu Data Menggunakan Turbo PascalMencari  Nilai Modus Suatu Data Menggunakan Turbo Pascal
Mencari Nilai Modus Suatu Data Menggunakan Turbo Pascal
Qonitha Amalia
 
Sensitivity analysis in linear programming problem ( Muhammed Jiyad)
Sensitivity analysis in linear programming problem ( Muhammed Jiyad)Sensitivity analysis in linear programming problem ( Muhammed Jiyad)
Sensitivity analysis in linear programming problem ( Muhammed Jiyad)
Muhammed Jiyad
 
Penalty functions
Penalty functionsPenalty functions
Penalty functions
Surajit Banerjee
 
Scm 07 perencanaan aggregate
Scm 07   perencanaan aggregateScm 07   perencanaan aggregate
Scm 07 perencanaan aggregate
Abrianto Nugraha
 
Metode Transportasi (Masalah dalam Metode Transportasi)
Metode Transportasi (Masalah dalam Metode Transportasi)Metode Transportasi (Masalah dalam Metode Transportasi)
Metode Transportasi (Masalah dalam Metode Transportasi)
hazhiyah
 
Riset Operasi - Teori Permainan
Riset Operasi - Teori PermainanRiset Operasi - Teori Permainan
Riset Operasi - Teori Permainan
mieftahulduila
 
Transportation problem
Transportation problemTransportation problem
Transportation problem
Dr. Abdulfatah Salem
 
Introduction to optimization technique
Introduction to optimization techniqueIntroduction to optimization technique
Introduction to optimization technique
KAMINISINGH963
 

What's hot (20)

04 analisis formasi mesin mesin
04 analisis formasi mesin mesin04 analisis formasi mesin mesin
04 analisis formasi mesin mesin
 
Linear Programming 1
Linear Programming 1Linear Programming 1
Linear Programming 1
 
Linear programming - Model formulation, Graphical Method
Linear programming  - Model formulation, Graphical MethodLinear programming  - Model formulation, Graphical Method
Linear programming - Model formulation, Graphical Method
 
Operation research unit 1: LPP Big M and Two Phase method
Operation research unit 1: LPP Big M and Two Phase methodOperation research unit 1: LPP Big M and Two Phase method
Operation research unit 1: LPP Big M and Two Phase method
 
Simplex method concept,
Simplex method concept,Simplex method concept,
Simplex method concept,
 
Pot p emograman linear 2016
Pot  p emograman linear 2016Pot  p emograman linear 2016
Pot p emograman linear 2016
 
Tutorial: Python, PuLP and GLPK
Tutorial: Python, PuLP and GLPKTutorial: Python, PuLP and GLPK
Tutorial: Python, PuLP and GLPK
 
Dual simplexmethod
Dual simplexmethodDual simplexmethod
Dual simplexmethod
 
Decision Theory
Decision TheoryDecision Theory
Decision Theory
 
Unit 4 or
Unit 4 orUnit 4 or
Unit 4 or
 
SUCCESS STORY: Lightning Reporting - Reducing Report Lead Time from 16 to 4.5...
SUCCESS STORY: Lightning Reporting - Reducing Report Lead Time from 16 to 4.5...SUCCESS STORY: Lightning Reporting - Reducing Report Lead Time from 16 to 4.5...
SUCCESS STORY: Lightning Reporting - Reducing Report Lead Time from 16 to 4.5...
 
Metode numerik untuk menyelesaikan sistem persamaan linier
Metode numerik untuk menyelesaikan sistem persamaan linierMetode numerik untuk menyelesaikan sistem persamaan linier
Metode numerik untuk menyelesaikan sistem persamaan linier
 
Mencari Nilai Modus Suatu Data Menggunakan Turbo Pascal
Mencari  Nilai Modus Suatu Data Menggunakan Turbo PascalMencari  Nilai Modus Suatu Data Menggunakan Turbo Pascal
Mencari Nilai Modus Suatu Data Menggunakan Turbo Pascal
 
Sensitivity analysis in linear programming problem ( Muhammed Jiyad)
Sensitivity analysis in linear programming problem ( Muhammed Jiyad)Sensitivity analysis in linear programming problem ( Muhammed Jiyad)
Sensitivity analysis in linear programming problem ( Muhammed Jiyad)
 
Penalty functions
Penalty functionsPenalty functions
Penalty functions
 
Scm 07 perencanaan aggregate
Scm 07   perencanaan aggregateScm 07   perencanaan aggregate
Scm 07 perencanaan aggregate
 
Metode Transportasi (Masalah dalam Metode Transportasi)
Metode Transportasi (Masalah dalam Metode Transportasi)Metode Transportasi (Masalah dalam Metode Transportasi)
Metode Transportasi (Masalah dalam Metode Transportasi)
 
Riset Operasi - Teori Permainan
Riset Operasi - Teori PermainanRiset Operasi - Teori Permainan
Riset Operasi - Teori Permainan
 
Transportation problem
Transportation problemTransportation problem
Transportation problem
 
Introduction to optimization technique
Introduction to optimization techniqueIntroduction to optimization technique
Introduction to optimization technique
 

Similar to OR II.ppt

Goal programming
Goal programmingGoal programming
Goal programming
Hakeem-Ur- Rehman
 
Management Science - Goal Programming Procedure
Management Science - Goal Programming ProcedureManagement Science - Goal Programming Procedure
Management Science - Goal Programming Procedure
SnehalBhatt7
 
Spreadsheet Modeling & Decision AnalysisA Practical .docx
Spreadsheet Modeling & Decision AnalysisA Practical .docxSpreadsheet Modeling & Decision AnalysisA Practical .docx
Spreadsheet Modeling & Decision AnalysisA Practical .docx
rafbolet0
 
linearprogramming.pdf
linearprogramming.pdflinearprogramming.pdf
linearprogramming.pdf
Er. Rahul Jarariya
 
Formulation Lpp
Formulation  LppFormulation  Lpp
Formulation Lpp
Sachin MK
 
LinearProgramming-Graphicalnethod.ppt
LinearProgramming-Graphicalnethod.pptLinearProgramming-Graphicalnethod.ppt
LinearProgramming-Graphicalnethod.ppt
Mayurkumarpatil1
 
Lean Cell Design -Presentation project part c rohan naik & aditya kamble
Lean Cell Design -Presentation project part c  rohan naik & aditya kambleLean Cell Design -Presentation project part c  rohan naik & aditya kamble
Lean Cell Design -Presentation project part c rohan naik & aditya kamble
Rohan Naik
 
Ees 300
Ees 300Ees 300
Ees 300
AgwonaMAllan
 
beyond linear programming: mathematical programming extensions
beyond linear programming: mathematical programming extensionsbeyond linear programming: mathematical programming extensions
beyond linear programming: mathematical programming extensions
Angelica Angelo Ocon
 
Cocomomodel
CocomomodelCocomomodel
Cocomo model
Cocomo modelCocomo model
Cocomo model
Bala Ganesh
 
COCOMO Model
COCOMO ModelCOCOMO Model
COCOMO Model
Dev Kishan Bairwa
 
Goal Programming
Goal ProgrammingGoal Programming
Goal Programming
Nico Penaredondo
 
goalprogramming-150911073618-lva1-app6891 (1).pdf
goalprogramming-150911073618-lva1-app6891 (1).pdfgoalprogramming-150911073618-lva1-app6891 (1).pdf
goalprogramming-150911073618-lva1-app6891 (1).pdf
AmritDas30
 
Cost estimation using cocomo model
Cost estimation using cocomo modelCost estimation using cocomo model
Cost estimation using cocomo model
Nitesh Bichwani
 
ملاحظات مهمة عن تعجيل المشاريع
ملاحظات مهمة عن تعجيل المشاريعملاحظات مهمة عن تعجيل المشاريع
ملاحظات مهمة عن تعجيل المشاريع
Dr. Mahmoud Al-Naimi
 
Metrics
MetricsMetrics
Metrics
geethawilliam
 
CHAPTER TWO - OPERATIONS RESEARCH (2).pptx
CHAPTER TWO - OPERATIONS RESEARCH (2).pptxCHAPTER TWO - OPERATIONS RESEARCH (2).pptx
CHAPTER TWO - OPERATIONS RESEARCH (2).pptx
AynetuTerefe2
 
Elaboración de las alternativas mutuamente excluyentes
Elaboración de las alternativas mutuamente excluyentesElaboración de las alternativas mutuamente excluyentes
Elaboración de las alternativas mutuamente excluyentes
JOe Torres Palomino
 
16083116
1608311616083116
16083116
Sou Tibon
 

Similar to OR II.ppt (20)

Goal programming
Goal programmingGoal programming
Goal programming
 
Management Science - Goal Programming Procedure
Management Science - Goal Programming ProcedureManagement Science - Goal Programming Procedure
Management Science - Goal Programming Procedure
 
Spreadsheet Modeling & Decision AnalysisA Practical .docx
Spreadsheet Modeling & Decision AnalysisA Practical .docxSpreadsheet Modeling & Decision AnalysisA Practical .docx
Spreadsheet Modeling & Decision AnalysisA Practical .docx
 
linearprogramming.pdf
linearprogramming.pdflinearprogramming.pdf
linearprogramming.pdf
 
Formulation Lpp
Formulation  LppFormulation  Lpp
Formulation Lpp
 
LinearProgramming-Graphicalnethod.ppt
LinearProgramming-Graphicalnethod.pptLinearProgramming-Graphicalnethod.ppt
LinearProgramming-Graphicalnethod.ppt
 
Lean Cell Design -Presentation project part c rohan naik & aditya kamble
Lean Cell Design -Presentation project part c  rohan naik & aditya kambleLean Cell Design -Presentation project part c  rohan naik & aditya kamble
Lean Cell Design -Presentation project part c rohan naik & aditya kamble
 
Ees 300
Ees 300Ees 300
Ees 300
 
beyond linear programming: mathematical programming extensions
beyond linear programming: mathematical programming extensionsbeyond linear programming: mathematical programming extensions
beyond linear programming: mathematical programming extensions
 
Cocomomodel
CocomomodelCocomomodel
Cocomomodel
 
Cocomo model
Cocomo modelCocomo model
Cocomo model
 
COCOMO Model
COCOMO ModelCOCOMO Model
COCOMO Model
 
Goal Programming
Goal ProgrammingGoal Programming
Goal Programming
 
goalprogramming-150911073618-lva1-app6891 (1).pdf
goalprogramming-150911073618-lva1-app6891 (1).pdfgoalprogramming-150911073618-lva1-app6891 (1).pdf
goalprogramming-150911073618-lva1-app6891 (1).pdf
 
Cost estimation using cocomo model
Cost estimation using cocomo modelCost estimation using cocomo model
Cost estimation using cocomo model
 
ملاحظات مهمة عن تعجيل المشاريع
ملاحظات مهمة عن تعجيل المشاريعملاحظات مهمة عن تعجيل المشاريع
ملاحظات مهمة عن تعجيل المشاريع
 
Metrics
MetricsMetrics
Metrics
 
CHAPTER TWO - OPERATIONS RESEARCH (2).pptx
CHAPTER TWO - OPERATIONS RESEARCH (2).pptxCHAPTER TWO - OPERATIONS RESEARCH (2).pptx
CHAPTER TWO - OPERATIONS RESEARCH (2).pptx
 
Elaboración de las alternativas mutuamente excluyentes
Elaboración de las alternativas mutuamente excluyentesElaboración de las alternativas mutuamente excluyentes
Elaboración de las alternativas mutuamente excluyentes
 
16083116
1608311616083116
16083116
 

More from Ahmed Sobhi

MAN 547_Reverse Engineering-Hardware and Software.pptx
MAN 547_Reverse Engineering-Hardware and Software.pptxMAN 547_Reverse Engineering-Hardware and Software.pptx
MAN 547_Reverse Engineering-Hardware and Software.pptx
Ahmed Sobhi
 
4288904.pptx
4288904.pptx4288904.pptx
4288904.pptx
Ahmed Sobhi
 
CMM
CMMCMM
Design
DesignDesign
Design
Ahmed Sobhi
 
L01_IENG 202 - ORI - Intro.pptx
L01_IENG 202 - ORI - Intro.pptxL01_IENG 202 - ORI - Intro.pptx
L01_IENG 202 - ORI - Intro.pptx
Ahmed Sobhi
 
Network flow
Network flowNetwork flow
Network flow
Ahmed Sobhi
 
MAN 547-Interpolation.pptx
MAN 547-Interpolation.pptxMAN 547-Interpolation.pptx
MAN 547-Interpolation.pptx
Ahmed Sobhi
 
LOGISTIKE.pdf
LOGISTIKE.pdfLOGISTIKE.pdf
LOGISTIKE.pdf
Ahmed Sobhi
 
4handling-part4-171025101141.pdf
4handling-part4-171025101141.pdf4handling-part4-171025101141.pdf
4handling-part4-171025101141.pdf
Ahmed Sobhi
 
camsfollowers-190301142036.pdf
camsfollowers-190301142036.pdfcamsfollowers-190301142036.pdf
camsfollowers-190301142036.pdf
Ahmed Sobhi
 
2nd lect CADCAM.pptx
2nd lect CADCAM.pptx2nd lect CADCAM.pptx
2nd lect CADCAM.pptx
Ahmed Sobhi
 
7807139.ppt
7807139.ppt7807139.ppt
7807139.ppt
Ahmed Sobhi
 
13675443.ppt
13675443.ppt13675443.ppt
13675443.ppt
Ahmed Sobhi
 
Lect_03 Mechanisms Sp23.pdf
Lect_03 Mechanisms Sp23.pdfLect_03 Mechanisms Sp23.pdf
Lect_03 Mechanisms Sp23.pdf
Ahmed Sobhi
 
6177233.ppt
6177233.ppt6177233.ppt
6177233.ppt
Ahmed Sobhi
 
02_Ch(2)_Work Systems and How They Work.pptx
02_Ch(2)_Work Systems and How They Work.pptx02_Ch(2)_Work Systems and How They Work.pptx
02_Ch(2)_Work Systems and How They Work.pptx
Ahmed Sobhi
 
03.ppt
03.ppt03.ppt
03.ppt
Ahmed Sobhi
 

More from Ahmed Sobhi (17)

MAN 547_Reverse Engineering-Hardware and Software.pptx
MAN 547_Reverse Engineering-Hardware and Software.pptxMAN 547_Reverse Engineering-Hardware and Software.pptx
MAN 547_Reverse Engineering-Hardware and Software.pptx
 
4288904.pptx
4288904.pptx4288904.pptx
4288904.pptx
 
CMM
CMMCMM
CMM
 
Design
DesignDesign
Design
 
L01_IENG 202 - ORI - Intro.pptx
L01_IENG 202 - ORI - Intro.pptxL01_IENG 202 - ORI - Intro.pptx
L01_IENG 202 - ORI - Intro.pptx
 
Network flow
Network flowNetwork flow
Network flow
 
MAN 547-Interpolation.pptx
MAN 547-Interpolation.pptxMAN 547-Interpolation.pptx
MAN 547-Interpolation.pptx
 
LOGISTIKE.pdf
LOGISTIKE.pdfLOGISTIKE.pdf
LOGISTIKE.pdf
 
4handling-part4-171025101141.pdf
4handling-part4-171025101141.pdf4handling-part4-171025101141.pdf
4handling-part4-171025101141.pdf
 
camsfollowers-190301142036.pdf
camsfollowers-190301142036.pdfcamsfollowers-190301142036.pdf
camsfollowers-190301142036.pdf
 
2nd lect CADCAM.pptx
2nd lect CADCAM.pptx2nd lect CADCAM.pptx
2nd lect CADCAM.pptx
 
7807139.ppt
7807139.ppt7807139.ppt
7807139.ppt
 
13675443.ppt
13675443.ppt13675443.ppt
13675443.ppt
 
Lect_03 Mechanisms Sp23.pdf
Lect_03 Mechanisms Sp23.pdfLect_03 Mechanisms Sp23.pdf
Lect_03 Mechanisms Sp23.pdf
 
6177233.ppt
6177233.ppt6177233.ppt
6177233.ppt
 
02_Ch(2)_Work Systems and How They Work.pptx
02_Ch(2)_Work Systems and How They Work.pptx02_Ch(2)_Work Systems and How They Work.pptx
02_Ch(2)_Work Systems and How They Work.pptx
 
03.ppt
03.ppt03.ppt
03.ppt
 

Recently uploaded

Data Driven Maintenance | UReason Webinar
Data Driven Maintenance | UReason WebinarData Driven Maintenance | UReason Webinar
Data Driven Maintenance | UReason Webinar
UReason
 
AI + Data Community Tour - Build the Next Generation of Apps with the Einstei...
AI + Data Community Tour - Build the Next Generation of Apps with the Einstei...AI + Data Community Tour - Build the Next Generation of Apps with the Einstei...
AI + Data Community Tour - Build the Next Generation of Apps with the Einstei...
Paris Salesforce Developer Group
 
一比一原版(uofo毕业证书)美国俄勒冈大学毕业证如何办理
一比一原版(uofo毕业证书)美国俄勒冈大学毕业证如何办理一比一原版(uofo毕业证书)美国俄勒冈大学毕业证如何办理
一比一原版(uofo毕业证书)美国俄勒冈大学毕业证如何办理
upoux
 
Comparative analysis between traditional aquaponics and reconstructed aquapon...
Comparative analysis between traditional aquaponics and reconstructed aquapon...Comparative analysis between traditional aquaponics and reconstructed aquapon...
Comparative analysis between traditional aquaponics and reconstructed aquapon...
bijceesjournal
 
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODEL
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODELDEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODEL
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODEL
ijaia
 
Advanced control scheme of doubly fed induction generator for wind turbine us...
Advanced control scheme of doubly fed induction generator for wind turbine us...Advanced control scheme of doubly fed induction generator for wind turbine us...
Advanced control scheme of doubly fed induction generator for wind turbine us...
IJECEIAES
 
Software Engineering and Project Management - Introduction, Modeling Concepts...
Software Engineering and Project Management - Introduction, Modeling Concepts...Software Engineering and Project Management - Introduction, Modeling Concepts...
Software Engineering and Project Management - Introduction, Modeling Concepts...
Prakhyath Rai
 
4. Mosca vol I -Fisica-Tipler-5ta-Edicion-Vol-1.pdf
4. Mosca vol I -Fisica-Tipler-5ta-Edicion-Vol-1.pdf4. Mosca vol I -Fisica-Tipler-5ta-Edicion-Vol-1.pdf
4. Mosca vol I -Fisica-Tipler-5ta-Edicion-Vol-1.pdf
Gino153088
 
一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理
一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理
一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理
ecqow
 
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
Yasser Mahgoub
 
ITSM Integration with MuleSoft.pptx
ITSM  Integration with MuleSoft.pptxITSM  Integration with MuleSoft.pptx
ITSM Integration with MuleSoft.pptx
VANDANAMOHANGOUDA
 
TIME TABLE MANAGEMENT SYSTEM testing.pptx
TIME TABLE MANAGEMENT SYSTEM testing.pptxTIME TABLE MANAGEMENT SYSTEM testing.pptx
TIME TABLE MANAGEMENT SYSTEM testing.pptx
CVCSOfficial
 
SCALING OF MOS CIRCUITS m .pptx
SCALING OF MOS CIRCUITS m                 .pptxSCALING OF MOS CIRCUITS m                 .pptx
SCALING OF MOS CIRCUITS m .pptx
harshapolam10
 
原版制作(Humboldt毕业证书)柏林大学毕业证学位证一模一样
原版制作(Humboldt毕业证书)柏林大学毕业证学位证一模一样原版制作(Humboldt毕业证书)柏林大学毕业证学位证一模一样
原版制作(Humboldt毕业证书)柏林大学毕业证学位证一模一样
ydzowc
 
1FIDIC-CONSTRUCTION-CONTRACT-2ND-ED-2017-RED-BOOK.pdf
1FIDIC-CONSTRUCTION-CONTRACT-2ND-ED-2017-RED-BOOK.pdf1FIDIC-CONSTRUCTION-CONTRACT-2ND-ED-2017-RED-BOOK.pdf
1FIDIC-CONSTRUCTION-CONTRACT-2ND-ED-2017-RED-BOOK.pdf
MadhavJungKarki
 
Software Engineering and Project Management - Software Testing + Agile Method...
Software Engineering and Project Management - Software Testing + Agile Method...Software Engineering and Project Management - Software Testing + Agile Method...
Software Engineering and Project Management - Software Testing + Agile Method...
Prakhyath Rai
 
22CYT12-Unit-V-E Waste and its Management.ppt
22CYT12-Unit-V-E Waste and its Management.ppt22CYT12-Unit-V-E Waste and its Management.ppt
22CYT12-Unit-V-E Waste and its Management.ppt
KrishnaveniKrishnara1
 
Null Bangalore | Pentesters Approach to AWS IAM
Null Bangalore | Pentesters Approach to AWS IAMNull Bangalore | Pentesters Approach to AWS IAM
Null Bangalore | Pentesters Approach to AWS IAM
Divyanshu
 
An Introduction to the Compiler Designss
An Introduction to the Compiler DesignssAn Introduction to the Compiler Designss
An Introduction to the Compiler Designss
ElakkiaU
 
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...Electric vehicle and photovoltaic advanced roles in enhancing the financial p...
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...
IJECEIAES
 

Recently uploaded (20)

Data Driven Maintenance | UReason Webinar
Data Driven Maintenance | UReason WebinarData Driven Maintenance | UReason Webinar
Data Driven Maintenance | UReason Webinar
 
AI + Data Community Tour - Build the Next Generation of Apps with the Einstei...
AI + Data Community Tour - Build the Next Generation of Apps with the Einstei...AI + Data Community Tour - Build the Next Generation of Apps with the Einstei...
AI + Data Community Tour - Build the Next Generation of Apps with the Einstei...
 
一比一原版(uofo毕业证书)美国俄勒冈大学毕业证如何办理
一比一原版(uofo毕业证书)美国俄勒冈大学毕业证如何办理一比一原版(uofo毕业证书)美国俄勒冈大学毕业证如何办理
一比一原版(uofo毕业证书)美国俄勒冈大学毕业证如何办理
 
Comparative analysis between traditional aquaponics and reconstructed aquapon...
Comparative analysis between traditional aquaponics and reconstructed aquapon...Comparative analysis between traditional aquaponics and reconstructed aquapon...
Comparative analysis between traditional aquaponics and reconstructed aquapon...
 
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODEL
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODELDEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODEL
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODEL
 
Advanced control scheme of doubly fed induction generator for wind turbine us...
Advanced control scheme of doubly fed induction generator for wind turbine us...Advanced control scheme of doubly fed induction generator for wind turbine us...
Advanced control scheme of doubly fed induction generator for wind turbine us...
 
Software Engineering and Project Management - Introduction, Modeling Concepts...
Software Engineering and Project Management - Introduction, Modeling Concepts...Software Engineering and Project Management - Introduction, Modeling Concepts...
Software Engineering and Project Management - Introduction, Modeling Concepts...
 
4. Mosca vol I -Fisica-Tipler-5ta-Edicion-Vol-1.pdf
4. Mosca vol I -Fisica-Tipler-5ta-Edicion-Vol-1.pdf4. Mosca vol I -Fisica-Tipler-5ta-Edicion-Vol-1.pdf
4. Mosca vol I -Fisica-Tipler-5ta-Edicion-Vol-1.pdf
 
一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理
一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理
一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理
 
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
 
ITSM Integration with MuleSoft.pptx
ITSM  Integration with MuleSoft.pptxITSM  Integration with MuleSoft.pptx
ITSM Integration with MuleSoft.pptx
 
TIME TABLE MANAGEMENT SYSTEM testing.pptx
TIME TABLE MANAGEMENT SYSTEM testing.pptxTIME TABLE MANAGEMENT SYSTEM testing.pptx
TIME TABLE MANAGEMENT SYSTEM testing.pptx
 
SCALING OF MOS CIRCUITS m .pptx
SCALING OF MOS CIRCUITS m                 .pptxSCALING OF MOS CIRCUITS m                 .pptx
SCALING OF MOS CIRCUITS m .pptx
 
原版制作(Humboldt毕业证书)柏林大学毕业证学位证一模一样
原版制作(Humboldt毕业证书)柏林大学毕业证学位证一模一样原版制作(Humboldt毕业证书)柏林大学毕业证学位证一模一样
原版制作(Humboldt毕业证书)柏林大学毕业证学位证一模一样
 
1FIDIC-CONSTRUCTION-CONTRACT-2ND-ED-2017-RED-BOOK.pdf
1FIDIC-CONSTRUCTION-CONTRACT-2ND-ED-2017-RED-BOOK.pdf1FIDIC-CONSTRUCTION-CONTRACT-2ND-ED-2017-RED-BOOK.pdf
1FIDIC-CONSTRUCTION-CONTRACT-2ND-ED-2017-RED-BOOK.pdf
 
Software Engineering and Project Management - Software Testing + Agile Method...
Software Engineering and Project Management - Software Testing + Agile Method...Software Engineering and Project Management - Software Testing + Agile Method...
Software Engineering and Project Management - Software Testing + Agile Method...
 
22CYT12-Unit-V-E Waste and its Management.ppt
22CYT12-Unit-V-E Waste and its Management.ppt22CYT12-Unit-V-E Waste and its Management.ppt
22CYT12-Unit-V-E Waste and its Management.ppt
 
Null Bangalore | Pentesters Approach to AWS IAM
Null Bangalore | Pentesters Approach to AWS IAMNull Bangalore | Pentesters Approach to AWS IAM
Null Bangalore | Pentesters Approach to AWS IAM
 
An Introduction to the Compiler Designss
An Introduction to the Compiler DesignssAn Introduction to the Compiler Designss
An Introduction to the Compiler Designss
 
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...Electric vehicle and photovoltaic advanced roles in enhancing the financial p...
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...
 

OR II.ppt

  • 1. 1 Slide © 2005 Thomson/South-Western Lesson 10 Multicriteria Decisions within LP Framework  Goal Programming  Goal Programming: Formulation and Graphical Solution  Scoring Model for Job Selection
  • 2. 2 Slide © 2005 Thomson/South-Western Goal Programming  Goal programming may be used to solve linear programs with multiple objectives, with each objective viewed as a "goal".  In goal programming, di + and di - , deviation variables, are the 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.
  • 3. 3 Slide © 2005 Thomson/South-Western Goal Programming  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.  For each priority level, the objective function is to minimize the (weighted) sum of the goal deviations.  Previous "optimal" achievements of goals are added to the constraint set so that they are not degraded while trying to achieve lesser priority goals.
  • 4. 4 Slide © 2005 Thomson/South-Western Goal Programming Formulation Step 1: Decide the priority level of each goal. Step 2: Decide the weight on each goal. If a priority level has more than one goal, for each goal i decide the weight, wi , to be placed on the deviation(s), di + and/or di -, from the goal.
  • 5. 5 Slide © 2005 Thomson/South-Western Goal Programming Formulation Step 3: Set up the initial linear program. Min w1d1 + + w2d2 - s.t. Functional Constraints, and Goal Constraints Step 4: Solve the current linear program. If there is a lower priority level, go to step 5. Otherwise, a final solution has been reached.
  • 6. 6 Slide © 2005 Thomson/South-Western Goal Programming Formulation Step 5: Set up the new linear program. Consider the next-lower priority level goals and formulate a new objective function based on these goals. Add a constraint requiring the achievement of the next-higher priority level goals to be maintained. The new linear program might be: Min w3d3 + + w4d4 - s.t. Functional Constraints, Goal Constraints, and w1d1 + + w2d2 - = k Go to step 4. (Repeat steps 4 and 5 until all priority levels have been examined.)
  • 7. 7 Slide © 2005 Thomson/South-Western Example: Conceptual Products Conceptual Products is a computer company that produces the CP400 and CP500 computers. The computers use different mother boards produced in abundant supply by the company, but use the same cases and disk drives. The CP400 models use two floppy disk drives and no zip disk drives whereas the CP500 models use one floppy disk drive and one zip disk drive.
  • 8. 8 Slide © 2005 Thomson/South-Western Example: Conceptual Products Conceptual Products is a computer company that produces the CP400 and CP500 computers. Many of the components used in the two computer models are produced in abundant supply by the company. However, the memory modules, external hard drives, and cases are bought from suppliers. The CP400 model uses two memory modules and no external hard drive, whereas the CP500 uses one memory module and one external hard drive. Both models use one case.
  • 9. 9 Slide © 2005 Thomson/South-Western Example: Conceptual Products Suppliers can provide Conceptual Products with 1000 memory modules, 500 external hard drives, and 600 cases on a weekly basis. It takes one hour to manufacture a CP400 and its profit is $200 and it takes one and one-half hours to manufacture a CP500 and its profit is $500.
  • 10. 10 Slide © 2005 Thomson/South-Western Example: Conceptual Products The company has four goals: Priority 1: Meet a state contract of 200 CP400 machines weekly. (Goal 1) Priority 2: Make at least 500 total computers weekly. (Goal 2) Priority 3: Make at least $250,000 weekly. (Goal 3) Priority 4: Use no more than 400 man-hours per week. (Goal 4)
  • 11. 11 Slide © 2005 Thomson/South-Western  Variables x1 = number of CP400 computers produced weekly x2 = number of CP500 computers produced weekly di - = amount the right hand side of goal i is deficient di + = amount the right hand side of goal i is exceeded  Functional Constraints Availability of memory modules: 2x1 + x2 < 1000 Availability of external hard drives: x2 < 500 Availability of cases: x1 + x2 < 600 Goal Programming: Formulation
  • 12. 12 Slide © 2005 Thomson/South-Western  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 Goal Programming: Formulation
  • 13. 13 Slide © 2005 Thomson/South-Western  Objective Functions Priority 1: Minimize the amount the state contract is not met: Min d1 - Priority 2: Minimize the number under 500 computers produced weekly: Min d2 - Priority 3: Minimize the amount under $250,000 earned weekly: Min d3 - Priority 4: Minimize the man-hours over 400 used weekly: Min d4 + Goal Programming: Formulation
  • 14. 14 Slide © 2005 Thomson/South-Western  Formulation Summary Min P1(d1 -) + P2(d2 -) + P3(d3 -) + P4(d4 +) s.t. 2x1 +x2 < 1000 +x2 < 500 x1 +x2 < 600 x1 +d1 - -d1 + = 200 x1 +x2 +d2 - -d2 + = 500 .2x1+ .5x2 +d3 - -d3 + = 250 x1+1.5x2 +d4 - -d4 + = 400 x1, x2, d1 -, d1 +, d2 -, d2 +, d3 -, d3 +, d4 -, d4 + > 0 Goal Programming: Formulation
  • 15. 15 Slide © 2005 Thomson/South-Western  Iteration 1 To solve graphically, first graph the functional constraints. Then graph the first goal: x1 = 200. Note on the next slide that there is a set of points that exceed x1 = 200 (where d1 - = 0). Goal Programming: Graphical Solution
  • 16. 16 Slide © 2005 Thomson/South-Western  Functional Constraints and Goal 1 Graphed 2x1 + x2 < 1000 Goal 1: x1 > 200 x1 + x2 < 600 x2 < 500 Points Satisfying Goal 1 x1 x2 Goal Programming: Graphical Solution 1000 800 600 400 200 200 400 600 800 1000 1200
  • 17. 17 Slide © 2005 Thomson/South-Western  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 (where d2 - = 0). Goal Programming: Graphical Solution
  • 18. 18 Slide © 2005 Thomson/South-Western  Goal 1 (Constraint) and Goal 2 Graphed 2x1 + x2 < 1000 Goal 1: x1 > 200 x1 + x2 < 600 x2 < 500 Points Satisfying Both Goals 1 and 2 x1 x2 Goal 2: x1 + x2 > 500 Goal Programming: Graphical Solution 200 400 600 800 1000 1200 1000 800 600 400 200
  • 19. 19 Slide © 2005 Thomson/South-Western  Iteration 3 Now 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. Goal Programming: Graphical Solution
  • 20. 20 Slide © 2005 Thomson/South-Western  Goal 2 (Constraint) and Goal 3 Graphed 2x1 + x2 < 1000 Goal 1: x1 > 200 x1 + x2 < 600 x2 < 500 Points Satisfying Both Goals 1 and 2 x1 x2 Goal 2: x1 + x2 > 500 Goal 3: .2x1 + .5x2 = 250 (200,400) Goal Programming: Graphical Solution 200 400 600 800 1000 1200 1000 800 600 400 200
  • 21. 21 Slide © 2005 Thomson/South-Western Scoring Model for Job Selection A graduating college student with a double major in Finance and Accounting has received the following three job offers: •financial analyst for an investment firm in Chicago •accountant for a manufacturing firm in Denver •auditor for a CPA firm in Houston
  • 22. 22 Slide © 2005 Thomson/South-Western Scoring Model for Job Selection  The student made the following comments: •“The financial analyst position provides the best opportunity for my long-run career advancement.” •“I would prefer living in Denver rather than in Chicago or Houston.” •“I like the management style and philosophy at the Houston CPA firm the best.”  Clearly, this is a multicriteria decision.
  • 23. 23 Slide © 2005 Thomson/South-Western Scoring Model for Job Selection  Considering only the long-run career advancement criterion: •The financial analyst position in Chicago is the best decision alternative.  Considering only the location criterion: •The accountant position in Denver is the best decision alternative.  Considering only the style criterion: •The auditor position in Houston is the best alternative.
  • 24. 24 Slide © 2005 Thomson/South-Western Steps Required to Develop a Scoring Model  Step 1: List the decision-making criteria.  Step 2: Assign a weight to each criterion.  Step 3: Rate how well each decision alternative satisfies each criterion.  Step 4: Compute the score for each decision alternative.  Step 5: Order the decision alternatives from highest score to lowest score. The alternative with the highest score is the recommended alternative.
  • 25. 25 Slide © 2005 Thomson/South-Western  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
  • 26. 26 Slide © 2005 Thomson/South-Western Scoring Model: Step 1  List of Criteria •Career advancement •Location •Management •Salary •Prestige •Job Security •Enjoyable work
  • 27. 27 Slide © 2005 Thomson/South-Western Scoring Model: Step 2  Five-Point Scale Chosen Importance Weight Very unimportant 1 Somewhat unimportant 2 Average importance 3 Somewhat important 4 Very important 5
  • 28. 28 Slide © 2005 Thomson/South-Western Scoring Model: Step 2  Assigning a Weight to Each Criterion Criterion Importance Weight Career advancement Very important 5 Location Average importance 3 Management Somewhat important 4 Salary Average importance 3 Prestige Somewhat unimportant 2 Job security Somewhat important 4 Enjoyable work Very important 5
  • 29. 29 Slide © 2005 Thomson/South-Western  Nine-Point Scale Chosen Level of Satisfaction Rating Extremely low 1 Very low 2 Low 3 Slightly low 4 Average 5 Slightly high 6 High 7 Very high 8 Extremely high 9 Scoring Model: Step 3
  • 30. 30 Slide © 2005 Thomson/South-Western  Rate how well each decision alternative satisfies each criterion. Decision Alternative Analyst Accountant Auditor Criterion Chicago Denver Houston Career advancement 8 6 4 Location 3 8 7 Management 5 6 9 Salary 6 7 5 Prestige 7 5 4 Job security 4 7 6 Enjoyable work 8 6 5 Scoring Model: Step 3
  • 31. 31 Slide © 2005 Thomson/South-Western  Compute the score for each decision alternative. Decision Alternative 1 - Analyst in Chicago Criterion Weight (wi ) Rating (ri1) wiri1 Career advancement 5 x 8 = 40 Location 3 3 9 Management 4 5 20 Salary 3 6 18 Prestige 2 7 14 Job security 4 4 16 Enjoyable work 5 8 40 Score 157 Scoring Model: Step 4
  • 32. 32 Slide © 2005 Thomson/South-Western  Compute the score for each decision alternative. S1 = 5(8)+3(3)+4(5)+3(6)+2(7)+4(4)+5(8) = 157 S2 = 5(6)+3(8)+4(6)+3(7)+2(5)+4(7)+5(6) = 167 S3 = 5(4)+3(7)+4(9)+3(5)+2(4)+4(6)+5(5) = 149   j i ij i s w r Scoring Model: Step 4
  • 33. 33 Slide © 2005 Thomson/South-Western  Compute the score for each decision alternative. Decision Alternative Analyst Accountant Auditor Criterion Chicago Denver Houston Career advancement 40 30 20 Location 9 24 21 Management 20 24 36 Salary 18 21 15 Prestige 14 10 8 Job security 16 28 24 Enjoyable work 40 30 25 Score 157 167 149 Scoring Model: Step 4
  • 34. 34 Slide © 2005 Thomson/South-Western  Order the decision alternatives from highest score to lowest score. The alternative with the highest score is the recommended alternative. •The accountant position in Denver has the highest score and is the recommended decision alternative. •Note that the analyst position in Chicago ranks first in 4 of 7 criteria compared to only 2 of 7 for the accountant position in Denver. •But when the weights of the criteria are considered, the Denver position is superior to the Chicago job. Scoring Model: Step 5
  • 35. 35 Slide © 2005 Thomson/South-Western Scoring Model for Job Selection  Partial Spreadsheet Showing Steps 1 - 3 A B C D E 1 RATINGS 2 Analyst Accountant Auditor 3 Criteria Weight Chicago Denver Houston 4 Career Advance. 5 8 6 4 5 Location 3 3 8 7 6 Management 4 5 6 9 7 Salary 3 6 7 5 8 Prestige 2 7 5 4 9 Job Security 4 4 7 6 10 Enjoyable Work 5 8 6 5
  • 36. 36 Slide © 2005 Thomson/South-Western Scoring Model for Job Selection  Partial Spreadsheet Showing Formulas of Step 4 A B C D E 12 SCORING CALCULATIONS 13 Analyst Accountant Auditor 14 Criteria Chicago Denver Houston 15 Career Advance. =B4*C4 =B4*D4 =B4*E4 16 Location =B5*C5 =B5*D5 =B5*E5 17 Management =B6*C6 =B6*D6 =B6*E6 18 Salary =B7*C7 =B7*D7 =B7*E7 19 Prestige =B8*C8 =B8*D8 =B8*E8 20 Job Security =B9*C9 =B9*D9 =B9*E9 21 Enjoyable Work =B10*C10 =B10*D10 =B10*E10 22 Score =sum(C16:C22) =sum(D16:D22) =sum(E16:E22)
  • 37. 37 Slide © 2005 Thomson/South-Western Scoring Model for Job Selection  Partial Spreadsheet Showing Results of Step 4 A B C D E 12 SCORING CALCULATIONS 13 Analyst Accountant Auditor 14 Criteria Chicago Denver Houston 15 Career Advance. 40 30 20 16 Location 9 24 21 17 Management 20 24 36 18 Salary 18 21 15 19 Prestige 14 10 8 20 Job Security 16 28 24 21 Enjoyable Work 40 30 25 22 Score 157 167 149