Open Access
Translator Disclaimer
2014 Pareto Optimality Conditions and Duality for Vector Quadratic Fractional Optimization Problems
W. A. Oliveira, A. Beato-Moreno, A. C. Moretti, L. L. Salles Neto
J. Appl. Math. 2014: 1-13 (2014). DOI: 10.1155/2014/983643

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.

Citation

Download Citation

W. A. Oliveira. A. Beato-Moreno. A. C. Moretti. L. L. Salles Neto. "Pareto Optimality Conditions and Duality for Vector Quadratic Fractional Optimization Problems." J. Appl. Math. 2014 1 - 13, 2014. https://doi.org/10.1155/2014/983643

Information

Published: 2014
First available in Project Euclid: 2 March 2015

zbMATH: 07132036
MathSciNet: MR3285193
Digital Object Identifier: 10.1155/2014/983643

Rights: Copyright © 2014 Hindawi

JOURNAL ARTICLE
13 PAGES


SHARE
Vol.2014 • 2014
Back to Top