Suncoast Office, A Goal Programming Problem, Solution, Analysis, Sensitivity Analysis, and Report
Suncoast Office, A Goal Programming Problem, Solution, Analysis, Sensitivity Analysis, and Report
+
+ =
=
+ =
S P S P Z
S P Z
S P S P Z
Input to WinS! soft"are:
.
Output from WinS!:
&
Summary of solution:
B+ 5 (<), B( 5 /)
D+ 5 ), D( 5 ), D. 5 /)
Analysis of output:
B+ 5 (<) EEE It means that we will contact (<) pre*ious customers# ,hat is the
minimum o ()) pre*ious customers is ulilled and e%ceeded by <), which is
desirable# It results in S
0
& 5 )#
B( 5 /) EEE It means that we will contact /) new customers# ,hat is the
minimum o +() new customers is not ulilled and it is behind by /), which is
not desirable# It resulted in S
0
< 5 /)# :ecause o this *alue we ended up ha*ing
D. 5 /)#
D+ 5 ) EEE ,his is related to total time and indicates there is no undesirable
situation# Plug in the *alues o B+ and B( into the time constraint we will ha*e:
(B+ 8 .B( 5 (3(<)4 8 .3/)4 5 /9)# ,his results in using all &) hours o possible
o*ertime, which is no problem# As well as being abo*e under utili1ation, this is
no problem either#
D( 5 ) EEE ,his is related to total sales and indicates there is no undesirable
situation# Plug in the *alues o B+ and B( into sales constraint we will ha*e:
(<)B+ 8 +(<B( 5 (<)3(<)4 8 +(<3/)4 5 =))))#
Report
:ased on the gi*en inormation we need to contact (<) pre*ious customers and /) new
customers# It will result in total sales o ;=),)))# We need /9) hours o agents, this
mean we will use &) hours o o*ertime#
<
Sensitivity analysis
Input for reordered goals scenario #:
Partial output for reordered goals scenario #:
/
Input for reordered goals scenario $:
Partial output for reordered goals scenario $:
=
Sensitivity Analysis Summary for a Goal Programming Problem
3Aetails are in ile called Suncoast F%ample on >oal Programming Sensiti*ity Analysis
on ?lass -otes web page%4
# Priorities # # !ptimal Solution #
Second Ae*iation
6ighest 6ighest Gowest B+ B( D+ D( D. #
S#&, S$' S(' S)', S*' $*+ ,+ + + ,+
S(' S#&, S$' S)', S*' $*+ ,+ + + ,+
S)', S*' S#&, S$' S(' $++ #$+ + -+ *+++
Prepared: April ())<, updated September ())H
9