Question: A firm that assembles computers is about to start production of two new types of I microcomputers. Each unit of Type 1 requires 5 hours of assembly time, 2 hours of inspection time, and 3 cubic feet of storage space. Each unit of Type 2 requires 10 hours of assembly time, 2 hour of inspection time, and 3 cubic feet of storage space. The profit of Type 1 is $60 per unit and Type 2 is $75 per unit. The manager knows that the daily resources available are 100 hours of assembly time, 22 hours of inspection time, and 39 cubic feet of storage space. Use Linear Programming to solve the problem.
(a) What is the objective function?
(b) What are the constraints?
(c) What are the corner points of the common feasible area?
(d) What is the daily production of Type 1 and Type 2 microcomputers such that the profit will be maximized? What is the daily maximize profit for the firm?