Binary search is a simulation process that involves iterative attempts to locate a solution to a problem. In forest management, the solution is often characterized as the harvest schedule that ideally produces the highest sustainable harvest level for each time period within a time horizon. Simulating potential harvest levels that are either feasible or infeasible results in upper and lower bounds on the sustainable harvest level. An attempt is then made to assess the feasibility of a harvest level midway between these. The outcome of this attempt produces either a new upper or new lower bound, and a subsequent attempt uses this, along with the previous applicable upper or lower bound to assess the feasibility of a harvest level midway between these. The process continues until the gap between the upper and lower bound is small enough to convince a reasonable person that future attempts (simulations) are not necessary. The last feasible harvest level is then reported as the solution to the problem, along with the associated assignments of management activities to timber stands.