This document summarizes solutions to three linear programming problems solved graphically.
Problem 1 maximizes z=15x1+10x2 with constraints 4x1+6x2≤360, 3x1≤180, and 5x2≤200. The maximum z=1100 occurs at point (60,20).
Problem 2 maximizes z=2x1+x2 with constraints x1+2x2≤10, x1+x2≤6, x1-x2≤2, and x1-2x2≤1. The maximum z=10 occurs at point (4,2).
Problem 3 maximizes z=-