Optimality Conditions in Vector Optimization

Duality Theory for the Multiobjective Nonlinear Programming Involving Generalized Convex Functions

Author(s): R. Osuna-Gomezy, M. B. Hernnandez-Jimenez and L. L. Salles Neto

Pp: 105-118 (14)

DOI: 10.2174/978160805110611001010105

* (Excluding Mailing and Handling)

Abstract

In this chapter we present and prove dierent forms of weak, strong and converse duality theorems for the Wolfe and Mond-Weir dual problems associated with the vector optimization problem with constraints, where the vector objective function and the vector function associated with the inequality-type constraints are invex, strictly invex or quasi-invex.

Related Books
© 2024 Bentham Science Publishers | Privacy Policy