IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v23y1995i5p499-510.html
   My bibliography  Save this article

Processing network models for forest management

Author

Listed:
  • Chinneck, J. W.
  • Moll, R. H. H.

Abstract

The Forest Management Problem of determining when and how much to plant and harvest, to convert tree species, to spray pesticides, and to take other silvicultural actions is a large scale optimization problem that is often formulated and solved as a linear program. Unfortunately, the algebraic representation of the model is often unintelligible to the practicing forest managers who ought to be able to manipulate the model in order to set up and examine various 'what-if' scenarios. The goal of the a solution to this communication problem: the time-expanded processing network. The goal of the network diagram is to clearly convey the underlying structure, limitations, and assumptions to both mathematical programming experts and montechnical forest managers. The linear programming formulation then follows directly from the diagram. The paper illustrates the model-building procedure by constructing processing network models for common forest behaviours including growth, fire, and pest infestation, and for common management actions including conversion harvests, pest spraying, and nondeclining yield constraints.

Suggested Citation

  • Chinneck, J. W. & Moll, R. H. H., 1995. "Processing network models for forest management," Omega, Elsevier, vol. 23(5), pages 499-510, October.
    • Handle: RePEc:eee:jomega:v:23:y:1995:i:5:p:499-510
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(95)00023-H
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. John W. Chinneck, 1990. "Formulating processing network models: Viability theory," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(2), pages 245-261, April.
    2. John W. Chinneck & Erik W. Dravnieks, 1991. "Locating Minimal Infeasible Constraint Sets in Linear Programs," INFORMS Journal on Computing, INFORMS, vol. 3(2), pages 157-168, May.
    3. Chou-Hong J. Chen & Michael Engquist, 1986. "A Primal Simplex Approach to Pure Processing Networks," Management Science, INFORMS, vol. 32(12), pages 1582-1598, December.
    4. John W. Chinneck, 1992. "Viability analysis: A formulation aid for all classes of network models," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(4), pages 531-543, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bloemhof-Ruwaard, J. M. & Van Wassenhove, L. N. & Gabel, H. L. & Weaver, P. M., 1996. "An environmental life cycle optimization model for the European pulp and paper industry," Omega, Elsevier, vol. 24(6), pages 615-629, December.
    2. Umetani, Shunji & Fukushima, Yuta & Morita, Hiroshi, 2017. "A linear programming based heuristic algorithm for charge and discharge scheduling of electric vehicles in a building energy management system," Omega, Elsevier, vol. 67(C), pages 115-122.
    3. Baselli, Gianluca & Contreras, Felipe & Lillo, Matías & Marín, Magdalena & Carrasco, Rodrigo A., 2020. "Optimal decisions for salvage logging after wildfires," Omega, Elsevier, vol. 96(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. John W. Chinneck, 1992. "Viability analysis: A formulation aid for all classes of network models," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(4), pages 531-543, June.
    2. Pannell, David J. & Kingwell, Ross S. & Schilizzi, Steven, 1996. "Debugging Mathematical Programming Models: Principles and Practical Strategies," Review of Marketing and Agricultural Economics, Australian Agricultural and Resource Economics Society, vol. 64(01), pages 1-15, April.
    3. Wiesława T. Obuchowska, 2015. "Irreducible Infeasible Sets in Convex Mixed-Integer Programs," Journal of Optimization Theory and Applications, Springer, vol. 166(3), pages 747-766, September.
    4. Jérémy Omer & Michael Poss, 2021. "Identifying relatively irreducible infeasible subsystems of linear inequalities," Annals of Operations Research, Springer, vol. 304(1), pages 361-379, September.
    5. Obuchowska, Wieslawa T., 1998. "Infeasibility analysis for systems of quadratic convex inequalities," European Journal of Operational Research, Elsevier, vol. 107(3), pages 633-643, June.
    6. Timo Berthold & Jakob Witzig, 2021. "Conflict Analysis for MINLP," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 421-435, May.
    7. John W. Chinneck, 2001. "Fast Heuristics for the Maximum Feasible Subsystem Problem," INFORMS Journal on Computing, INFORMS, vol. 13(3), pages 210-223, August.
    8. Junhong Guo & William Pozehl & Amy Cohn, 2023. "A two-stage partial fixing approach for solving the residency block scheduling problem," Health Care Management Science, Springer, vol. 26(2), pages 363-393, June.
    9. Oliveira, Carla & Antunes, Carlos Henggeler, 2011. "A multi-objective multi-sectoral economy–energy–environment model: Application to Portugal," Energy, Elsevier, vol. 36(5), pages 2856-2866.
    10. Paula Amaral & Luís Fernandes & Joaquim Júdice & Hanif Sherali, 2009. "On optimal zero-preserving corrections for inconsistent linear systems," Computational Optimization and Applications, Springer, vol. 45(4), pages 645-666, December.
    11. John W. Chinneck, 1990. "Formulating processing network models: Viability theory," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(2), pages 245-261, April.
    12. Obuchowska, Wiesława T., 2014. "Feasible partition problem in reverse convex and convex mixed-integer programming," European Journal of Operational Research, Elsevier, vol. 235(1), pages 129-137.
    13. Draman, Murat & Kuban Altinel, I & Bajgoric, Nijaz & Tamer Unal, Ali & Birgoren, Burak, 2002. "A clone-based graphical modeler and mathematical model generator for optimal production planning in process industries," European Journal of Operational Research, Elsevier, vol. 137(3), pages 483-496, March.
    14. Aggarwal, Charu C. (Charu Chandra) & Hao, Jianxiu. & Orlin, James B., 1953-, 1994. "Diagnosing infeasibilities in network flow problems," Working papers 3696-94., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    15. Wen Sun & Jin-Kao Hao & Alexandre Caminada, 2019. "Iterated backtrack removal search for finding k-vertex-critical subgraphs," Journal of Heuristics, Springer, vol. 25(4), pages 565-590, October.
    16. Aigerim Saken & Emil Karlsson & Stephen J. Maher & Elina Rönnberg, 2023. "Computational Evaluation of Cut-Strengthening Techniques in Logic-Based Benders’ Decomposition," SN Operations Research Forum, Springer, vol. 4(3), pages 1-53, September.
    17. Olivier Guieu & John W. Chinneck, 1999. "Analyzing Infeasible Mixed-Integer and Integer Linear Programs," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 63-77, February.
    18. Michael Holzhauser & Sven O. Krumke & Clemens Thielen, 2017. "Maximum flows in generalized processing networks," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1226-1256, May.
    19. Yash Puranik & Nikolaos V. Sahinidis, 2017. "Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 754-766, November.
    20. Kai Kellner & Marc E. Pfetsch & Thorsten Theobald, 2019. "Irreducible Infeasible Subsystems of Semidefinite Systems," Journal of Optimization Theory and Applications, Springer, vol. 181(3), pages 727-742, June.

    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:eee:jomega:v:23:y:1995:i:5:p:499-510. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.