IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v87y2023i2d10.1007_s10898-022-01158-8.html
   My bibliography  Save this article

Multiobjective optimization with least constraint violation: optimality conditions and exact penalization

Author

Listed:
  • Jiawei Chen

    (Southwest University)

  • Yu-Hong Dai

    (Chinese Academy of Sciences
    University of Chinese Academy of Sciences)

Abstract

Although multiobjective optimization problem (MOP) is useful for solving many practical optimization problems, it is possible that the constraints are inconsistent. In this paper, we reformulate MOP with possible inconsistent constraints into MOP with least constraint violation and provide necessary optimality conditions from the perspective of M-stationary point, Fritz-John stationary point and L-stationary point. A power penalty problem is proposed by using infeasibility measure of constraints. The calmness conditions of order $$\ell $$ ℓ of the MOP with least constraint violation and the local exact penalization of order $$\ell $$ ℓ of the power penalty problem are respectively introduced, which do not require the feasibility of the original MOP. We obtain the equivalence between the calmness of order $$\ell $$ ℓ of the MOP with least constraint violation and the local exact penalization of order $$\ell $$ ℓ of the power penalty problem. Necessary and sufficient conditions for calmness of order $$\ell $$ ℓ are also established under suitable conditions.

Suggested Citation

  • Jiawei Chen & Yu-Hong Dai, 2023. "Multiobjective optimization with least constraint violation: optimality conditions and exact penalization," Journal of Global Optimization, Springer, vol. 87(2), pages 807-830, November.
    • Handle: RePEc:spr:jglopt:v:87:y:2023:i:2:d:10.1007_s10898-022-01158-8
    DOI: 10.1007/s10898-022-01158-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-022-01158-8
    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/s10898-022-01158-8?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:jglopt:v:87:y:2023:i:2:d:10.1007_s10898-022-01158-8. 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.