Scribd
Upload
228 views

Goal Programming

Goal Programming has been first discussed by Charles and Cooper in their research work A lot of research has taken place since the evolution of goal programming. It is used as a tool by operations researchers for finding optimal conditions for their problems . Goal Programming is divided to two types as shown in the document.

Uploaded by

Aashrith Parvathaneni
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
228 views

Goal Programming

Goal Programming has been first discussed by Charles and Cooper in their research work A lot of research has taken place since the evolution of goal programming. It is used as a tool by operations researchers for finding optimal conditions for their problems . Goal Programming is divided to two types as shown in the document.

Uploaded by

Aashrith Parvathaneni
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 12

Goal Programming

How do you find optimal solutions to the following?


Multiple criterion for measuring performance (car with low
cost, good gas mileage, stylish, etc.. / attend school with
good reputation, low tuition, close to home, right program)
Multiple objectives / goals
(e.g. Minimize service cost, maximize customer satisfaction)
Answer: Use Goal Programming

Goal Programming Example


Problem
You work for an Advertising agency. A customer has identified
three primary target audiences they are trying to reach, and has an
Advertising budget of $600,000. They have expressed their targets
in the form of three goals:
Goal 1 Ads should be seen by at least 40 million high-income men (HIM)
Goal 2 Ads should be seen by at least 60 million low-income people (LIP)
Goal 3 Ads should be seen by at least 35 million high-income women (HIW)
You recognize that advertising during football games and soap operas will
cover the target audience. The table below indicates the number of viewers
from the different categories that will be viewing these types of programming.
HIM
Football ad (per min.) 7 million
Soap Opera ad (/min) 3 million

LIP
10 million
5 million

HIW
5 million
4 million

Cost
$100,000
$60,000

Goal Programming Example


Problem
Expressing the goals as an equation.
Let: x1 minutes of football ad
x2 minutes of soap opera ad
Goal 1 - HIM) 7 x1 + 3 x2 > 40
Goal 2 - LIP) 10 x1 + 5 x2 > 60
Goal 3 - HIW) 5 x1 + 4 x2 > 35
Ad Budget) 100 x1 + 60 x2 < 600

Goal Programming Example


Problem
Formulating the problem as an LP:
Graphing the feasible region

Min (or Max) Z = something


s.t.
HIM) 7 x1 + 3 x2 > 40
LIP) 10 x1 + 5 x2 > 60
HIW) 5 x1 + 4 x2 > 35
Ad Bud.) 100 x1 + 60 x2 < 600
x1 , x2 > 0
Which constraints are real constraints versus desired constraints?
Which constraints are hard constraints versus soft constraints?

Goal Programming Example


Problem
Since the first three constraints are really goals, and not hard
constraints, express these constraints in terms of deviational
variables.
HIM) 7 x1 + 3 x2 + d1- - d1+
= 40
LIP) 10 x1 + 5 x2 +
d2- - d2+
= 60
HIW) 5 x1 + 4 x2 +
d3- - d3+ = 35
d1- , d1+ , d2- , d2+ , d3- , d3+ > 0
Suppose each shortfall 0f 1,000,000 viewers from the goal
translates to a cost of $200,000 for HIM, $100,000 for LIP
and $50,000 for HIW. Then the objective function would be:

Goal Programming Example


Problem
Then in order to minimize the penalty for not reaching the
viewing audience goal can be expressed as the following LP:
Min
Z = 200 d1- + 100 d2- + 50 d3s.t.
HIM)
7 x1 + 3 x2 + d1- - d1+
= 40
LIP)
10 x1 + 5 x2 +
d2- - d2+
= 60
HIW)
5 x 1 + 4 x2 +
d3- - d3+ = 35
Ad Bud.) 100 x1 + 60 x2
< 600
x1, x2, d1- , d1+ , d2- , d2+ , d3- , d3+ > 0
The optimal solution to the above LP is:
Z = 250, x1 = 6, x2 = 0, d1+ = 0 , d1- = 0 , d2+ = 0, d2- = 0 ,

Goal Programming: Weighted -vsPreemptive Goals


In the advertising example, the goals could readily be weighted
by relative importance using the cost penalties ($200,000 for
HIM, $100,000 for LIP and $50,000 for HIW).
In many cases, the relative weighting of a goal is not easily
determined, however the goals can be ranked from most
important to least important. In this case, the most important
goal pre-empts all the other goals. Once the most important
goal is met, the second goal is addressed, and so on.

Goal Programming: Preemptive


Goals
Suppose the HIM constraint must be met first, followed by
LIP and then HIW.
First rewrite the LP as the following:
Min
Z = d 1s.t.
HIM)
7 x1 + 3 x2 + d1- - d1+
= 40
LIP)
10 x1 + 5 x2 +
d 2 - - d2 +
= 60
HIW)
5 x1 + 4 x2 +
d3- - d3+ = 35
Ad Bud.) 100 x1 + 60 x2
< 600
x1, x2, d1- , d1+ , d2- , d2+ , d3- , d3+ > 0
-

Goal Programming: Preemptive


Goals
Since goal HIM is met, now make goal HIM a fixed
constraint while trying to satisfy goal LIP.
Min
Z = d 2s.t.
HIM)
7 x1 + 3 x2 + d1- - d1+
= 40
LIP)
10 x1 + 5 x2 +
d 2 - - d2 +
= 60
HIW)
5 x1 + 4 x2 +
d3- - d3+ = 35
Ad Bud.) 100 x1 + 60 x2
< 600
d1=0
x1, x2, d1- , d1+ , d2- , d2+ , d3- , d3+ > 0

Goal Programming: Preemptive


Goals
Since both goal HIM and LIP are met, make goal HIM and
LIP fixed constraints while trying to satisfy goal HIW.
Min
Z = d 3s.t.
HIM)
7 x1 + 3 x2 + d1- - d1+
= 40
LIP)
10 x1 + 5 x2 +
d 2 - - d2 +
= 60
HIW)
5 x1 + 4 x2 +
d3- - d3+ = 35
Ad Bud.) 100 x1 + 60 x2
< 600
d1= 0
d2= 0
x1, x2, d1- , d1+ , d2- , d2+ , d3- , d3+ > 0

Goal Programming: Additional


Example
A company has two machines for manufacturing a product.
Machine 1 make two units per hour, while machine 2 makes
three units per hour. The company has an order of 80 units.
Energy restrictions dictate that only one machine can operate
at one time. The company has 40 hours of regular machining
time, but overtime is available. It costs $4.00 to run machine
1 for one hour, while machine 2 costs $5.00 per hour. The
company has the following goals:
1) Meet the demand of 80 units exactly.
2) Limit machine overtime to 10 hours.
3) Use the 40 hours of normal machining time.
4) Minimize costs.

Goal Programming: Preemptive


Goals
Letting Pi represent the relative weighting of each goal, the
example can be formulated as the following LP:
Min

Z = P1(d1- + d1+) + P2 d3+ + P3(d2- + d2+) +P14d4+

s.t.
2 x1 + 3 x2 + d1- - d1+
= 80
x1 + x2 +
d 2 - - d2 +
= 40
d2+ + d3- - d3+
= 10
4 x1 + 5 x2 +
d 4 - - d4 + = 0
x1, x2, d1- , d1+ , d2- , d2+ , d3- , d3+ , d4- , d4+ > 0

You might also like