This document contains three examples of linear programming problems solved using the simplex method. The first maximizes Z=40X+50Y given constraints on X and Y. It finds the optimal solution is Z=200 with X=4 and Y=0. The second maximizes Z=20X+30Y given different constraints, and finds the optimal solution is Z=60 with X=0 and Y=2. The third maximizes Z=20X+50Y subject to additional constraints, and determines the optimal solution is Z=150 with X=0 and Y=3.