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

Mixed Integer Programming

In: Forest Harvest Scheduling

Author

Listed:
  • Pete Bettinger

    (University of Georgia)

Abstract

Some real forest management problems require integer value (yes/no, 1,2,3, etc.) assignments to potential decisions. For example, when a stand of trees is being considered for a harvest activity, often the entire stand of trees will be applied the activity (in practice) rather than some arbitrary portion of the area. Mixed integer programming is a solution process that is very similar to linear programming in design, yet assumptions regarding the values some decision variables can be assigned may be different. While linear programming requires all values assigned to decision variables to come from the set of continuous real numbers, in mixed integer programming, some of the variables can only be assigned integer values. Pure integer programming is a case where all decision variables need to be assigned integer values. As was noted in Chap. 1 , contemporary forest management problems might include integer decision variables, particularly when the adjacency and green-up of harvest areas are recognized in the model system. This chapter describes the general application of common mathematical (exact) methods for solving integer or mixed integer programming problems.

Suggested Citation

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