MATHEMATICS · Subjective · CBSE · Mathematics · Linear Programming · Linear Programming
Problem
The system below is currently infeasible:
(i) x+y≤1, \; (ii) x+y≥3, \; (iii) x≥0, \; (iv) y≥0.
What is the least number of constraints that must be removed so that the remaining system becomes feasible?