Problem 2. Consider the following linear optimization problem. maximize subject to x1 + 2x2 + 4x3 + 8x4 + 16x5 x1 + 2x2
Posted: Wed Jul 06, 2022 11:45 am
Problem 2. Consider the following linear optimization problem. maximize subject to x1 + 2x2 + 4x3 + 8x4 + 16x5 x1 + 2x2 + 3x3 + 4x4 + 5x5 ≤ 2 7x15x2 3x3 - 2x4+x5 ≤ 0 X1, X2, X3, X4, X5 ≥ 0 Consider the situation in which x3 and 5 are basic, and all other variables are nonbasic. - (a) What are B and N? (b) What are b, CB, CN, AB, and AN? (c) Use matrices to calculate the dictionary for when x3 and 5 are basic. Show some matrix calculations. (d) Is this dictionary optimal? Explain your reasoning. Remark: Notice that using matrices gives you one way to quickly check if a solution is optimal.