You are on page 1of 10

MULTIPLE GOAL PROGRAMMING

(NON-PRE-EMPTIVE)
GROUP 9

PREMLATAH A/P PERUMAL (M20152001647)


MOHANAH A/P JAYAKUMARAN (M20152001592)
KOGILAVANI A/P MUNIANDY (M20152001443)
Goal programming: a way of solving multi-objective
problems

Categorization of Goal Programming


1) Nonpreemptive goal programming
O Goals with roughly same importance
O Assign weights to goals
O Construct a single objective function to minimize the
weighted sum of deviations from goals
2) Preemptive goal programming
O Hierarchy of priority levels for goals
O 1st priority is to satisfy goal 1
O 2nd priority is to satisfy goal 2, etc.
O Solve sequentially
FORMULATION OF GOAL
PROGRAMMING PROBLEMS
Deviations: the amount away from the desired standards or objectives:
+
– Overachievement (𝑑 𝑖 ≥ 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“
Dewright Company Example –
Nonpreemptive Goal Programming
O The Dewright Company is considering three new products to replace
current models that are being discontinued, so their OR department
has been assigned the task of determining which mix of these
products should be produced. Management wants primary
consideration given to three factors: long-run profit, stability in the
workforce, and the level of capital investment that would be required
now for new equipment. In particular, management has established
the goals of (1) achieving a long-run profit of at least $125 million
from these products, (2) maintaining the current employment level of
4000 employees, and (3) holding the capital investment to less than
$55 million. However, management realizes that it probably will not
be possible to attain all these goals simultaneously, so it has
discussed priorities with the OR department. This discussion has led
to setting penalty weights of 5 for missing the profit goal (per $1
million under), 2 for going over the employment goal (per 100
employees), 4 for going under this same goal, and 3 for exceeding the
capital investment goal (per $1 million over). Each new Line product’s
contribution to profit, employment level, and capital investmentar level is
Goal
proportional to the rate of production. These contributions Progrper unit
rate of production are shown in the following table, alongammiwith the
goals and penalty weights. ng-4
Dewright Company Example
Unit Contribution

Product

Factor 1 2 3 Goal (Units) Penalty


Weight
Long-run profit 12 9 15 ≥ 125 (millions of dollars) 5

Employment level 5 3 4 = 40 (hundreds of employees) 2(+), 4(-)

Capital 5 7 8 ≤ 55 (millions of dollars) 3


investment Line
ar
Goal
Progr
ammi
ng-5
Steps
O Step 1 : Decision variables
O Step 2 : Set the goals
O Step 3 : Objective function
O Step 4 : Put into a proper LP form
O Step 5 : Final LP for non-preemptive
goal programming
O Step 6 : Find the optimal solution
O Step 1 : Decision variables
x1: production rate of product 1
x2: production rate of product 2
x3: production rate of product 3

O Step 2 : Set the goals


Profit goal: 12 x1 + 9 x2 + 15 x3 ≥ 125 (lower one-sided goal)
Employment goal: 5 x1 + 3 x2 + 4 x3 = 40 (two-sided goal)
Investment goal: 5 x1 + 7 x2 + 8 x3 ≤ 55 (upper one-sided goal)

O Step 3 : Objective function:


Min Z = 5(12 x1 + 9 x2 + 15 x3 – 125)-
+ 2(5 x1 + 3 x2 + 4 x3 – 40)+
+ 4(5 x1 + 3 x2 + 4 x3 – 40)-
+ 3(5 x1 + 7 x2 + 8 x3 – 55)+
where
x if x ≥ 0 0 if x > 0
x+ = x- = Line
0 if x < 0 - x = |x| if x ≤ 0 ar
Goal
Progr
ammi
ng-7
O Step 4 : Put into a proper LP form

Let y1 = 12 x1 + 9 x2 + 15 x3 – 125
y2 = 5 x1 + 3 x2 + 4 x3 – 40
y3 = 5 x1 + 7 x2 + 8 x3 – 55
and y1 = y1+ - y1- and y1+ ≥ 0, y1- ≥ 0
y2 = y2+ - y2- and y2+ ≥ 0, y2- ≥ 0
y3 = y3+ - y3- and y3+ ≥ 0, y3- ≥ 0

Line
ar
Goal
Progr
ammi
ng-8
O Step 5 : Final LP for nonpreemptive goal programming:
Min Z = 5 y1- + 2 y2+ + 4 y2- + 3 y3+
subject to
12 x1 + 9 x2 + 15 x3 – (y1+ - y1- ) = 125
5 x1 + 3 x2 + 4 x3 – (y2+ - y2- ) = 40
5 x1 + 7 x2 + 8 x3 – (y3+ - y3- ) = 55
xi, yi+, yi- ≥ 0 i=1,2,3

add any other functional constraints too

Line
ar
Goal
Progr
ammi
ng-9
O Step 6 : Find the optimal solution:
x1 = 25/3
x2 = 0
x3 = 5/3
y1+ = y1- = 0 → y1 = 0 → 1st goal is satisfied
y2+ = 25/3, y2- = 0 → y2 = 25/3 → 2nd goal exceeds
employment level by
25/3 hundred
employees
y3+ = y3- = 0 → y3 = 0 → 3rd goal is satisfied
Line
ar
Goal
Progr
ammi
ng-10

You might also like