Question: State the linear programming problem Do not solve The Acme Class Ring Company designs and sells two types of rings the VIP and the SST


State the linear programming problem Do not solve The Acme Class Ring Company designs and sells two types of rings the VIP and the SST Let x be the number of VIP rings and y be the number of SST rings They can produce up to 24 rings each day using up to 60 total man hours of labor It takes 3 man hours to make one VIP ring versus 2 man hours to make one SST ring How many of each type of ring should be made daily to maximize the company s profit if the profit on a VIP ring is 40 and on an SST ring is 30 O Maximize z 40x 30y Subject to x y 24 3x 2y 60 x 20 y 20 O Maximize z 40x 30y Subject to x y2 24 3x 2y 60 x 20 y 20 O Maximize z 40x 30y Subject to x ys 24 3x 2y s 60 x20 y 20 O Maximize z 40x 30y Subject to x ys 24 2x 3y 60 x 20 y 20
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
