arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1106.2773math.OCcs.SYeess.SYq-bio.PE
收藏

随机环境中的最优收获:松弛模型中的最优策略

On Optimal Harvesting in Stochastic Environments: Optimal Policies in a Relaxed Model

University of Wisconsin-Milwaukee(密尔沃基威斯康星大学)

Richard H. Stockbridge, Chao Zhu

AI总结:

本文通过将收获问题嵌入到以初始位置为参数的占用测度空间上的无限维线性规划中,并分析一个约束较少的辅助问题,证明了松弛收获策略的存在性并给出了闭式价值函数。

摘要:

本文研究了在随机环境中最优收获单一物种的目标。该问题先前由 Alvarez (2000) 使用动态规划技术分析,由于价格率函数的自然支付结构(价格随种群增加而下降),不存在最优收获策略。本文建立了收获模型的松弛公式,使得不仅能够证明而且能够识别最优松弛收获策略的存在性。分析将收获问题嵌入到以初始位置为参数的占用测度空间上的无限维线性规划中,然后分析一个约束较少的辅助问题。通过这种方式,确定了最优值(给定初始位置)的上界;这些上界取决于初始种群大小与特定目标大小的关系。更有趣的情况发生在初始种群超过目标大小时;需要新的论证来获得尖锐的上界。尽管初始种群大小仅作为参数进入,但价值以该参数的闭式函数表达式确定。

英文摘要:

This paper examines the objective of optimally harvesting a single species in a stochastic environment. This problem has previously been analyzed in Alvarez (2000) using dynamic programming techniques and, due to the natural payoff structure of the price rate function (the price decreases as the population increases), no optimal harvesting policy exists. This paper establishes a relaxed formulation of the harvesting model in such a manner that existence of an optimal relaxed harvesting policy can not only be proven but also identified. The analysis embeds the harvesting problem in an infinite-dimensional linear program over a space of occupation measures in which the initial position enters as a parameter and then analyzes an auxiliary problem having fewer constraints. In this manner upper bounds are determined for the optimal value (with the given initial position); these bounds depend on the relation of the initial population size to a specific target size. The more interesting case occurs when the initial population exceeds this target size; a new argument is required to obtain a sharp upper bound. Though the initial population size only enters as a parameter, the value is determined in a closed-form functional expression of this parameter.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑