Thread: Solving Linear Programming:

How do I go about doing this programming problem??

Sketch the region of feasibility and solve the linear programming problem:
Maximize C = 4x-5y, subject to:
x ≥ 2
y ≥ 0
x + y ≤ 7
X + 2y
What does this mean?
Any Formulas I could use?
I can probably sketch the region of feasibility, but how do i solve?
Thanks so much.

Originally Posted by Murphie

How do I go about doing this programming problem??

Sketch the region of feasibility and solve the linear programming problem:
Maximize C = 4x-5y, subject to:
x ≥ 2
y ≥ 0
x + y ≤ 7
X + 2y
What does this mean?
Any Formulas I could use?
I can probably sketch the region of feasibility, but how do i solve?
Thanks so much.

Once you have the region of feasibility, substitute each of the corner points into the objective function. See which gives you the maximum C.