- Problem 2 Consider The Following Lincar Optimization Problem Maximize Subject To 2x2 4x3 8x4 16x5 X 2x2 1 (48.07 KiB) Viewed 16 times
Problem 2. Consider the following lincar optimization problem. maximize subject to ₁ + 2x2 + 4x3 + 8x4 + 16x5 x₁ + 2x2 +
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
Problem 2. Consider the following lincar optimization problem. maximize subject to ₁ + 2x2 + 4x3 + 8x4 + 16x5 x₁ + 2x2 +
Problem 2. Consider the following lincar optimization problem. maximize subject to ₁ + 2x2 + 4x3 + 8x4 + 16x5 x₁ + 2x2 + 3x3 + 4x4 +5x5 ≤ 2 7x₁5x2 3x3 − 2x4+x5 ≤ 0 T1, T2, T3, T4, T5 20 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.