Three products are processed through three different operations. The times (in minutes) required per unit for each product, the daily capacity of the operations (in minutes per day), and the profit per unit sold for each product are as follows:

 

Assuming that all produced units are sold, formulate a Linear Programming model to determine the optimal daily production for the three products that maximizes profits.

Operation 1 2 3 Profit per Unit ($) Product 1 1 3 1 3 Time per Unit (Minutes) Products Product 2 2 0 4 2 Product 3 1 2 0 5 Products Operation Capacity (Minutes per day) 430 460 420