The document provides examples and steps for solving linear programming problems. It explains that linear programming involves defining variables, writing constraints as inequalities, graphing the feasible region, finding the vertex coordinates, writing the objective function, substituting the vertices into the function, and determining the maximum or minimum value. Two examples are worked through showing how to maximize profit by determining the optimal number of acres to plant for different crops or units of steel products to produce.