Mathematics 24 Online
OpenStudy (anonymous):

Our book doesn't go over problems like this so i'm not sure how to even set this problem up or even solve it. The problem is" A manufacturer has the capacity of producing two different highly technical military devices(device A and B). There are three phases in producing these two devices, the first is the construction of the components for the devices, the second is the assembly of the units, and the third is the final finish and testing of the devices before it is packed and shipped to the customer. For each unit of device A it takes 5 hours to create the components, 3 hours to assemble t

OpenStudy (anonymous):

The problem is" A manufacturer has the capacity of producing two different highly technical military devices(device A and B). There are three phases in producing these two devices, the first is the construction of the components for the devices, the second is the assembly of the units, and the third is the final finish and testing of the devices before it is packed and shipped to the customer. For each unit of device A it takes 5 hours to create the components, 3 hours to assemble the device, and 3 hours for finishing and testing for a profit of \$4,813 For each unit of device B it takes 6 hours to create the components, 2 hours to assemble the device, and 1 hour for finishing and testing for a profit of \$1,534. Each day there are 156 hours available for the construction of the components, 60 hours available for the assembly of devices, and 48 hours available for the finishing and testing of the devices. Find the number of devices of A and B that they should create to maximize profit. Show steps needed to complete the problem with your final answer in sentence form

OpenStudy (anonymous):

So, you make some kind of nifty table showing the three phases, the two devices and the costs. This basically boils down into a system of 3 linear equations and a cost equation you seek to maximize. 5*A+6*B<156 3*A+2*B<60 3*A+B<48 Profit = 4813*A+1534*B So you basically follow linear programming rules and find the intersection points. Plug them in, and find the points that give you the greatest profit.