Gateway to Think Tanks
来源类型 | Article |
规范类型 | 其他 |
DOI | 10.15587/1729-4061.2015.50966 |
Linear optimization of forest management for dynamic recursive model. | |
Turkovska O; Gusti M; Lauri P; Forsell N; Havlik P; Obersteiner M | |
发表日期 | 2015 |
出处 | Eastern-European Journal of Enterprise Technologies 5 (4): 12-18 |
出版年 | 2015 |
语种 | 英语 |
摘要 | Our study presents development of a forest management model based on LP which can be easily integrated into a large-scale dynamic recursive model and contain the instruments providing future consideration for harvesting plans under recursive limitations. We introduce a general structure and simulation algorithm of the model. The forest management algorithm was tested applying historical data of Ukrainian forests. Obtained modeling results demonstrate a correct age class transition. They prove as well adequacy of utilizing benefit losses and delay costs as regulative mechanisms for temporal allocation of forest harvesting. As far as statistic data concerning age structure of Ukrainian forests are not publicly available, FesT was validated by comparing projected forest age structure with results of Global Forest Model (G4M).The comparison shows that the projections of both models are fairly close to each other. The divergence between the results can be explained by difference in forest management modelling approach. |
主题 | Ecosystems Services and Management (ESM) ; Young Scientists Summer Program (YSSP) |
关键词 | forest management linear programming age structure forest value forest management model dynamic recursive model |
URL | http://pure.iiasa.ac.at/id/eprint/11343/ |
来源智库 | International Institute for Applied Systems Analysis (Austria) |
引用统计 | |
资源类型 | 智库出版物 |
条目标识符 | http://119.78.100.153/handle/2XGU8XDN/130164 |
推荐引用方式 GB/T 7714 | Turkovska O,Gusti M,Lauri P,et al. Linear optimization of forest management for dynamic recursive model.. 2015. |
条目包含的文件 | ||||||
文件名称/大小 | 资源类型 | 版本类型 | 开放类型 | 使用许可 | ||
50966-104424-1-PB.pd(496KB) | 智库出版物 | 限制开放 | CC BY-NC-SA | 浏览 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。