IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v28y1982i11p1247-1257.html
   My bibliography  Save this article

A Mathematical Model for an Energy Forest

Author

Listed:
  • Olavi Hellman

    (University of Turku, Finland)

Abstract

A mathematical model for a forest consisting of a single species of trees with a steady state distribution of age is suggested. The forest is self-sustained in the sense that trees put out seeds from which new trees will grow. Therefore, there will be trees of different year classes. The rules for tree cutting are obtained to maximize the physical yield from the forest. The rule of cutting is given by function u(\tau ) of the age \tau of the tree which tells which fraction of all trees of age \tau of the forest must be felled during unit time. Function u(\tau ) is obtained by using a slightly generalized optimal control theory which reduces the problem to a fairly simple nonlinear programming problem. The cost of harvesting may be included in the objective functional. All biological characteristics of a forest are contained in two functions of the age of a tree. These functions would be obtained through a process of identification. The model is intended to be a part of a large forest-economy system, therefore mathematical simplicity has been a goal.

Suggested Citation

  • Olavi Hellman, 1982. "A Mathematical Model for an Energy Forest," Management Science, INFORMS, vol. 28(11), pages 1247-1257, November.
    • Handle: RePEc:inm:ormnsc:v:28:y:1982:i:11:p:1247-1257
    DOI: 10.1287/mnsc.28.11.1247
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.28.11.1247
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.28.11.1247?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Keywords

    optimal control: lumber/wood;

    Statistics

    Access and download statistics

    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:inm:ormnsc:v:28:y:1982:i:11:p:1247-1257. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.