Q.Find feasible solution for each of the following system of linear inequations graphically : $2x + 3y \le 12,\ 2x + y \le 8,\ x \ge 0,\ y \ge 0$

Draw the boundary line of each constraint ($2x+3y\le12,\ 2x+y\le8,\ x\ge0,\ y\ge0$) using its intercepts, shade the half-plane each inequation demands (test the origin, or another convenient point, in each), and darken the region common to all of them. The corner points of this common region are found by solving each pair of adjacent boundary lines simultaneously and keeping only the intersections that also satisfy every other constraint. Doing this here gives the vertices (0, 0), (4, 0), (3, 2), (0, 4), forming a quadrilateral (bounded). (This is exactly section 7.2's Solved Exam …

Draw all boundary lines, shade each half-plane by the test-point method, take the common overlap, then find its corner points by solving the boundary equations pairw …

Including a line-intersection point that fails one of the OTHER constraints as a 'vertex' is the most common error — every candidate corner point must be checked aga …