If the corner points of the feasible region of an LPP are (0, 3), (3, 2) and (0, 5), then the minimum value of Z = 11x 7 y is
The feasible region in linear programming refers to the set of all possible solutions that satisfy the given constraints. It is typically represented as a polygon or polyhedron in the coordinate system. The optimal solution lies at one of the vertices or edges of this feasible region.
Linear Programming is a mathematical method used to find the best outcome in a mathematical model with linear relationships. It involves objective functions and constraints. The feasible region is formed by the set of all possible solutions satisfying the constraints. The solution is often found at the vertices of the feasible region.
Share
To find the minimum value of Z = 11x + 7y, we substitute the corner points of the feasible region into the equation.
For point (0, 3), Z = 11(0) + 7(3) = 21.
For point (3, 2), Z = 11(3) + 7(2) = 33.
For point (0, 5), Z = 11(0) + 7(5) = 35.
Thus, the minimum value of Z is 21 at the point (0, 3).
Click here for more:
https://www.tiwariacademy.com/ncert-solutions/class-12/maths/#chapter-12