Linear programming is a method for solving problems that are described with an objective function and a set of constraints, where each is represented by a linear equation. The problem, in other words, is represented by equations free of non-linear constraints and integer assignment requirements. Forest harvest scheduling efforts are able to employ linear programming if the model system can be described in a manner consistent with the four assumptions of these types of problems (divisibility, certainty, proportionality, and additivity). Often, linear programming is employed to examine strategic forest planning alternatives that span long time frames and large areas, but these conditions are not necessary to use the problem-solving method. In this chapter, the problem-solving ability of linear programming is described along with a few examples of applications aimed at forest management.