Optimality conditions and duality in multiobjective programming with invexity

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimality Conditions and Duality in Multiobjective Programming with Invexity*

( , ) ρ Φ − invexity has recently been introduced with the intent of generalizing invex functions in mathematical programming. Using such conditions we obtain new sufficiency results for optimality in multiobjective programming and extend some classical duality properties.

متن کامل

Generalized Invexity and Duality in Multiobjective Programming Problems

In this paper we consider a multiobjective optimization problem, and we prove Mond-Weir duality results under second-and higher-order conditions of the objective and constraint functions.

متن کامل

Multiobjective Mixed Symmetric Duality with Invexity

The usual duality results are established for mixed symmetric multiobjective dual programs without nonnegativity constraints using the notion of invexity/ generalized invexity which has allowed weakening various types of convexity/ generalized convexity assumptions. This mixed symmetric dual formulation unifies two existing symmetric dual formulations in the literature.

متن کامل

New optimality conditions for multiobjective fuzzy programming problems

In this paper we study fuzzy multiobjective optimization problems defined for $n$ variables.  Based on a new $p$-dimensional fuzzy stationary-point definition,  necessary  efficiency conditions are obtained.  And we prove that these conditions are also sufficient under new fuzzy generalized convexity notions. Furthermore, the results are obtained under general differentiability hypothesis.

متن کامل

Semi-infinite Multiobjective Programming with Generalized Invexity

Motivated by important applications, the theory of mathematical programming has been extended to the case of infinitely many restrictions. At the same time, this theory knew remarcable developments since invexity and its further generalizations have been introduced as substitute of convexity. Here, we consider the multiobjective programming with a set of restrictions indexed in a compact. We ob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: YUJOR

سال: 2008

ISSN: 0354-0243,1820-743X

DOI: 10.2298/yjor0802153f