On the exploitation of a population given by a system of linear equations with random parameters

M. S. Woldeab, L. I. Rodina
{"title":"On the exploitation of a population given by a system of linear equations with random parameters","authors":"M. S. Woldeab, L. I. Rodina","doi":"10.35634/2226-3594-2023-61-02","DOIUrl":null,"url":null,"abstract":"We consider a population whose dynamics in the absence of exploitation is given by a system of linear homogeneous differential equations, and some random shares of the resource of each species at fixed times, are extracted from this population. We assume that the harvesting process can be controlled in such a way as to limit the amount of the extracted resource in order to increase the size of the next harvesting. A method for harvesting a resource is described, in which the largest value of the average time benefit is reached with a probability of one, provided that the initial amount of the population is constantly maintained or periodically restored. The harvesting modes are also considered in which the average time benefit is infinite. To prove the main assertions, we use the corollary of the law of large numbers proved by A.N. Kolmogorov. The results on the optimal resource extraction for systems of linear difference equations, a particular case of which are Leslie and Lefkovich population dynamics models, are given.","PeriodicalId":42053,"journal":{"name":"Izvestiya Instituta Matematiki i Informatiki-Udmurtskogo Gosudarstvennogo Universiteta","volume":"102 1","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Izvestiya Instituta Matematiki i Informatiki-Udmurtskogo Gosudarstvennogo Universiteta","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.35634/2226-3594-2023-61-02","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

We consider a population whose dynamics in the absence of exploitation is given by a system of linear homogeneous differential equations, and some random shares of the resource of each species at fixed times, are extracted from this population. We assume that the harvesting process can be controlled in such a way as to limit the amount of the extracted resource in order to increase the size of the next harvesting. A method for harvesting a resource is described, in which the largest value of the average time benefit is reached with a probability of one, provided that the initial amount of the population is constantly maintained or periodically restored. The harvesting modes are also considered in which the average time benefit is infinite. To prove the main assertions, we use the corollary of the law of large numbers proved by A.N. Kolmogorov. The results on the optimal resource extraction for systems of linear difference equations, a particular case of which are Leslie and Lefkovich population dynamics models, are given.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一类具有随机参数的线性方程组给出的总体的开发
我们考虑一个种群,在没有开发的情况下,其动态由线性齐次微分方程系统给出,并且从该种群中抽取每个物种在固定时间的一些随机资源份额。我们假设采集过程可以通过这样一种方式进行控制,即限制提取资源的数量,以便增加下一次采集的规模。本文描述了一种获取资源的方法,只要不断保持或定期恢复种群的初始数量,以1的概率达到平均时间效益的最大值。同时考虑了平均时间效益无限的收获模式。为了证明主要的断言,我们使用柯尔莫哥洛夫证明的大数定律的推论。以Leslie和Lefkovich种群动力学模型为例,给出了线性差分方程系统的最优资源提取的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
1.00
自引率
0.00%
发文量
0
期刊最新文献
Integration of the mKdV Equation with nonstationary coefficients and additional terms in the case of moving eigenvalues On the exploitation of a population given by a system of linear equations with random parameters Asymptotic expansion of the solution to an optimal control problem for a linear autonomous system with a terminal convex quality index depending on slow and fast variables Algorithms for constructing suboptimal coverings of plane figures with disks in the class of regular lattices A bottleneck routing problem with a system of priority tasks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1