Question

This maximization linear programming problem is not in "standard" form. It has mixed constraints, some involving ≤ inequalities and some involving ≥ inequalities. However with careful graphing, we can solve this using the techniques we have learned in this section. Maximize
a) z=5x+7y Subject to x+y≤30
b) 2x+y≤50
c) 2x≥y
d) x≥0,y≥0

Answer 1

Answer: See Annex

z (max)  = 190

x = 10

y = 20

Step-by-step explanation:

z = 5*x  +  7*y     to maximize

Subject to:

x + y ≤ 30

2*x + y ≤50

2*x - y ≥ 0

x≥=  y ≥0