Use of chance-constrained programming to account for stochastic variation in theA-matrix of large-scale linear programs: A forestry application

Autor: Brian M. Kent, James B. Pickens, John G. Hof
Rok vydání: 1991
Předmět:
Zdroj: Annals of Operations Research. 31:511-526
ISSN: 1572-9338
0254-5330
DOI: 10.1007/bf02204867
Popis: Linear programming (LP) is widely used to select the manner in which forest lands are managed. Because of the nature of forestry, this application has several unique characteristics. For example, the models consider many different management actions that take place over many years, thus resulting in very large LP formulations with diverse data. In addition, almost none of the data are known with certainty. The most pervasive occurrence of stochastic information is in the production coefficients, which indicate the uncertain response of the managed forest ecosystem to various management options. A “chance-constrained” approach to handling this uncertainty would often be appropriate in forestry applications —managers and decision makers would like to specify a probability with which uncertain constraints are met. Unfortunately, chance-constrained procedures forA-matrix uncertainty produce nonlinear programming problems, which cannot currently be solved for large-scale forestry applications. This paper utilizes a Monte Carlo simulation approach (a linear program is repeatedly solved with randomly perturbedA-matrix coefficients) to describe the distribution of total output when the individual production coefficients are random. An iterative procedure for “chance-constraining” feasibility is developed and demonstrated with this sort of randomA-matrix. An iterative approach is required because the mean and variance of total output are unknown functions of the randomA-matrix coefficients and the level of output required. This approach may have applications in other fields as well.
Databáze: OpenAIRE
Externí odkaz: