A linear programming problem has three constraints, plus non negativity constraints on X and Y. The constraints are: 2X + 10Y ≤ 100; 4X + 6Y ≤ 120; 6X + 3Y ≥ 90.
What is the largest quantity of X that can be made without violating any of these constraints?