Title

D - Ρ - (Η, Θ)-Invexity In Multiobjective Optimization

Keywords

d - ρ - (η, θ)-invexity; Duality; Efficiency; Multiobjective problem; Proper efficiency

Abstract

In this paper, a generalization of convexity is considered in the case of multiobjective optimization problems, where the functions involved are non-differentiable. Under d - ρ - (η, θ)-invexity assumptions on the functions involved, weak, strong and converse duality results are proved to relate weak Pareto (efficient) solutions of the multiobjective programming problems (PVP), (DVP) and (MWD). We have also established the Karush-Kuhn-Tucker sufficient optimality condition. © 2008 Elsevier Ltd. All rights reserved.

Publication Date

3-15-2009

Publication Title

Nonlinear Analysis, Theory, Methods and Applications

Volume

70

Issue

6

Number of Pages

2288-2296

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/j.na.2008.03.008

Socpus ID

59049089972 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/59049089972

This document is currently not available here.

Share

COinS