IDEAS home Printed from https://ideas.repec.org/h/spr/sptchp/978-3-031-89432-9_5.html
   My bibliography  Save this book chapter

Binary Search

In: Forest Harvest Scheduling

Author

Listed:
  • Pete Bettinger

    (University of Georgia)

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.

Suggested Citation

  • Pete Bettinger, 2025. "Binary Search," Springer Texts in Business and Economics, in: Forest Harvest Scheduling, chapter 0, pages 115-132, Springer.
    • Handle: RePEc:spr:sptchp:978-3-031-89432-9_5
    DOI: 10.1007/978-3-031-89432-9_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sptchp:978-3-031-89432-9_5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.