Question: 90 QUESTION 3: Linear Programming Formulation (33 points) Acme sells two sprocket assemblies for escalators and elevators. Each type of sprocket must first be machined

90 QUESTION 3: Linear Programming Formulation (33

90 QUESTION 3: Linear Programming Formulation (33

90 QUESTION 3: Linear Programming Formulation (33

90 QUESTION 3: Linear Programming Formulation (33

90 QUESTION 3: Linear Programming Formulation (33

90 QUESTION 3: Linear Programming Formulation (33 points) Acme sells two sprocket assemblies for escalators and elevators. Each type of sprocket must first be machined and then assembled. Unit machining and assembly times, capacity limitations, demand restrictions and revenue-cost data are as follows: Required Hrs/unit Max Unit Machining Assembly Sales Price ($) Sprocket 1 2 2 15 50 Sprocket 2 4 1 20 60 Capacity (hrs/wk) 50 Cost $5/hr $4/hr Let xl and x2 represent the number of units of sprockets 1 and 2 to produce, respectively. MAX Z= 32x1 + 36x2 Subject to Max Sales Sp. 1: X1 Max Sales Sp. 2: x2 20 Machine Time: 2x 1 + 4x2 5 90 Assembly Time: 2x1 x2

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!