- Problem 3 Consider The Klee Minty Problem Covered In Lecture Maximize 1 10a Ixj 1 Subject To 2 10 Xj X 100 1 (77.91 KiB) Viewed 10 times
Problem 3. Consider the Klee-Minty problem covered in lecture. maximize 1 10ª—İxj =1 subject to 2 10³− xj + x; ≤ 100¹–¹
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
Problem 3. Consider the Klee-Minty problem covered in lecture. maximize 1 10ª—İxj =1 subject to 2 10³− xj + x; ≤ 100¹–¹
Problem 3. Consider the Klee-Minty problem covered in lecture. maximize 1 10ª—İxj =1 subject to 2 10³− xj + x; ≤ 100¹–¹ for i = 1,2,...,n xj ≥ 0 for j = 1, 2, ..., n (a) Write out the Klee-Minty problem for n = = 3. (b) Using the matrix form of the simplex algorithm and the Python methods that we discussed in class, solve (a) using the largest coefficient rule. Make sure to print the dictionaries at each step. Submit both your code and its output.