D mint; z1000 (21 300 ming=800 -2. 7 = 1, 2] rep Nan Problem 2 (35 pts) Consider the mathematical program: max s.t. 52, t32 2x + x 6 X X 0 X, X 0 Beginning at x(0) = (0, 0), execute Improving Search Algorithm on the model. Limit your search to the two directions Ax() = (1, 3) and Ax2) = (1, -2), and continue until neither is both improving and feasible