IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v292y2017icp145-155.html
   My bibliography  Save this article

Optimal impulsive harvesting policies for single-species populations

Author

Listed:
  • Dou, Jiawei
  • Li, Shundong

Abstract

In this paper, we address an optimal impulsive control problem with the aim of optimizing the harvesting rate for a non-autonomous logistic model. In addressing this problem, we combine bang–bang and singular controls for an impulsive optimization problem in which the singular controls are blocked at certain harvesting times. In our approach, we first obtain the singular controls by applying a Pontryagin optimal control framework for impulsive systems. Second, we investigate and derive a number of relationships characterizing the optimal harvesting rates and present an optimization principle: the optimal path lies as close as possible to the singular path. Finally, based on this optimization principle, we obtain analytical expressions for the optimal harvesting policy for our problem and use numerical simulations to demonstrate the effectiveness of our method. This study develops concepts and theory related to continuous control problems and applies them to impulsive control problems, and extends the related work of Xiao et al. (2006) and Braverman and Mamdani (2008).

Suggested Citation

  • Dou, Jiawei & Li, Shundong, 2017. "Optimal impulsive harvesting policies for single-species populations," Applied Mathematics and Computation, Elsevier, vol. 292(C), pages 145-155.
    • Handle: RePEc:eee:apmaco:v:292:y:2017:i:c:p:145-155
    DOI: 10.1016/j.amc.2016.07.027
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300316304659
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2016.07.027?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zuxiong Li & Shengnan Fu & Huili Xiang & Hailing Wang, 2021. "Qualitative Analysis of a Single-Species Model with Distributed Delay and Nonlinear Harvest," Mathematics, MDPI, vol. 9(20), pages 1-26, October.
    2. Jang, Geunsoo & Cho, Giphil, 2022. "Optimal harvest strategy based on a discrete age-structured model with monthly fishing effort for chub mackerel, Scomber japonicus, in South Korea," Applied Mathematics and Computation, Elsevier, vol. 425(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:292:y:2017:i:c:p:145-155. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.