Take-Home Assignment 2, Part A PROBLEMA I: Resuelva el siguiente problema de programaci6n por objetivos con prioridades utilizando el procedimiento secuencial y, para cada objetivo, el método grafico. OBJETIVOS CON PRIORIDADES: @ MAI: 5X; + 4X > 35 @ VAI: 7X; + 3X. > 40 @ PBI: 10; + 5X2 > 60 RESTRICCIONES: © Presupuesto: 100X; + 60X2 < 600 ° Xi, Xe 20 PROBLEMA 2: Resuelva el siguiente problema de programacién por objetivos con prioridades utilizando el procedimiento secuencial y, para cada ‘objetivo, el método grafico. OBJETIVOS CON PRIORIDADES: @ 4X +8xX2 > 45 @ 8X; + 24x. < 100 RESTRICCIONES: @ X, +2% < 10 @xX, <6 @ @ XX 20Take-Home Assignment 2, Part B Resolver los problemas © 78-2, 78-5 y 78-6 que se encuentran en el documento “GoalProgramming.pdt”. Este documento esta en Blackboard. Nota importante: no hagan lo que pide el problema. Hagan lo siguiente: © Sies necesario, definan las variables de decisién. ‘© Formulen objetivos y restricciones. Indiquen claramente cuales son objetivos y cuales son restricciones. © Si el problema es de programacién por objetivos con penalizaciones, ul n variables de desviaci6n y resuélvanlo utilizando algun software, como Solver en Excel. © Si el problema es de programacién por objetivos con prioridades, utilicen el procedimiento secuencial. © Sial optimizar algun objetivo, utiizando el método grafico. © Sial optimizar algun objetivo, tienen mas de dos variables, @zsz:, resuélvanlo utilizando alatin software. 78-2. Management of the Albert Franko Co. has established goals for the market share it wants each of the company’s two new prod- ucts to capture in their respective markets. Specifically, management ‘wants Product 1 to capture atleast 15 percent of its market and Prod- ‘uct 2 to capture at least 10 percent of its market. Three advertising ‘campaigns are being planned to try to achieve these market shares. One is targeted directly on the first product. The second targets the second product. The third is intended to enhance the general repu- tation of the company and its products. Letting x, x, and xs be the amount of money allocated (in millions of dollars) to these respec- tive campaigns, the resulting market share (expressed as a percent- age) for the two products are estimated to be ‘Market share for Product 1 = 0.511 + 0.2x5, Market share for Product 2 = 0.3x + 0.23 nen solo dos variables, resuélvanlo ‘A total of $55 million is available for the three advertising cam- paigns, but management wants at least $10 million devoted to the third campaign. If both market share goals cannot be achieved, ‘management considers each 1 percent decrease in the market share from the goal to be equally serious for the two products. In this light, management wants to know how to most effectively allocate the available money to the three campaigns (a) Formulate a goal programming model for this problem. (b) Reformulate this model as a linear programming model (©) Use the simplex method to solve this model.78-5. Montega is a developing country which has 15,000,000 acres of publicly controlled agricultural land in active use. Its government currently is planning a way to divide this land among three basic crops (labeled 1, 2, and 3) next year. A certain percentage of each of these crops is exported to obtain badly needed foreign capital (dollars), and the rest of each of these crops is used to feed the populace. Raising these crops also provides employment for a sig- nificant proportion of the population. Therefore, the main factors to be considered in allocating the land to these crops are (1) the amount of foreign capital generated, (2) the number of citizens fed, and (3) the number of citizens employed in raising these crops. The following table shows how much each 1,000 acres of each crop contributes toward these factors, and the last column gives the goal established by the government for each of these factors.Contribution per 1,000 Acres Crop: Factor 1 2 3 Goal Foreign capital | $3,000 $5,000 $4,000 | = $70,000,000 Citizens fed 150 75 100 | += 1,750,000 Citizens employed 10 15 2 = 200,000 In evaluating the relative seriousness of not achieving these goals, the government has concluded that the following deviations from the goals should be considered equally undesirable: (1) each $100 under the foreign-capital goal, (2) each person under the citizens-fed goal, and (3) each deviation of one (in either direc- tion) from the citizens-employed goal. (a) Formulate a goal programming model for this problem. (b) Reformulate this model as a linear programming model. (©) Use the simplex method to solve this model. (@) Now suppose that the government concludes that the impor- tance of the various goals differs greatly so that a preemptive ‘goal programming approach should be used. In particular, the first- priority goal is citizens fed = 1,750,000, the second-priority goal is foreign capital = $70,000,000, and the third-priority goal is citizens employed = 200,000. Use the goal program- ming technique to formulate one complete linear program- ‘ming model for this problem. (@) Use the streamlined procedure to solve the problem as formu- lated in part (d). (8) Use the sequential procedure to solve the problem as presented in part (d).78-6. Consider a preemptive goal programming problem with three pri levels, just one goal for each priority level, and just two activities to contribute toward these goals, as summarized in the following table: Unit Contribution Activity: Priority Level 1 2 Goal First priority 1 2 =20 Second priority 1 1 =15 Third priority 2 1 =40 (a) Use the goal programming technique to formulate one com- plete linear programming model for this problem. (b) Construct the initial simplex tableau for applying the stream- lined procedure. Identify the initial BF solution and the initial entering basic variable, but do not proceed further. (©) Starting from (b), use the streamlined procedure to solve the problem. (@) Use the logic of preemptive goal programming to solve the problem graphically by focusing on just the two decision vari- ables. Explain the logic used. (©) Use the sequential procedure to solve this problem. After using the goal programming technique to formulate the linear pro- gramming model (including auxiliary variables) at each stage, solve the model graphically by focusing on just the two decision variables. Identify all optimal solutions obtained for each stage.