An electronics firm produces two models of pocket calculators: the A brand which is an inexpensive calculator, and a B brand which has more advanced features. Each model use one (and the same type) circuit board, of which there are only 2,500 available for this week's production. Also, the company has allocated a maximum of 800 hours of assembly time this week for producing these calculators, of which the A brand requires 15 minutes each, and the B brand requires 30 minutes each to produce. The firm forecasts that it could sell a maximum of 4,000 A calculators and 1,000 B calculators this week, so no need to make more. Profits for the A brands are $1.00 each, and profits for the B brands are $4.00 each. Assume using the symbol A for the number of A calculators to make and B for the number of B calculators to make. Formulate the problem as an LP (Linear Programming) Model to find the optimal mix of calculators to make that maximizes profit. Answer the following, based on this LP formulation:
The objective function is:
The number of constraints (other than the non-negativity constraints) is:
The number of corner points for the feasible region is:
The optimal production mix to make is:
The following constraint is binding: