Linear programming and related approaches in forest planning.

A number of approaches to forest management planning are surveyed and analysed. A unified treatment of the various models and optimisation techniques is attempted, aiming at a better understanding of their essential characteristics and interrelationships. Ways of improving computational efficiency are examined. Structures for the forestry submodel are classified into three basic types, and interpreted in terms of network flows. A utilisation / economics submodel, comprising an objective function and constraints representing supply requirements, yield regulation, terminal conditions, and other aspects of the management problem, completes the formulation. A new criterion for yield regulation, based on irreversible investment concepts, is discussed in detail. The optimisation methods proposed in the literature for solving forest planning problems are evaluated, together with other potentially useful techniques and strategies. Topics covered include the use of standard Linear Programming packages, the prospects of decomposition and partitioning methods, the potential for utilising oldest-first and other cutting priorities, the explicit use of time structure in Dynamic Linear Programming and Optimal Control Theory algorithms, and the Hoganson-Rose procedure and its relationship to Lagrangian relaxation.

[1]  E. Polak,et al.  Theory of optimal control and mathematical programming , 1969 .

[2]  H. L. Scheurman,et al.  Techniques for Prescribing Optimal Timber Harvest and Investment Under Different Objectives—Discussion and Synthesis , 1977 .

[3]  Francisco Walter Molina.  A Survey of Resource Directive Decomposition in Mathematical Programming , 1979, CSUR.

[4]  Michael A. Saunders,et al.  A practical anti-cycling procedure for linearly constrained optimization , 1989, Math. Program..

[5]  Oscar Garc ´ õa,et al.  Modelling stand development with stochastic differential equations , 1979 .

[6]  R. V. Helgason,et al.  Algorithms for network programming , 1980 .

[7]  Roger A. Sedjo,et al.  An Optimal Control Theory Model to Estimate the Regional Long-Term Supply of Timber , 1983 .

[8]  André F. Perold,et al.  A degeneracy exploiting LU factorization for the simplex method , 1980, Math. Program..

[9]  Wayne F. Bialas,et al.  Two-Level Linear Programming , 1984 .

[10]  Carlos Winkler,et al.  Basis Factorization for Block-Angular Linear Problems: Unified Theory of Partitioning and Decomposition using the Simplex Method , 1974 .

[11]  K. Rennolls,et al.  Timber Management-A Quantitative Approach. , 1984 .

[12]  Oscar García.  A Forestry-Oriented Linear Programming Interpreter , 1984 .

[13]  R. McBride,et al.  Solving embedded generalized network problems , 1985 .

[14]  Paul Tseng,et al.  Relaxation Methods for Linear Programs , 1987, Math. Oper. Res..

[15]  Gerald L. Thompson,et al.  A Forward Simplex Method for Staircase Linear Programs , 1985 .

[16]  Paul Tseng,et al.  Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems , 1988, Oper. Res..

[17]  Richard W. Taylor,et al.  Solving large-scale linear programs by aggregation , 1987, Comput. Oper. Res..

[18]  Richard C. Grinold,et al.  Model Building Techniques for the Correction of End Effects in Multistage Convex Programs , 1983, Oper. Res..

[19]  Gautam Mitra,et al.  Experimental investigation of an interior search method within a simplex framework , 1988, CACM.

[20]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[21]  S. Chen,et al.  A primal algorithm for solving a capacitated network flow problem with additional linear constraints , 1977, Networks.

[22]  E. Anderson,et al.  Linear programming in infinite-dimensional spaces : theory and applications , 1987 .

[23]  John R. Birge.  A dantzig-wolfe decomposition variant equivalent to basis factorization , 1985 .

[24]  George B. Dantzig,et al.  On the Status of Multistage Linear Programming Problems , 1959 .

[25]  L. R. Broad.  Area conservation mechanisms associated with forest management. , 1990 .

[26]  Charles M. Harvey,et al.  Value functions for infinite-period planning , 1986 .

[27]  F. Clarke,et al.  The Optimal Exploitation of Renewable Resource Stocks: Problems of Irreversible Investment , 1979 .

[28]  James K. Ho,et al.  Computational experience with advanced implementation of decomposition algorithms for linear programming , 1983, Math. Program..

[29]  A. I. Propoi,et al.  A Model for the Forest Sector , 1985 .

[30]  K. Löfgren,et al.  The Economics of Forestry and Natural Resources. , 1986 .

[31]  Bruce A. Murtagh,et al.  Advanced linear programming: Computation and practice , 1981 .

[32]  F. Glover,et al.  The simplex SON algorithm for LP/embedded network problems , 1981 .

[33]  L. Kantorovitch,et al.  On the Translocation of Masses , 1958 .

[34]  F. Glover,et al.  Basis exchange characterizations for the simplex son algorithm for LP/embedded networks , 1985 .

[35]  Oscar Barros,et al.  Planning for a Vertically Integrated Forest Industry , 1982, Oper. Res..

[36]  D. R. Fulkerson,et al.  Constructing Maximal Dynamic Flows from Static Flows , 1958 .

[37]  A. Propoi,et al.  The Simplex Method for Dynamic Linear Programs , 1978 .

[38]  E. Gunn,et al.  Modelling and decomposition for planning long-term forest harvesting in an integrated industry structure , 1987 .

[39]  Dietmar W. Rose,et al.  A simulation approach for optimal timber management scheduling , 1984 .

[40]  George B. Dantzig,et al.  Linear Optimal Control Problems and Generalized Linear Programs , 1981 .

[41]  Michael A. Saunders,et al.  Large-scale linearly constrained optimization , 1978, Math. Program..

[42]  M. Fisher,et al.  A multiplier adjustment method for the generalized assignment problem , 1986 .