Solve the following linear programming problem by
graphical method :
Maximize Z= 4x + 9y, subject to constraints :
x + 5y ≤ 200
2x + 3y ≤ 134
X, Y ≥ 0.
Answers
Answered by
0
Answer:
On maximizing subject to and
Linear Programming
A380
B382
C384
DNone of these
Step-by-step explanation:
Solution:
Here, and
Maximum for C i.e., z = 40 + 342 = 382.
i think so this
please mark me as brainlist
Similar questions