 Binary SearchPete Bettinger
Chapter Chapter 5 in Forest Harvest Scheduling, 2025, pp 115-132 from Springer Abstract: Abstract 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. Keywords: Simulation; Sustainable harvest levels; Even-flow; Half-interval search; Search by partition (search for similar items in EconPapers) There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:sptchp:978-3-031-89432-9_5 Ordering information: This item can be ordered from DOI: 10.1007/978-3-031-89432-9_5 Access Statistics for this chapter More chapters in Springer Texts in Business and Economics from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.