On Estimation of an Average Time Profit in Probabilistic Environmental and Economic Models

• Main Authors: Lyudmila I. Rodina, Ilya I. Tyuteev
• Format: Article
• Language: English
• Published: Yaroslavl State University 2018-06-01
• Series: Modelirovanie i Analiz Informacionnyh Sistem
• Subjects: model of a population subject to harvesting; average time profit; optimal exploitation
• Online Access: https://www.mais-journal.ru/jour/article/view/685

We consider environmental-economical models of optimal harvesting, given by the differential equations with impulse action, which depend on random parameters. We assume, that lengths of intervals θk between the moments of impulses τk are random variables and the sizes of impulse influence depend on random parameters vk, k = 1, 2, . . . One example of such objects is an equation with impulses, modelling dynamics of the population subject to harvesting. In the absence of harvesting, the population development is described by the differential equation ˙x = g(x) and in time moments τk some random share of resource vk, k = 1, 2, . . . is taken from population. We can control gathering process so that to stop harvesting when its share will appear big enough to keep possible biggest the rest of a resource to increase the size of the following gathering. Let the equation ˙x = g(x) have an asymptotic stable solution ϕ(t) ≡ K and the interval (K1, K2) is the attraction area of the given solution (here 0 ≤ K1 < K < K2). We construct the control u = (u1, . . . , uk, . . .), limiting a share of harvesting resource at each moment of time τk, so that the quantity of the remained resource, since some moment τk0 , would be not less than the given value x ∈ (K1, K). For any x ∈ (K1, K) the estimations of average time profit, valid with probability one, are received. It is shown, that there is a unique x∗ ∈ (K1, K), at which the lower estimation reaches the greatest value. Thus, we described the way of population control at which the value of average time profit can be lower estimated with probability 1 by the greatest number whenever possible.