IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v199y2023i3d10.1007_s10957-023-02246-9.html
   My bibliography  Save this article

Optimal Contraception Control Problems in a Nonlinear Size-Structured Vermin Model

Author

Listed:
  • Rong Liu

    (Shanxi University of Finance and Economics)

  • Fengqin Zhang

    (Yuncheng University)

  • Yuming Chen

    (Wilfrid Laurier University)

Abstract

This paper investigates a size-structured vermin contraception control model with nonlinear fertility and mortality, in which the control variable appears in both the state equation and the boundary condition. First, we show that the model has a unique non-negative solution, which has a separable form. Then, some continuity results are established, which are important for the purpose of optimal control. In order to make the final size of vermin as small as possible or as close as possible to the ideal distribution under the condition of the lowest control cost, we consider the least cost-size problem and the least cost-deviation problem. For each of the control problems, the optimality conditions are obtained via the adjoint system and tangent-normal cones. For the first problem, we show the existence of the optimal strategy by compactness and extremal sequence. However, for the second problem, we derive the existence of an optimal control via Ekeland’s variational principle. Some numerical simulations have been performed to demonstrate the feasibility of the obtained theoretical results. Numerical results also suggest that decreasing the reproductive rate instead of increasing the mortality is an effective way of managing the impact of vermin.

Suggested Citation

  • Rong Liu & Fengqin Zhang & Yuming Chen, 2023. "Optimal Contraception Control Problems in a Nonlinear Size-Structured Vermin Model," Journal of Optimization Theory and Applications, Springer, vol. 199(3), pages 1188-1221, December.
    • Handle: RePEc:spr:joptap:v:199:y:2023:i:3:d:10.1007_s10957-023-02246-9
    DOI: 10.1007/s10957-023-02246-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-023-02246-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-023-02246-9?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:spr:joptap:v:199:y:2023:i:3:d:10.1007_s10957-023-02246-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.