PROCESSING NETWORK MODELS FOR FOREST MANAGEMENT

被引:5
作者
CHINNECK, JW [1 ]
MOLL, RHH [1 ]
机构
[1] STAT CANADA,OTTAWA,ON,CANADA
来源
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | 1995年 / 23卷 / 05期
基金
加拿大自然科学与工程研究理事会;
关键词
FORESTRY; MODELING; ANALYSIS; LP; OPTIMIZATION;
D O I
10.1016/0305-0483(95)00023-H
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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. We propose 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 nontechnical 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.
引用
收藏
页码:499 / 510
页数:12
相关论文
共 25 条
[1]  
Berck P., 1976, THESIS MIT
[2]   AN IMPROVED PRIMAL SIMPLEX VARIANT FOR PURE PROCESSING NETWORKS [J].
CHANG, MD ;
CHEN, CHJ ;
ENGQUIST, M .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1989, 15 (01) :64-78
[3]   A PRIMAL SIMPLEX APPROACH TO PURE PROCESSING NETWORKS [J].
CHEN, CHJ ;
ENGQUIST, M .
MANAGEMENT SCIENCE, 1986, 32 (12) :1582-1598
[4]   PRIMAL ALGORITHM FOR SOLVING A CAPACITATED NETWORK FLOW PROBLEM WITH ADDITIONAL LINEAR CONSTRAINTS [J].
CHEN, S ;
SAIGAL, R .
NETWORKS, 1977, 7 (01) :59-79
[5]   Locating minimal infeasible constraint sets in linear programs [J].
Chinneck, John W. ;
Dravnieks, Erik W. .
ORSA journal on computing, 1991, 3 (02) :157-168
[6]  
CHINNECK JW, 1990, NAV RES LOG, V37, P245, DOI 10.1002/1520-6750(199004)37:2<245::AID-NAV3220370205>3.0.CO
[7]  
2-D
[8]  
CHINNECK JW, 1992, NAV RES LOG, V39, P531, DOI 10.1002/1520-6750(199206)39:4<531::AID-NAV3220390407>3.0.CO
[9]  
2-K
[10]  
Chvatal V., 1983, LINEAR PROGRAMMING