For the Linear Programming Problem, Max Z = 7x + 3y, subject to constraints x + 3y ≥ 5 x + y ≥ 2 x, y ≥ 0 Then this Line
We can see that complete solution: write formula, plug data, do arithmetic. Final value matches Feasible but unbounded region with 3 corner points. Simple and accurate.
Ref: NCERT Mathematics Class XII — Linear Programming
