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

Note on some periodic optimal harvesting problems for age-structured population dynamics

Author

Listed:
  • Aniţa, Laura-Iulia
  • Aniţa, Sebastian

Abstract

We consider two optimal harvesting problems related to age-structured population dynamics with logistic term and time-periodic (of period T) control and vital rates. We derive the first order necessary optimality conditions for both problems. We prove that in the particular case of time-independent vital rates and under a natural hypothesis on the logistic term, the optimal control for the first problem is constant. The second problem concerns the constant harvesting efforts which act on subintervals of [0, T]. The maximizing here is treated with respect to the subinterval where the control acts. We find the directional derivative of the cost functional. Some final comments concerning the population dynamics with diffusion are given as well.

Suggested Citation

  • Aniţa, Laura-Iulia & Aniţa, Sebastian, 2016. "Note on some periodic optimal harvesting problems for age-structured population dynamics," Applied Mathematics and Computation, Elsevier, vol. 276(C), pages 21-30.
    • Handle: RePEc:eee:apmaco:v:276:y:2016:i:c:p:21-30
    DOI: 10.1016/j.amc.2015.12.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315016136
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2015.12.010?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.

    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:276:y:2016:i:c:p:21-30. 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.