Questions 1.9.6, 1.9.14, 1.9.15, and 1.9.25, from Kupferschmid, Chapter 1 (available on LMS). In addition, read Chapter 1 from the text.

Hint for 1.9.6: A resource allocation problem has the form max{c^T x : Ax ≤ b,x ≥ 0}, where all parameters in A,b,c are nonnegative. For both parts, it’s enough to think of problems with 2 variables.

Solving the homework problems (and other problems from the text) will improve your understanding of the material.

Working out the problems yourself will greatly improve your understanding of the material and help you on the exams.

You can ask questions on piazza, in addition to using office hours or email.