MATH 125 Quiz: MATH 125 UWashington Quiz125Sp14 ans

• School: UW
• Department: Mathematics
• Course: MATH 125
• Professor: All

Document Summary

At most two of the constraints can bind. Since all rows are non-zero and any two rows are independent, the rank will eual the number of binding constraints. Ndcq is satis ed: find the solution to the maximization problem. Answer: the lagrangian is l = x e y 0(x + y 10) + 1x + 2y. 0 = e y 0 + 2 (1) (2) Equation (1) tells us 0 = 1 + 1 1. It follows that x + y = 10 by complementary slackness. There are now three cases to consider: 1) x = 0, y = 10; 2) x = 10, y = 0; 3) x, y > 0. In case (1), 2 = 0 by complementary slackness, so 0 = e 10 < 1. In case (2), 1 = 0 by complementary slackness, so 0 = 1. In case (3), 1 = 2 = 0 by complementary slackness.