Answer to Question #342804 in Operations Research for mateen

Question #342804

1.      Solve the following linear programming problem graphically:


Minimise Z = 200 x + 500 y

subject to the constraints:

x + 2y ≥ 10 ... (1)

3x + 4y ≤ 24 ... (2)

x ≥ 0, y ≥ 0 ... (3)



0
Service report
It's been a while since this question is posted here. Still, the answer hasn't been got. Consider converting this question to a fully qualified assignment, and we will try to assist. Please click the link below to proceed: Submit order

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!

Leave a comment

LATEST TUTORIALS
APPROVED BY CLIENTS