Goal+Programming
Goal+Programming
(Multi-criteria Mathematical
Programming)
Goal Programming 2
Introduction
Whereas linear programming identifies from the set
of feasible solutions the point that optimizes a single
objective, goal programming identifies the point that
best satisfies either the single goal or set of goals in
the problem.
With multiple goals, all goals usually cannot be
realized exactly. Goal programming attempts to
minimize the deviations from these goals with
consideration given to the hierarchy of stated
priorities.
Goal Programming 3
A Media-Mix, Single Goal
Example
The problem is one of determining how much
money to allocate for television and radio
advertisements.
Rated exposures per $1000 of advertising
expenditure are 10,000 and 7,500
respectively, for television and radio.
The advertising budget for the next campaign
is $100,000 and no more than 70% of the
budget can be expended on television
Goal Programming 4
Media-Mix Example cont…
Goal Programming 6
Media-Mix Example ― A Goal
Programming Approach
The GP formulation of the same problem is
Minimize
z = 0x1 + 0x2 + d- + d+
or more simply
z = d- + d+
subject to
(Goal constraint) 10,000 x1 + 7,500 x2 + d- + d+ = 1,000,000
(System constraint) x1 + x2 ≤ 100
(System constraint) x1 ≤ 70
x 1 , x 2 , d- , d+ ≥ 0
Goal Programming 7
Characteristics of GP Models
Goal Programming 9
Media-Mix Example, Multiple
Goals
Assume that management has agreed that the campaign
cannot be judged successful if total exposures are under
750,000. The campaign would be viewed superbly successful if
1 million exposures occurred. Management has rank ordered
four goals it wishes to achieve, arranged from highest to lowest
priority:
1. Minimize the underachievement of the exposure goal of
750,000 exposures.
2. Avoid expenditures of more than $100,000.
3. Avoid expenditures of more than $70,000 for television
advertisements.
4. Minimize the underachievement of the goal of 1 million
exposures.
Goal Programming 10
GP Formulation of the
Problem
Minimize z P1 d1 P2 d 2 P3 d 3 P4 d 4
subject to
Total exposure goal 10,000 x1 7,500 x2 d1 d1 750,000
Total budget goal x1 x2 d 2 d 2 100
TV budget goal x1 d 3 d 3 70
Total exposure goal 10,000 x1 7,500 x2 d 4 d 4 1,000,000
Goal Programming 11
Goal Programming
Algorithms
There are two methods, in general:
1. Weights Method: In this method the single
objective function is the weighted sum of the
functions representing the goals of the problem.
2. Preemptive Method: This starts by prioritizing the
goals in order of importance. The model is then
optimized using one goal at a time such that the
optimum value of a higher priority goal is never
degraded by a lower priority goal.
Goal Programming 12
Priority Factors
When a GP problem contains multiple goals that
have been rank ordered, deviational variables are
implicitly weighted in the objective function by
ordinal priority factors, Pk, where P1 represents the
highest priority, P2 the second highest priority, and
so forth.
Intuitively one might think of the priority factors as
penalties or costs for having deviated from the
stated goals. The greatest penalty (P1) is assigned
for any deviation from the highest priority goal.
Goal Programming 13
Media-Mix, Differential
Weights
Assume that the two most important audiences for the
company are persons 18 to 21 years of age and persons
25 to 30 years of age. The table below presents estimates
of the numbers of individuals in the two age groups
expected to be exposed to advertisements per $1,000 of
expenditure.
Goal Programming 14
Additional (Preferential)
Goals
Management has established a goal of
reaching at least 250,000 persons in each of
the two age groups and ranks the
achievement of these targets as the fifth
most important goal.
In addition, management realizes and wishes
to account for the fact that the purchasing
power of the 25- to- 30 age group is twice the
purchasing power of the 18- to- 21 age
group.
Goal Programming 15