only part a please
Problem 3. Consider the Klee-Minty problem covered in lecture. maximize _Σ-1 10n-ixj subject to 2.10³−³xj + xį ≤ 100³-¹ for i = 1,2,…,n Zj=1 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 cach step. Submit both your code and its output.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!