Optimal harvesting policy for single population with periodic coefficients. (English) Zbl 0940.92030

Summary: We examine the exploitation of a single population modeled by a time-dependent logistic equation with periodic coefficients. First, it is shown that the time-dependent periodic logistic equation has a unique positive periodic solution, which is globally asymptotically stable for positive solutions, and we obtain its explicit representation. Further, we choose the maximum annual-sustainable yield as the management objective, and investigate the optimal harvesting policies for constant harvest and periodic harvest.
The optimal harvest effort that maximizes the annual-sustainable yield, the corresponding optimal population level, the corresponding harvesting time-spectrum, and the maximum annual-sustainable yield are determined, and their explicit expressions are obtained in terms of the intrinsic growth rate and the carrying capacity of the considered population. Our interesting and brief results generalize the classical results of C. W. Clark [Mathematical bioeconomics. The optimal management of renewable resources. (1976; Zbl 0364.90002)] for a population described by the autonomous logistic equation in renewable resources management.


92D40 Ecology
49N20 Periodic optimal control problems
49J15 Existence theories for optimal control problems involving ordinary differential equations


Zbl 0364.90002
Full Text: DOI


[4] Leung, A. W., Optimal harvesting-coefficient control of steady-state prey-predator diffusive Volterra-Lotka systems, Appl. Math. Optim., 31, 2, 219 (1995) · Zbl 0820.49011
[6] Bhatta charya, D. K.; Begum, S., Bionomic equilibrium of two-species System I, Math. Biosci., 135, 2, 111 (1996) · Zbl 0856.92018
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.