Goal Programming Group4 Amat112b
Goal Programming Group4 Amat112b
Goal Programming Group4 Amat112b
DECISION MAKING
-A GOAL PROGRAMMING APPROACH
Group 4
Aspi, Maria Mercedes
Barillo, Bernadette Joyce
Billones, Jesica
Dela Cruz, Mark Allan
Realizo, Regina Marie
Objectives
Define goal programming
Compare goal programming with linear
programming
Give an example of goal programming
Explain an application of goal programming
in insurance
Goal Programming
-an extension of linear programming, is a branch of multiobjective optimization, in which it deals with maximizing or
minimizing multiple objective functions subject to a set of
constraints.
Goal Programming
Linear Programming
Multiple Goals
One Goal
are both are formulated under the requirements and assumptions of linear
programming which are linearity, non-negativity, and certainty.
It also uses graphical methods to illustrate linear programming concepts.
Definition of Terms:
Deviation Variables are variables that show
whether the goals are attained or otherwise.
oPositive Deviation Variables
oNegative Deviation Variables
Example:
10 L+ 15 E+ Y1- Y1+= 40
Goal Function
Example:
100 L+ 100 E+ Y2 Y2+= 1000
Achievement Function
Example:
Minimize
A = P1d1-+ P2d2-+ P3d3-+P2d4-+ P3d5-+ P4d6-+ P4d7-+
P5d4++ P6d6+ + P6d7
Example
A small paint company manufactures two types of paint,
latex and enamel. In production, the company uses 10 hours
of labor to produce 100 gallons of latex and 15 hours of
labor to produce 100 gallons of enamel. The company has
40 hours of daily labor and 30 hours of overtime labour
available each week. Furthermore, if enamel paint is
produced, latex paint must also be produced. Each paint
generates a profit at the rate of $1.00 per gallon.
Enamel
10
15
$1
$1
Let
L = no. of 100 gallons of latex paint produced per week
E = no. of 100 gallons of enamel paint produced per week
Functional Constraints:
10 L + 15 E 70
LE 0 because, L E
Minimize
+
Z =P1Y1 + P2Y2 + P3Y3
s.t.
10 L + 15 E 70
L E 0
(Labour)
(Production)
(Overtime)
(Profit)
(Profit)
PROJECT SELECTION
DECISION MAKING
-A GOAL PROGRAMMING APPROACH
V. Subbaiah, G. Ravindra Babu & S. D. Sahrma
Pacific-Asian Journal of Mathematics, Volume 5, No. 2, July-December 2011
Capital Budgeting
is a method for evaluating, comparing, and
selecting projects to achieve the best long-term
financial return of companies or businesses.
The data specifies for consideration nine mutually exclusive projects with given present
values of outlays for periods I&II and given present values of investment proposals of
large-scale industry in Hyderabad.
Objective Function
Minimize
A = P1d1 + P d + P3d3 +P d + P d +
-
2 2
2 4
3 5
+
6 6
REFERENCES:
Hoisen, A. (2005). Two Variable Goal Programming Model with Priorities. Retrieved
from http://prejudice.tripod.com/ME30B/two_gp.htm
Kumar, A. (2015). Goal programming approach for the study of industrial problems,
(Mcdm), 141. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/46789
V. Subbaiah, G. Ravindra Babu & S. D. Sahrma(2011). Project Selection Decision
Making-a Goal Programming Approach, Pacific-Asian Journal of Mathematics, 5(2).
Workday, H., & Erp, L. (n.d.). Innovation in Financial Management Innovation in
Financial Management, 3, 211229.
Man is a goal seeking animal. His life only has meaning if he is reaching
out and striving for his goals.
Aristotle 384-322 BC