Question: The following questions below apply to the linear program minimize z = 101x1 + 87x2 + 23x3 subject to 6x1 13x2 3x3 11 6x1 +
The following questions below apply to the linear program minimize z = 101x1 + 87x2 + 23x3 subject to 6x1 13x2 3x3 11 6x1 + 11x2 + 2x3 45 x1 + 5x2 + x3 12 x1, x2, x3 0 with optimal basic solution basic x1 x2 x3 x3 x4 x5 rhs z 0 0 0 12 4 5 372 x1 100 1 27 5 x2 010 4 9 30 1 x3 0 0 1 19 43 144 2 All of the questions are independent. (i) What is the solution of the linear program obtained by decreasing the right-hand side of the second constraint by 15? (iii) What is the solution of the linear program obtained by increasing the coefficient of x1 in the objective by 25?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
