The feasible region for a LPP is shown in Fig. 12.10. Evaluate at each of the corner points of this region. Find the minimum value of Z, if it exists.
It is subject to constraints
Now let us convert the given inequalities into equation
We obtain the following equation
The region representing
The line that is meets the other coordinate axes (4,0) and (0,2) respectively. Once we join these points we get the result . After joining the lines, it is then clarified that it does not satisfy the inequation . So, then the region that does not contain the origin then represents the set of solutions.
The region that is represented by
The other line that is meets the coordinate axes (3,0) and (0,3) respectively. When we join these points we obtain the line . It is then cleared that it does not satisfy the inequation. Therefore, the region that does not contain the origin further represents the solution set.
Region represented by is first quadrant, since every point in the first quadrant satisfies these inequations
The graph of these equations is given.
The shaded region ABC is the feasible region is bounded, so, minimum value will occur at a corner point of the feasible region.
Corner Points are A(0,3), B(2,1), and C(4,0) .
When we see the region, we can see that it is unbounded, and 3 is not the minimum value of Z.
When we decide this issue, we can graph the inequality 4x + y < 3 and then further check that whether the resulting does has the open half no point in common, otherwise Z has no minimum value.
The graph that is shown above, we can see that it is clear that there is no point in common with the region and therefore, Z has a minimum value of 3 at (0, 3).
Henceforth, the minimum value of Z is 3 at the point (0, 3).