Sufficiency and Duality in Control Problems with Generalized Invexity

نویسنده

  • I. HUSAIN
چکیده

Sufficient optimality criteria are derived for a control problem under generalized invexity. A Mond-Weir type dual to the control problem is proposed and various duality theorems are validated under generalized invexity assumptions on functionals appearing in the problems. It is pointed out that these results can be applied to the control problem with free boundary conditions and have linkage with results for nonlinear programming problems in the presence of inequality and equality constraints already established in the literature.

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

ثبت نام

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

منابع مشابه

Sufficiency and duality for a nonsmooth vector optimization problem with generalized $alpha$-$d_{I}$-type-I univexity over cones‎

In this paper, using Clarke’s generalized directional derivative and dI-invexity we introduce new concepts of nonsmooth K-α-dI-invex and generalized type I univex functions over cones for a nonsmooth vector optimization problem with cone constraints. We obtain some sufficient optimality conditions and Mond-Weir type duality results under the foresaid generalized invexity and type I cone-univexi...

متن کامل

Sufficiency and Duality in Minimax Fractional Programming with Generalized (φ, Ρ)-invexity

Amongst various important applications, one important application of nonlinear programming is to maximize or minimize the ratio of two functions, commonly called fractional programming. The characteristics of fractional programming problems have been investigated widely [1, 6, 10] and [13]. In noneconomic situations, fractional programming problems arisen in information theory, stochastic progr...

متن کامل

Sufficiency and Duality of Fractional Integral Programming with Generalized Invexity

Convexity assumptions for fractional programming of variational type are relaxed to generalized invexity. The sufficient optimality conditions are employed to construct a mixed dual programming problem. It will involve the Wolfe type dual and Mond-Weir type dual as its special situations. Several duality theorems concerning weak, strong, and strict converse duality under the framework in mixed ...

متن کامل

On efficiency and mixed duality for a new class of nonconvex multiobjective variational control problems

In this paper, we extend the notions of ( , ρ)-invexity and generalized ( , ρ)invexity to the continuous case and we use these concepts to establish sufficient optimality conditions for the considered class of nonconvexmultiobjective variational control problems. Further, multiobjective variational control mixed dual problem is given for the considered multiobjective variational control problem...

متن کامل

Symmetric duality for multiobjective fractional variational problems with generalized invexity

The concept of symmetric duality for multiobjective fractional problems has been extended to the class of multiobjective variational problems. Weak, strong and converse duality theorems are proved under generalized invexity assumptions. A close relationship between these problems and multiobjective fractional symmetric dual problems is also presented. 2005 Elsevier Inc. All rights reserved.

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2008