1. Goal, Weighted Goal, and Preemptive Programming Ivan G. Guardiola Ph.D

2. What is Goal Programming? Mathematical model similar to Linear Programming, however it allows for multiple goals to be satisfied at the same time. Allows for the multiple goals to be prioritized and weighted to account for the DM’s utility for meeting the various goals.

3. Assumptions Similar to LP: Non-negative variables Conditions of certainty Variables are independent Limited resources Deterministic

4. Components Economic Constraints Physical Concerned with resources Cannot be violated Example: # of production hours each week

5. Components Goal Constraints Variable Concerned with target values Can be changed/modified Example: Desire to achieve a certain level of profit

6. Introduction Most of the optimization problems considered to this point have had a single objective. Often, more than one objective can be identified for a given problem. Maximize Return or Minimize Risk Maximize Profit or Minimize Pollution These objectives often conflict with one another. This chapter describes how to deal with such problems.

7. 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, hard constraints are too restrictive... You have a maximum price in mind when buying a car (this is your “goal” or target price). If you can’t buy the car for this price you’ll likely find a way to spend more. We use soft constraints to represent such goals or targets we’d like to achieve.

8. Components Objective Function Minimizes the sum of the weighted deviations from the target values – this is ALWAYS the objective for Goal Programming Not the same as LP (which was maximize revenue/minimize costs)

9. Goal Programming Steps Define decision variables Define Deviational Variable for each goal Formulate Constraint Equations Economic constraints Goal constraints Formulate Objective Function

10. Goal Programming Terms Decision Variables are the same as those in LP formulations (represent products, hours worked) Deviational Variables represent overachieving or underachieving the desired level of each goal d+ Represents overachieving level of the goal d- Represents underachieving level of the goal

11. Economic Constraints Stated as =, or = Linear (stated in terms of decision variables) Example: 3x + 2y <= 50 hours Goal Constraints General form of goal constraint: - d + + d - = Goal Programming Constraints Decision Variables Desired Goal Level

12. Goal Programming Example Microcom is a growth oriented firm which establishes monthly performance goals for its sales force Microcom determines that the sales force has a maximum available hours per month for visits of 640 hours Further, it is estimated that each visit to a potential new client requires 3 hours and each visit to a current client requires 2 hours

13. Goal Programming Example Microcom establishes two goals for the coming month: Contact at least 200 current clients Contact at least 120 new clients Overachieving either goal will not be penalized

14. Goal Programming Example Steps Required: 1.Define the decision variables 2.Define the goals and deviational variables 3.Formulate the GP Model’s Parameters:  Economic Constraints  Goal Constraints  Objective Function 4.Solve the GP using the graphical approach

15. Goal Programming Example Step 1: Define the decision variables: X1 = the number of current clients visited X2 = the number of new clients visited Step 2: Define the goals: Goal 1 – Contact 200 current clients Goal 2 – Contact 120 new clients

16. Goal Programming Example Step 3: Define the deviational variables d1+ = the number of current clients visited in excess of the goal of 200 d1- = the number of current clients visited less than the goal of 200 d2+ = the number of new clients visited in excess of the goal of 120 d2- = the number of new clients visited less than the goal of 120

17. Goal Programming Example Formulate the GP Model: Economic Constraints: 2X1 + 3X2 ) X1, X2 => 0 d1+, d1-, d2+, d2- => 0 Goal Constraints: Current Clients: X1 + d1- - d1+ = 200 New Clients: X2 + d2- - d2+ = 120 Must be =

18. Goal Programming Example WebNet establishes two goals for the coming month: Contact at least 200 current clients Contact at least 120 new clients Overachieving either goal will not be penalized

19. Goal Programming Example Objective Function: Minimize Weighted Deviations Minimize Z = d1 - + d2 -

20. Goal Programming Example Complete formulation: Minimize Z = d1 - + d2 - Subject to: 2X1 + 3X2 <= 640 X1 + d1 - - d1 + = 200 X2 + d2 - - d2 + = 120 X1, X2 => 0 d1 +, d1 -, d2 +, d2 - => 0

21. Goal Programming Example Graph constraint: 2X1 + 3X2 = 640 If X1 = 0, X2 = 213 If X2 = 0, X1 = 320 Plot points (0, 213) and (320, 0)

22. Graphical Solution 050100150200 50 100 150 200 X2X2X2X2 2X 1 + 3X 2 = 640 250300350 (0,213) (320,0) X1X1X1X1

23. Goal Programming Example Graph deviation lines X1 + d1 - - d1 + = 200 (Goal 1) X2 + d2 - - d2 + = 120 (Goal 2) Plot lines for X1 = 200, X2 = 120

24. Goal Programming Example 050100150200 50 100 150 200 X1X1X1X1 X2X2X2X2 Goal 1 d1-d1-d1-d1- d1+d1+d1+d1+ Goal 2 d2+d2+d2+d2+ d2+d2+d2+d2+ d2-d2-d2-d2- d2-d2-d2-d2- (140,120) (200,80) 2X 1 + 3X 2 < = 640 250300350 (0,213) (320,0)

25. Solving Graphical Goal Programming Want to Minimize d1 - + d2 - So we evaluate each of the candidate solution points: For point (140, 120) d1 - = 60 and d2 - = 0 Z = 60 + 0 = 60 For point (200, 80) d1 - = 0 and d2 - = 40 Z = 0 + 40 = 40 Optimal Point Contact at least 200 current clients Contact at least 120 new clients

26. Goal Programming Solution X1 = 200Goal 1 achieved X2 = 80Goal 2 not achieved d1+ = 0d2+ = 0 d1- = 0d2- = 40 Z = 40

27. Lets do this in Excel Please watch this carefully

28. A Goal Programming Example: Myrtle Beach Hotel Expansion Davis McKeown wants to expand the convention center at his hotel in Myrtle Beach, SC. The types of conference rooms being considered are:  Davis would like to add 5 small, 10 medium and 15 large conference rooms.  He also wants the total expansion to be 25,000 square feet and to limit the cost to $1,000,000. Size (sq ft)Unit Cost Small400$18,000 Medium750$33,000 Large1,050$45,150

29. Defining the Decision Variables X 1 = number of small rooms to add X 2 = number of medium rooms to add X 3 = number of large rooms to add

30. Defining the Goals Goal 1: The expansion should include approximately 5 small conference rooms. Goal 2: The expansion should include approximately 10 medium conference rooms. Goal 3: The expansion should include approximately 15 large conference rooms. Goal 4: The expansion should consist of approximately 25,000 square feet. Goal 5: The expansion should cost approximately $1,000,000.

31. Defining the Goal Constraints-I Small Rooms  Medium Rooms  Large Rooms where

32. Defining the Goal Constraints- II Total Expansion  Total Cost (in $1,000s) where

33. GP Objective Functions There are numerous objective functions we could formulate for a GP problem. Minimize the sum of the deviations:  Problem: The deviations measure different things, so what does this objective represent?

34. GP Objective Functions (cont’d) Minimize the sum of percentage deviations MIN where t i represents the target value of goal i  Problem: Suppose the first goal is underachieved by 1 small room and the fifth goal is overachieved by $20,000. –We underachieve goal 1 by 1/5=20% –We overachieve goal 5 by 20,000/1,000,000= 2% –This implies being $20,000 over budget is just as undesirable as having one too few small rooms. Is this true? Only the decision maker can say for sure.

35. GP Objective Functions (cont’d) Minimize the weighted sum of deviations MIN  Minimize the weighted sum of % deviations MIN  Weights can be used in the previous objectives to allow the decision maker indicate –desirable vs. undesirable deviations –the relative importance of various goals

36. 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 Initially, we will assume all the above weights equal 1.

37. Implementing the Model See file Fig7-1.xlsm in the text student websiteFig7-1.xlsm We will walk through it now.

38. Comments About GP GP involves making trade-offs among the goals until the most satisfying solution is found. GP objective function values should not be compared because the weights are changed in each iteration. Compare the solutions! An arbitrarily large weight will effectively change a soft constraint to a hard constraint. Hard constraints can be place on deviational variables.

39. The MiniMax Objective Can be used to minimize the maximum deviation from any goal. MIN: Q etc...

40. Summary of Goal Programming 1. Identify the decision variables in the problem. 2. Identify any hard constraints in the problem and formulate them in the usual way. 3. State the goals of the problem along with their target values. 4. Create constraints using the decision variables that would achieve the goals exactly. 5. Transform the above constraints into goal constraints by including deviational variables. 6. Determine which deviational variables represent undesirable deviations from the goals. 7. Formulate an objective that penalizes the undesirable deviations. 8. Identify appropriate weights for the objective. 9. Solve the problem. 10. Inspect the solution to the problem. If the solution is unacceptable, return to step 8 and revise the weights as needed.

41. The Dewright Company The Dewright Company is one of the largest producers of power tools in the United States. The company is preparing to replace its current product line with the next generation of products—three new power tools. Management needs to determine the mix of the company’s three new products to best meet the following three goals: 1. Achieve a total profit (net present value) of at least $125 million. 2. Maintain the current employment level of 4,000 employees. 3. Hold the capital investment down to no more than $55 million.

42. © The McGraw-Hill Companies, Inc., 200817.42 Penalty Weights GoalFactorPenalty Weight for Missing Goal 1Total profit5 (per $1 million under the goal) 2Employment level4 (per 100 employees under the goal) 2 (per 100 employees over the goal) 3Capital investment3 (per $1 million over the goal)

43. © The McGraw-Hill Companies, Inc., 200817.43 Data for Contribution to the Goals Unit Contribution of Product Factor123Goal Total profit (millions of dollars)12915≥ 125 Employment level (hundreds of employees)534= 40 Capital investment (millions of dollars)578≤ 55

44. Weighted Goal Programming A common characteristic of many management science models (linear programming, integer programming, nonlinear programming) is that they have a single objective function. It is not always possible to fit all managerial objectives into a single objective function. Managerial objectives might include: Maintain stable profits. Increase market share. Diversify the product line. Maintain stable prices. Improve worker morale. Maintain family control of the business. Increase company prestige. Weighted goal programming provides a way of striving toward several objectives simultaneously.

45. Weighted Goal Programming With weighted goal programming, the objective is to Minimize W = weighted sum of deviations from the goals. The weights are the penalty weights for missing the goal. Introduce new changing cells, Amount Over and Amount Under, that will measure how much the current solution is over or under each goal. The Amount Over and Amount Under changing cells are forced to maintain the correct value with the following constraints: Level Achieved – Amount Over + Amount Under = Goal

46. Weighted Goal Programming Formulation for the Dewright Co. Problem LetP i = Number of units of product i to produce per day (i = 1, 2, 3), Under Goal i = Amount under goal i (i = 1, 2, 3), Over Goal i = Amount over goal i (i = 1, 2, 3), Minimize W = 5(Under Goal 1) + 2Over Goal 2) + 4 (Under Goal 2) + 3 (Over Goal 3) subject to Level Achieved DeviationsGoal Goal 1: 12P 1 + 9P 2 + 15P 3 – (Over Goal 1) + (Under Goal 1) =125 Goal 2:5P 1 + 3P 2 + 4P 3 – (Over Goal 2) + (Under Goal 2) = 40 Goal 3:5P 1 + 7P 2 + 8P 3 – (Over Goal 3) + (Under Goal 3) =55 and P i ≥ 0, Under Goal i ≥ 0, Over Goal i ≥ 0 (i = 1, 2, 3)

47. Weighted Goal Programming Spreadsheet

48. Weighted vs. Preemptive Goal Programming Weighted goal programming is designed for problems where all the goals are quite important, with only modest differences in importance that can be measured by assigning weights to the goals. Preemptive goal programming is used when there are major differences in the importance of the goals. The goals are listed in the order of their importance. It begins by focusing solely on the most important goal. It next does the same for the second most important goal (as is possible without hurting the first goal). It continues the the following goals (as is possible without hurting the previous more important goals).

49. Preemptive Goal Programming Introduce new changing cells, Amount Over and Amount Under, that will measure how much the current solution is over or under each goal. The Amount Over and Amount Under changing cells are forced to maintain the correct value with the following constraints: Level Achieved – Amount Over + Amount Under = Goal Start with the objective of achieving the first goal (or coming as close as possible): Minimize (Amount Over/Under Goal 1) Continue with the next goal, but constrain the previous goals to not get any worse: Minimize (Amount Over/Under Goal 2) subject to Amount Over/Under Goal 1 = (amount achieved in previous step) Repeat the previous step for all succeeding goals.

50. Preemptive Goal Programming for Dewright The goals in the order of importance are: 1. Achieve a total profit (net present value) of at least $125 million. 2. Avoid decreasing the employment level below 4,000 employees. 3. Hold the capital investment down to no more than $55 million. 4. Avoid increasing the employment level above 4,000 employees. Start with the objective of achieving the first goal (or coming as close as possible): Minimize (Under Goal 1) Then, if for example goal 1 is achieved (i.e., Under Goal 1 = 0), then Minimize (Under Goal 2) subject to (Under Goal 1) = 0

51. Preemptive Goal Programming Formulation for the Dewright Co. Problem (Step 1) LetP i = Number of units of product i to produce per day (i = 1, 2, 3), Under Goal i = Amount under goal i (i = 1, 2, 3), Over Goal i = Amount over goal i (i = 1, 2, 3), Minimize (Under Goal 1) subject to Level Achieved DeviationsGoal Goal 1: 12P 1 + 9P 2 + 15P 3 – (Over Goal 1) + (Under Goal 1) =125 Goal 2:5P 1 + 3P 2 + 4P 3 – (Over Goal 2) + (Under Goal 2) = 40 Goal 3:5P 1 + 7P 2 + 8P 3 – (Over Goal 3) + (Under Goal 3) =55 and P i ≥ 0, Under Goal i ≥ 0, Over Goal i ≥ 0 (i = 1, 2, 3)

52. Preemptive Goal Programming Formulation for the Dewright Co. Problem (Step 2) LetP i = Number of units of product i to produce per day (i = 1, 2, 3), Under Goal i = Amount under goal i (i = 1, 2, 3), Over Goal i = Amount over goal i (i = 1, 2, 3), Minimize (Under Goal 2) subject to Level Achieved DeviationsGoal Goal 1: 12P 1 + 9P 2 + 15P 3 – (Over Goal 1) + (Under Goal 1) =125 Goal 2:5P 1 + 3P 2 + 4P 3 – (Over Goal 2) + (Under Goal 2) = 40 Goal 3:5P 1 + 7P 2 + 8P 3 – (Over Goal 3) + (Under Goal 3) =55 (Under Goal 1) = (Level Achieved in Step 1) and P i ≥ 0, Under Goal i ≥ 0, Over Goal i ≥ 0 (i = 1, 2, 3)

53. Preemptive Goal Programming Formulation for the Dewright Co. Problem (Step 3) LetP i = Number of units of product i to produce per day (i = 1, 2, 3), Under Goal i = Amount under goal i (i = 1, 2, 3), Over Goal i = Amount over goal i (i = 1, 2, 3), Minimize (Over Goal 3) subject to Level Achieved DeviationsGoal Goal 1: 12P 1 + 9P 2 + 15P 3 – (Over Goal 1) + (Under Goal 1) =125 Goal 2:5P 1 + 3P 2 + 4P 3 – (Over Goal 2) + (Under Goal 2) = 40 Goal 3:5P 1 + 7P 2 + 8P 3 – (Over Goal 3) + (Under Goal 3) =55 (Under Goal 1) = (Level Achieved in Step 1) (Under Goal 2) = (Level Achieved in Step 2) and P i ≥ 0, Under Goal i ≥ 0, Over Goal i ≥ 0 (i = 1, 2, 3)

54. Preemptive Goal Programming Formulation for the Dewright Co. Problem (Step 4) LetP i = Number of units of product i to produce per day (i = 1, 2, 3), Under Goal i = Amount under goal i (i = 1, 2, 3), Over Goal i = Amount over goal i (i = 1, 2, 3), Minimize (Over Goal 2) subject to Level Achieved DeviationsGoal Goal 1: 12P 1 + 9P 2 + 15P 3 – (Over Goal 1) + (Under Goal 1) =125 Goal 2:5P 1 + 3P 2 + 4P 3 – (Over Goal 2) + (Under Goal 2) = 40 Goal 3:5P 1 + 7P 2 + 8P 3 – (Over Goal 3) + (Under Goal 3) =55 (Under Goal 1) = (Level Achieved in Step 1) (Under Goal 2) = (Level Achieved in Step 2) (Over Goal 3) = (Level Achieved in Step 3) and P i ≥ 0, Under Goal i ≥ 0, Over Goal i ≥ 0 (i = 1, 2, 3)

55. Preemptive Goal Programming Spreadsheet Step 1: Minimize (Under Goal 1)

56. Preemptive Goal Programming Spreadsheet Step 3: Minimize (Over Goal 3)

57. Preemptive Goal Programming Spreadsheet Step 4: Minimize (Over Goal 2)

58. Multi-Objective Decision Making Many problems have multiple objectives: Planning the national budget save social security, reduce debt, cut taxes, build national defense Admitting students to college high SAT or GMAT, high GPA, diversity Planning an advertising campaign budget, reach, expenses, target groups Choosing taxation levels raise money, minimize tax burden on low-income, minimize flight of business Planning an investment portfolio maximize expected earnings, minimize risk Techniques Preemptive goal programming Weighted goal programming

59. A Toxic Waste Profit C B Trade-offs Between Objectives & Dominated Decision Alternatives

60. Multiple Objective Linear Programming (MOLP) An MOLP problem is an LP problem with more than one objective function. MOLP problems can be viewed as special types of GP problems where we must also determine target values for each goal or objective. Analyzing these problems effectively also requires that we use the MiniMax objective described earlier.

61. An MOLP Example: The Blackstone Mining Company Blackstone Mining runs 2 coal mines in Southwest Virginia. Monthly production by a shift of workers at each mine is summarized as follows: Type of Coal Wythe Mine Giles Mine High-grade12 tons4 tons Medium-grade4 tons4 tons Low-grade10 tons20 tons Cost per month$40,000$32,000 Gallons of toxic water produced800 1,250 Life-threatening accidents0.200.45  Blackstone needs to produce 48 more tons of high-grade, 28 more tons of medium-grade, and 100 more tons of low-grade coal.

62. Defining the Decision Variables X 1 = number of months to schedule an extra shift at the Wythe county mine X 2 = number of months to schedule an extra shift at the Giles county mine

63. Defining the Objective There are three objectives: Min: $40 X 1 + $32 X 2 } Production costs Min: 800 X 1 + 1250 X 2 } Toxic water Min: 0.20 X 1 + 0.45 X 2 } Accidents

64. Defining the Constraints High-grade coal required 12 X 1 + 4 X 2 >= 48 Medium-grade coal required 4 X 1 + 4 X 2 >= 28 Low-grade coal required 10 X 1 + 20 X 2 >= 100 Nonnegativity conditions X 1, X 2 >= 0

65. Handling Multiple Objectives If the objectives had target values we could treat them like the following goals: Goal 1: The total cost of productions cost should be approximately t 1. Goal 2: The amount of toxic water produce should be approximately t 2. Goal 3: The number of life-threatening accidents should be approximately t 3. We can solve 3 separate LP problems, independently optimizing each objective, to find values for t 1, t 2 and t 3.

66. Implementing the Model See file Fig7-8.xlsmFig7-8.xlsm

67. Summarizing the Solutions SolutionX 1 X 2 CostToxic WaterAccidents 12.54.5$2447,6252.53 24.03.0$2566,9502.15 310.00.0$4008,0002.00 X1X1 X1X1 1 2 3 4 5 1 6 7 8 9 10 11 12 2 34 5 6 7 89 101112 Feasible Region Solution 1 (minimum production cost) 0 0 Solution 2 (minimum toxic water) Solution 3 (minimum accidents) X2X2

68. Defining The Goals Goal 1: The total cost of productions cost should be approximately $244. Goal 2: The gallons of toxic water produce should be approximately 6,950. Goal 3: The number of life-threatening accidents should be approximately 2.0.

69. Defining an Objective We can minimize the sum of % deviations as follows:  It can be shown that this is just a linear combination of the decision variables.  As a result, this objective will only generate solutions at corner points of the feasible region (no matter what weights are used).

70. Defining a Better Objective Subject to the additional constraints: MIN: Q  This objective will allow the decision maker to explore non-corner point solutions of the feasible region.

71. Implementing the Model See file Fig7-14.xlsmFig7-14.xlsm

72. Possible MiniMax Solutions X1X1 X1X1 1 2 3 4 5 1 6 7 8 9 10 11 12 2 34 5 6 7 8 9 101112 Feasible Region w 1 =10, w 2 =1, w 3 =1, x 1 =3.08, x 2 =3.92 0 0 X2X2 w 1 =1, w 2 =10, w 3 =1, x 1 =4.23, x 2 =2.88 w 1 =1, w 2 =1, w 3 =10, x 1 =7.14, x 2 =1.43

73. Comments About MOLP Solutions obtained using the MiniMax objective are Pareto Optimal. Deviational variables and the MiniMax objective are also useful in a variety of situations not involving MOLP or GP. For minimization objectives the percentage deviation is: (actual - target)/target For maximization objectives the percentage deviation is: (target - actual)/target If a target value is zero, use the weighted deviations rather than weighted % deviations.

74. Summary of MOLP 1. Identify the decision variables in the problem. 2. Identify the objectives in the problem and formulate them as usual. 3. Identify the constraints in the problem and formulate them as usual. 4. Solve the problem once for each of the objectives identified in step 2 to determine the optimal value of each objective. 5. Restate the objectives as goals using the optimal objective values identified in step 4 as the target values. 6. For each goal, create a deviation function that measures the amount by which any given solution fails to meet the goal (either as an absolute or a percentage). 7. For each of the functions identified in step 6, assign a weight to the function and create a constraint that requires the value of the weighted deviation function to be less than the MINIMAX variable Q. 8. Solve the resulting problem with the objective of minimizing Q. 9. Inspect the solution to the problem. If the solution is unacceptable, adjust the weights in step 7 and return to step 8.