Bilinear optimal control problem of a discrete logging

Krasovskii A & Platov AS (2017). Bilinear optimal control problem of a discrete logging. Trudy Instituta Matematiki i Mekhaniki UrO RAN 23 (1): 188-194. DOI:10.21538/0134-4889-2017-23-1-188-194.

[img] Text (In Russian)
Krasovskii_Platov_2017.pdf - Published Version
Restricted to Repository staff only until March 2018.
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (176kB)

Abstract

In the proposed mathematical model a forest manager at each specified moment of time makes decisions on harvesting the trees of a certain type (species) and age (age group) in order to maximize their profit. When planning logging, the manager focuses on price projections and takes into account economic costs. The Pontryagin maximum principle is applied for solving the discrete-time optimal control problem arising in the model. A solution is derived in a constructive manner without computational costs associated with the problem's high-dimensionality.
Analytical results, explaining the optimal solution, are provided. For a typically defined problem the optimality condition is derived, which determines the bang-bang solution. The condition includes the discrete dynamics of the adjoint variable, interpreted as the wood shadow price.
The rule that is obtained is treated as the dynamic rationale for logging a certain type and age of forest. Structural flexibility of the proposed mathematical model facilitates its application in forest management. In proving theoretical results in the paper, the authors propose a method that they have not come across in the literature.

Item Type: Article
Research Programs: Ecosystems Services and Management (ESM)
Related URLs:
Depositing User: Luke Kirwan
Date Deposited: 20 Mar 2017 09:44
Last Modified: 20 Mar 2017 10:06
URI: http://pure.iiasa.ac.at/14486

Actions (login required)

View Item View Item

International Institute for Applied Systems Analysis (IIASA)
Schlossplatz 1, A-2361 Laxenburg, Austria
Phone: (+43 2236) 807 0 Fax:(+43 2236) 71 313