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

 Maximize the Objective Function

2x + 4y = z

Subject to:

Machine L                  7x  + 9y  ≤ 154

Machine LL                3x  + 3y  ≤ 66

Step-by-step explanation:

From problem statement :

Let :

x   units of product A per shift

y   units of product B per shift

Profit on each A unit    2$

Profit on each B unit    4$

Product A needed  time in machine L   7 min   and  3 min in machine LL

Poduct B needed  time in machine L   9 min   and 3  min in machine LL

Available time  154 min machine L   66 min machine LL (by shift )

Then: Objective function to maximize z

z = 2x + 4y  

Constraints

Machine L                  7x  + 9y  ≤ 154

Machine LL                3x  + 3y  ≤ 66

answer:   b

step-by-step explanation:

x2 = 16

x can not be a negative number because 16 is positive

the only answer would be positive 8  

so what is the problem what are they asking you to solve

step-by-step explanation:

so what is the problem what are they asking you to solve