IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-540-37007-9_13.html
   My bibliography  Save this book chapter

Higher Order Properly Efficient Points in Vector Optimization

In: Generalized Convexity and Related Topics

Author

Listed:
  • Ivan Ginchev

    (Technical University of Varna)

  • Angelo Guerraggio

    (University of Insubria)

  • Matteo Rocca

    (University of Insubria)

Abstract

Summary We consider the constrained vector optimization problem minC f(x), g(x) ∈ − K, where f: ℝn → ℝm and g : ℝn → ℝp are given functions and C ∈ ℝm and K ∈ ℝp are closed convex cones. Two type of solutions are important for our considerations, namely i-minimizers (isolated minimizers) of order k and pminimizers (properly efficient points) of order k (see e.g. [11]). Every i-minimizer of order k ≥ 1 is a p-minimizer of order k. For k = 1, conditions under which the reversal of this statement holds have been given in [11]. In this paper we investigate the possible reversal of the implication i-minimizer ⇒ p-minimizer in the case k = 2. To carry on this study, we develop second-order optimality conditions for p-minimizers, expressed by means of Dini derivatives. Together with the optimality conditions obtained in [11] and [12] in the case of i-minimizers, they play a crucial role in the investigation. Further, to get a satisfactory answer to the posed reversal problem, we deal with sense I and sense II solution concepts, as defined in [11] and [5].

Suggested Citation

  • Ivan Ginchev & Angelo Guerraggio & Matteo Rocca, 2007. "Higher Order Properly Efficient Points in Vector Optimization," Lecture Notes in Economics and Mathematical Systems, in: Generalized Convexity and Related Topics, pages 227-245, Springer.
    • Handle: RePEc:spr:lnechp:978-3-540-37007-9_13
    DOI: 10.1007/978-3-540-37007-9_13
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:lnechp:978-3-540-37007-9_13. 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.