3.5: Review Problems
( \newcommand{\kernel}{\mathrm{null}\,}\)
1. Maximize f(x,y)=2x+3y subject to the constraints
x≥0,y≥0,x+2y≤2,2x+y≤2,
by
a) sketching the region in the xy-plane defined by the constraints and then checking the values of f at its corners; and,
b) the simplex algorithm (Hint: introduce slack variables).
Contributor
David Cherney, Tom Denton, and Andrew Waldron (UC Davis)