Q. Given the following linear programming problem with two non-negative variables (X1 and X2 ), find the range of feasibility for the RHS of constraint 2 (hint: both constraints are binding)
Max: 100X1 +200X2
Constraints:
2X1 + 5X2<=104
15X1 + 3X2<=90
Variables are non-negative