OPERATIONS RES APP W/ STUDENT SOL MAN
OPERATIONS RES APP W/ STUDENT SOL MAN
4th Edition
ISBN: 9780534662257
Author: WINSTON
Publisher: CENGAGE L
bartleby

Concept explainers

Expert Solution & Answer
Book Icon
Chapter 4.16, Problem 5P

Explanation of Solution

Formulation of pre-emptive goal programming model for Deancorp:

Consider the below table,

 HeadChuckMuttonMoisture
Fat(per lb)0.050.240.110
Protein(per lb)0.200.260.080
Cost(in ¢)0.12980

Consider the below variables for solving the problem,

x1= Percentage of head used in the mixture

x1= Percentage of chuck used in the mixture

x1= Percentage of mutton used in the mixture

x1= Percentage of moisture used in the mixture

si-= Amount by which the user under the ith goal

si+= Amount by which the user exceeds the ith goal (i=1,2,3)

z= penalty associated with meeting the requirement.

As the sausage should consist of at least 15% protein, so

  0.2x1+0.26x2+0.08x3+s1--s1+=0.15

As the sausage should consist of at most 8% fat, so

  0.5x1+0.24x2+0.11x3+s2--s2+=0

Blurred answer
Students have asked these similar questions
At Lummins Engine Corporation, production employeeswork 10 hours per day, four days per week. Each day ofthe week, at least the following number of employees mustbe working: Monday through Friday, seven employees; Saturday and Sunday, three employees. Lummins has set the following goals, listed in order of priority:■ Goal 1: Meet employee requirements with11 workers.■ Goal 2: The average number of weekend days offper employee should be at least 1.5 days.■ Goal 3: The average number of consecutive daysoff an employee gets during the week should notexceed 2.8 days.Use goal programming to determine how to schedule Lummins employees.
The Touche Young accounting firm must complete three jobs during the next month. Job 1 will require 500 hours of work, job 2 will require 300 hours of work, and job 3 will require 100 hours of work. Currently, the firm consists of 5 partners, 5 senior employees, and 5 junior employees, each of whom can work up to 40 hours per month. The dollar amount (per hour) that the company can bill depends on the type of accountant who is assigned to each job, as shown in the table below. (The X indicates that a junior employee does not have enough experience to work on job 1.) All jobs must be completed. Touche Young has also set the following goals, listed in order of priority:  Goal 1: Monthly billings should exceed $68,000.  Goal 2: At most, 1 partner should be hired.  Goal 3: At most, 3 senior employees should be hired. Goal 4: At most, 5 junior employees should be hired. Formulate a preemptive goal programming model for thissituation
The ABC Company produces three electrical products—blenders, choppers, and toasters. The manufacturer has a maximum daily production budget of RM2000 and a maximum of 660 hours of labor. Maximum daily customer demand is for 200 blenders, 300 choppers, and 150 toasters. The unit profit for blender is RM8, choppers, RM10, and toaster, RM7. The company desires to know the optimal product mix that will maximize profit. These products have the following resource requirements as shown in Table 1. After solving the problem using linear programming, Table 4 shows the LP sensitivity report. Based on the report, answer the following questions and justify all your answers. Formulate the LP model for the above case study. Optimize the Company ABC production using simplex method. Verify your answer in (b) using SOLVER. Provide SOLVER Answer Report, Sensitivity Report, and Excel Sheet of your modelling.  Suppose that the company would like to increase the profit of the toasters to RM9 per unit…

Chapter 4 Solutions

OPERATIONS RES APP W/ STUDENT SOL MAN

Ch. 4.5 - Prob. 1PCh. 4.5 - Prob. 2PCh. 4.5 - Prob. 3PCh. 4.5 - Prob. 4PCh. 4.5 - Prob. 5PCh. 4.5 - Prob. 6PCh. 4.5 - Prob. 7PCh. 4.6 - Prob. 1PCh. 4.6 - Prob. 2PCh. 4.6 - Prob. 3PCh. 4.6 - Prob. 4PCh. 4.7 - Prob. 1PCh. 4.7 - Prob. 2PCh. 4.7 - Prob. 3PCh. 4.7 - Prob. 4PCh. 4.7 - Prob. 5PCh. 4.7 - Prob. 6PCh. 4.7 - Prob. 7PCh. 4.7 - Prob. 8PCh. 4.7 - Prob. 9PCh. 4.8 - Prob. 1PCh. 4.8 - Prob. 2PCh. 4.8 - Prob. 3PCh. 4.8 - Prob. 4PCh. 4.8 - Prob. 5PCh. 4.8 - Prob. 6PCh. 4.10 - Prob. 1PCh. 4.10 - Prob. 2PCh. 4.10 - Prob. 3PCh. 4.10 - Prob. 4PCh. 4.10 - Prob. 5PCh. 4.11 - Prob. 1PCh. 4.11 - Prob. 2PCh. 4.11 - Prob. 3PCh. 4.11 - Prob. 4PCh. 4.11 - Prob. 5PCh. 4.11 - Prob. 6PCh. 4.12 - Prob. 1PCh. 4.12 - Prob. 2PCh. 4.12 - Prob. 3PCh. 4.12 - Prob. 4PCh. 4.12 - Prob. 5PCh. 4.12 - Prob. 6PCh. 4.13 - Prob. 2PCh. 4.14 - Prob. 1PCh. 4.14 - Prob. 2PCh. 4.14 - Prob. 3PCh. 4.14 - Prob. 4PCh. 4.14 - Prob. 5PCh. 4.14 - Prob. 6PCh. 4.14 - Prob. 7PCh. 4.16 - Prob. 1PCh. 4.16 - Prob. 2PCh. 4.16 - Prob. 3PCh. 4.16 - Prob. 5PCh. 4.16 - Prob. 7PCh. 4.16 - Prob. 8PCh. 4.16 - Prob. 9PCh. 4.16 - Prob. 10PCh. 4.16 - Prob. 11PCh. 4.16 - Prob. 12PCh. 4.16 - Prob. 13PCh. 4.16 - Prob. 14PCh. 4.17 - Prob. 1PCh. 4.17 - Prob. 2PCh. 4.17 - Prob. 3PCh. 4.17 - Prob. 4PCh. 4.17 - Prob. 5PCh. 4.17 - Prob. 7PCh. 4.17 - Prob. 8PCh. 4 - Prob. 1RPCh. 4 - Prob. 2RPCh. 4 - Prob. 3RPCh. 4 - Prob. 4RPCh. 4 - Prob. 5RPCh. 4 - Prob. 6RPCh. 4 - Prob. 7RPCh. 4 - Prob. 8RPCh. 4 - Prob. 9RPCh. 4 - Prob. 10RPCh. 4 - Prob. 12RPCh. 4 - Prob. 13RPCh. 4 - Prob. 14RPCh. 4 - Prob. 16RPCh. 4 - Prob. 17RPCh. 4 - Prob. 18RPCh. 4 - Prob. 19RPCh. 4 - Prob. 20RPCh. 4 - Prob. 21RPCh. 4 - Prob. 22RPCh. 4 - Prob. 23RPCh. 4 - Prob. 24RPCh. 4 - Prob. 26RPCh. 4 - Prob. 27RPCh. 4 - Prob. 28RP