linear programming

[ashnee19@hotmail.my]

hi to whom in concern... i could not finish the question n stuck half way..

ques:

maximise z = 9x₁ + 2x₂
subject to

2x₁ + 5x_{2 <} 10
4x₁+3x₂< 12
x_1, x₂> 0

(a) draw the graph and shade the feasible region of the model
(b) use the graph to determine the extreme points
(c) find the optional solution. hence, obtain feasibility range of each constraint

 

[JeffM]

hi to whom in concern... i could not finish the question n stuck half way..

ques:

maximise z = 9x₁ + 2x₂
subject to

2x₁ + 5x_{2 <} 10
4x₁+3x₂< 12
x_1, x₂> 0

(a) draw the graph and shade the feasible region of the model
(b) use the graph to determine the extreme points
(c) find the optional solution. hence, obtain feasibility range of each constraint

It's impossible to show you how to get unstuck if you do not show your work up to where you are stuck. Otherwise we are guessing.