Goal Programming Essay example

1168 Words Nov 20th, 2014 5 Pages
Goal Programming
By

Dr. Mojgan Afshari

Goal Programming (GP)
 Goal programming involves solving problems

containing not one specific objective function, but rather a collection of goals that we would like to achieve.  Firms usually have more than one goal. For example,  maximizing total profit,  maximizing market share,  maintaining full employment,  providing quality ecological management It is not possible for LP to have multiple goals

Goal Programming (GP)
 Most LP problems have hard constraints that

cannot be violated...
 There are 1,566 labor hours available.  There is $850,00 available for projects.

 In

some cases, restrictive...

hard

constraints

are

too

 You have a maximum price
…show more content…
Defining the Goal Constraints


Small Rooms

X1  d  d  5


 1

 1

Medium Rooms

X 2  d  d  10


 2

 2

Large Rooms

X 3  d  d  15

 3

 3

Defining the Goal Constraints
 Total Expansion

400X1  750X 2  1,050X 3  d  d  25,000
 Total Cost

 4

 4

18000X1  33000X 2  45.150X 3  d  d  1,000,000 where  5

 5

d ,d  0

 i

 i

GP Objective Functions
 There are numerous objective functions we

could formulate for a GP problem.  Minimize the sum of the deviations:
MIN


 d i  i

 d i



Problem: The deviations measure different things, so what does this objective represent?

GP Objective Functions (cont’d)


Weights can be used in the previous objectives to allow the decision maker indicate  desirable vs. undesirable deviations  the relative importance of various goals

 Minimize the weighted sum of deviations wi d i  wi d i MIN 





i

 

Or Minimize the weighted sum of % deviations
MIN
1   wi d i  wi d i t i i





Defining the Objective
 Assume  It is undesirable to underachieve any of the first

three room goals  It is undesirable to overachieve or underachieve the 25,000 sq ft expansion goal  It is undesirable to overachieve the $1,000,000 total cost goal  In this case , we want to minimize the weighted percentage deviation for our problem
   w5 w1  w   w 3  w w  4 4

Related Documents