Given the following linear program with the corresponding feasible basis, for what range of value of the right-hand side for each constraint (considered one at a time) will the basis still be feasible? So, for example, if you replaced the right-hand side of constraint 1 in the first problem with some value R, for what values of R would this basis still be feasible? What if you replaced the second constraint? b: 30 a) A: 1 0 5 2 02 1 3 Feasible basis: (a, b) 60 b) A: 1 0 5 2 0 -2 1 3 b: 20 3 Feasible basis: {a,c} Min 3a + b + 14C + 3e + 6f St: a + 2c - 2d + e = 4 3b + 4c + 12d + 2e +5f = 12 a, b, c, d, e, f>o To check yourself, the optimal solution should be d=0.25, e=4.5 with an objective value of 13.5, and non-basic variables a=b=c=f=0. Given the following linear program with the corresponding feasible basis, for what range of value of the right-hand side for each constraint (considered one at a time) will the basis still be feasible? So, for example, if you replaced the right-hand side of constraint 1 in the first problem with some value R, for what values of R would this basis still be feasible? What if you replaced the second constraint? b: 30 a) A: 1 0 5 2 02 1 3 Feasible basis: (a, b) 60 b) A: 1 0 5 2 0 -2 1 3 b: 20 3 Feasible basis: {a,c} Min 3a + b + 14C + 3e + 6f St: a + 2c - 2d + e = 4 3b + 4c + 12d + 2e +5f = 12 a, b, c, d, e, f>o To check yourself, the optimal solution should be d=0.25, e=4.5 with an objective value of 13.5, and non-basic variables a=b=c=f=0