Goal Programming 1
Goal Programming 1
Formulation of GP Problems
Deviations: the amount away from the desired standards or objectives:
Overachievement (d+i 0) vs. Underachievement (d-i 0)
Desirable vs. Undesirable Deviations: (depend on the objectives)
Max goals () - the more the better - d+i desirable.
Min goals () - the less the better - d-i desirable.
Exact goals (=) - exactly equal - both d+i and d-i undesirable
In GP, the objective is to minimize the (weighted) sum of
undesirable deviations (all undesirable d+i and d-i 0 ).
For each goal, at least, one of d+i and d-i must be equal to "0"
Formulation of GP Problems
Goals are prioritized in some sense, and their level of aspiration
is stated.
An optimal solution is attained when all the goals are reached as
close as possible to their aspiration level, while satisfying a set
of constraints.
There are two types of goal programming models:
Nonpreemptive goal programming - no goal is pre-determined to
dominate any other goal.
Preemptive goal programming - goals are assigned different priority
levels. Level 1 goal dominates level 2 goal, and so on.
Goals
Cost
Cost per
per Ad
Ad Customers
Customers
Television
3000
1000
Television
3000
1000
Radio
800
500
Radio
800
500
Newspaper
250
200
Newspaper
250
200
An Advertisement Example
LP Model:
3000X1 + 800X2 + 250X3 25,000
1000X1 + 500X2 + 200X3 30,000
X1
10
An Advertisement Example
Detrimental variables
Ui = the amount by which the left hand side falls short
of (under) its right hand side value.
Ei = the amount by which the left hand side exceeds its
right hand side value.
An Advertisement Example
The objective is to minimize the penalty of not meeting the
goals, represented by the detrimental variables
E1 U2 U3
25,000
30,000
10
An Advertisement Example
The penalties are estimated to be as follows:
Each extra dollar spent on advertisement above $25,000
cost the company $1.
There is a loss of $5 to the company for each customer not
being reached, below the goal of 30,000.
Each television spot below 10 is worth 100 times each
dollar over budget.
An Advertisement Example
The goal programming model
It is assumed that no advantage is gained by overachieving a
goal.
Minimize 1E1 + 5U2 + 100U3
s.t.
3000X1 + 800X2 + 250X3 + U1 E1 = 25,000
1000X1 + 500X2 + 200X3 + U2 E2 = 30,000
X1
+ U3 E3 = 10
All variables are non-negative.
Goals:
Goal 1: Produce at least 200 CP400 computers
each week.
Goal 2: Produce at least 500 total computers each
week.
Goal 3: Reach at least $250 (in thousands) on
profit.
Goal 4: Consume no more than 400 total manhours each week.