Title

d-rho-(eta, theta)-invexity in multiobjective optimization

Authors

Authors

C. Nahak;R. N. Mohapatra

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

Nonlinear Anal.-Theory Methods Appl.

Keywords

Multiobjective problem; d-rho-(eta, theta)-invexity; Efficiency; Proper; efficiency; Duality; D-INVEXITY; SUFFICIENCY; DUALITY; Mathematics, Applied; Mathematics

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-rho-(eta, theta)-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. (C) 2008 Elsevier Ltd. All rights reserved.

Journal Title

Nonlinear Analysis-Theory Methods & Applications

Volume

70

Issue/Number

6

Publication Date

1-1-2009

Document Type

Article

Language

English

First Page

2288

Last Page

2296

WOS Identifier

WOS:000264005100015

ISSN

0362-546X

Share

COinS