IDEAS home Printed from https://ideas.repec.org/a/hin/jnljam/983643.html
   My bibliography  Save this article

Pareto Optimality Conditions and Duality for Vector Quadratic Fractional Optimization Problems

Author

Listed:
  • W. A. Oliveira
  • A. Beato-Moreno
  • A. C. Moretti
  • L. L. Salles Neto

Abstract

One of the most important optimality conditions to aid in solving a vector optimization problem is the first-order necessary optimality condition that generalizes the Karush-Kuhn-Tucker condition. However, to obtain the sufficient optimality conditions, it is necessary to impose additional assumptions on the objective functions and on the constraint set. The present work is concerned with the constrained vector quadratic fractional optimization problem. It shows that sufficient Pareto optimality conditions and the main duality theorems can be established without the assumption of generalized convexity in the objective functions, by considering some assumptions on a linear combination of Hessian matrices instead. The main aspect of this contribution is the development of Pareto optimality conditions based on a similar second-order sufficient condition for problems with convex constraints, without convexity assumptions on the objective functions. These conditions might be useful to determine termination criteria in the development of algorithms.

Suggested Citation

  • W. A. Oliveira & A. Beato-Moreno & A. C. Moretti & L. L. Salles Neto, 2014. "Pareto Optimality Conditions and Duality for Vector Quadratic Fractional Optimization Problems," Journal of Applied Mathematics, Hindawi, vol. 2014, pages 1-13, November.
    • Handle: RePEc:hin:jnljam:983643
    DOI: 10.1155/2014/983643
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/JAM/2014/983643.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/JAM/2014/983643.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/983643?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnljam:983643. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.