Formulate but do not solve the following exercise as a linear programming problem. a company manufactures x units of product a and y units of product b, on two machines, i and ii. it has been determined that the company will realize a profit of $2 on each unit of product a and $4 on each unit of product b. to manufacture a unit of product a requires 7 min on machine i and 3 min on machine ii. to manufacture a unit of product b requires 9 min on machine i and 3 min on machine ii. there are 154 min available on machine i and 66 min available on machine ii in each work shift. how many units of a product should be produced in each shift to maximize the company's profit p? p = subject to the constraints. machine i ii = 0 = 0