Consider the following LP: where A = [1 0 0 0 10 001 {max cx: Axb,...

Transcribed Image Text:

Consider the following LP: where A = [1 0 0 0 10 001 {max cx: Axb, x>0}, 1-8 -1 -1 0 0 -B 9 b = 0 C = X x = x1 X2 X3 X4 X5 2 where a > 0 and B E R are parameters (these parameters can be treated as constants). Let x=(5-3², 3, 0, 0, 0)™ (a) Determine all the values of the parameters a and 3 for which is feasible for the given LP. (b) Determine all the values of the parameters a and ß for which is optimal for the given LP. (c) Suppose that is feasible but not optimal. Prove that the LP is unbounded. Consider the following LP: where A = [1 0 0 0 10 001 {max cx: Axb, x>0}, 1-8 -1 -1 0 0 -B 9 b = 0 C = X x = x1 X2 X3 X4 X5 2 where a > 0 and B E R are parameters (these parameters can be treated as constants). Let x=(5-3², 3, 0, 0, 0)™ (a) Determine all the values of the parameters a and 3 for which is feasible for the given LP. (b) Determine all the values of the parameters a and ß for which is optimal for the given LP. (c) Suppose that is feasible but not optimal. Prove that the LP is unbounded.

Answer rating: 100% (QA)

To analyze the given linear programming LP problem lets break it down into three parts as follows LP maximize cx subject to Ax b and x 0 where c 100 1 ... View the full answer