MATHEMATICS · Subjective · CBSE · Mathematics · Linear Programming · Linear Programming
Problem
Consider the following system of inequalities:
(i) x+y≤6
(ii) x≥1
(iii) y≥0
(iv) 2x−y≤4
Find the coordinates of all vertices of the feasible region, listing them in clockwise order starting with the vertex having the least x–coordinate.