Question

Using simplex method, solve the following LPP :

Maximize Z = 3x + 5y, subject to constraints :

x + 2y  20, x + y  15, x  5, x  0, y  0.
​

Answer 1

Answer:

this is my brother answer