In LPP linear programming, how will we get to know that which sign should be used in equations of subject to constraints.
Check the picture for this question.
Answer fast plz z.
Answers
Hello friend.
To solve a Linear Programming problem graphically, first plot the constraints for the problem. This is done by plotting the boundary lines of the constraints and identifying the points that will satisfy all the constraints. One we graphically plot the area bounded by the constraints, it’s easy to see which points satisfy all constraints. This common region determined by all the constraints including non-negative constraints of a linear programming problem is called the Feasible Region (or solution region).
Now, any point in the feasible region that gives the optimal value (maximum or minimum) of the objective function is called an Optimal Solution. We see that every point in the feasible region satisfies all the constraints, and there are infinitely many points.
Since we know from theory that the optimal value must occur at a corner point (vertex) of the feasible region, calculate the objective function values associated with the coordinates of all the extreme points. This method is called the Corner Point Method.
If the feasible region is bounded (if it can be enclosed), the point with the best objective function value is the best optimal solution. If the feasible region is unbounded (means that the feasible region does extend indefinitely in any direction), the then a maximum or a minimum value of the objective function may not exist. However, if it exists, it must occur at a corner point of the feasible region, which can be calculated.
hope it's helpful for you..
❤️❤️❤️❤️❤️❤️❤️❤️❤️