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

Linear Programming

In: Forest Harvest Scheduling

Author

Listed:
  • Pete Bettinger

    (University of Georgia)

Abstract

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.

Suggested Citation

  • Pete Bettinger, 2025. "Linear Programming," Springer Texts in Business and Economics, in: Forest Harvest Scheduling, chapter 0, pages 39-81, Springer.
    • Handle: RePEc:spr:sptchp:978-3-031-89432-9_2
    DOI: 10.1007/978-3-031-89432-9_2
    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_2. 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.