Mathematics

Mathematics

Problem

The system below is currently infeasible: (i) x+y≤1x+y\le1, \; (ii) x+y≥3x+y\ge3, \; (iii) x≥0x\ge0, \; (iv) y≥0y\ge0. What is the least number of constraints that must be removed so that the remaining system becomes feasible?

Browse the problem library