If I were to solve this problem graphically, I would get some graph paper(s), pencil, eraser and a straight edge. Then, on a single graph paper I would plot:Anyone know linear programming and how to solve this using graphical method? Also is it possible to find the feasible region?
Minimize: 5x + 10y
Subject to: 2x + y ≥ 10
× + y ≥ 15
x ≥ 0 ; y ≥ 0
A point has two co-ordinates! You have the x-coordinate and y-coordinate. You should say test a point, not a co-ordinate. Is this clear?To add to what the Great Khan said, after graphing the straight lines; you would then test one co-ordinate from both sides of the graphed lined to see if that side of the line satisfies the inequality from which the line is derived. Shade the side of the line which does not satisfy the inequality. Do this for all the inequalities and you will be left with a region whose enclosed co-ordinates all satisfy the inequalities.
But since you are looking to find such a co-ordinate that not only satisfies the inequalities but also minimises the objective function given, you would look at all the vertexes of the unshaded region,( which are actually just the intersections of lines graphed from the inequalities) and substitute their [MATH](x,y)[/MATH] co-ordinates into the objective function you are looking to minimise and record the output they yield.
Then just pick the [MATH](x,y)[/MATH] which yields the lowest value when input into the objective function.
Thanks, I corrected the postA point has two co-ordinates! You have the x-coordinate and y-coordinate. You should say test a point, not a co-ordinate. Is this clear?
If I were to solve this problem graphically, I would get some graph paper(s), pencil, eraser and a straight edge. Then, on a single graph paper I would plot:
y = -2x + 10
y = -x + 15
These and the x & y axes will define the constraints.
continue......
If you have further questions, please post your work including the graph.
Anyone know linear programming and how to solve this using graphical method? Also is it possible to find the feasible region?
Minimize: 5x + 10y
Subject to: 2x + y ≥ 10
× + y ≥ 15
x ≥ 0 ; y ≥ 0
Minimize: 5x + 10y
Subject to: 2x + y ≥ 10
× + 3y ≥ 15
x ≥ 0 ; y ≥ 0
I’m having difficulty determining the feasible region since the constraints are FALSE
View attachment 22136
Oops it was a typo it'sBased on your work, maybe one of the inequalities was x + 3y > 15 and not x+y> 15??
How can the constraints be wrong? They were given to you!
Oopss it's a typo yeah it's x + 3y ≥ 15Based on your work, maybe one of the inequalities was x + 3y > 15 and not x+y> 15??
How can the constraints be wrong? They were given to you!
I have already dete
I have already determined the x and y now im having difficulty determining the shade regions since the constraints are FALSE
Now check the value of "the function to be minimized" at (3,4) , (0,10) and (15,0)Can anyone tell if this is solved correctly I just wanted to make sure.
If there is something wrong please tell me.
View attachment 22172