In this paper, we introduce a new class of generalized convex function, namely, a-pseudounivex function, by combining the concepts of pseudo-univex and α-invex functions. Further, we establish some relationships betw...In this paper, we introduce a new class of generalized convex function, namely, a-pseudounivex function, by combining the concepts of pseudo-univex and α-invex functions. Further, we establish some relationships between vector variational-like inequality problems and vector optimization problems under the assumptions of α-pseudo-univex functions. Results obtained in this paper present a refinement and improvement of previously known results.展开更多
This paper extends the class of generalized type I functions introduced by Aghezzaf and Hachimi(2000) to the context of higher-order case and formulate a number of higher-order duals to a non-differentiable multi-ob...This paper extends the class of generalized type I functions introduced by Aghezzaf and Hachimi(2000) to the context of higher-order case and formulate a number of higher-order duals to a non-differentiable multi-objective programming problem and establishes higher-order duality results under the higher-order generalized type I functions introduced in the present paper, A special case that appears repeatedly in the literature is that the support function is the square root of a positive semi-definite quadratic form. This and other special cases can be readily generated from these results.展开更多
Minimax programming problems involving generalized (p, r)-invex functions are consid- ered. Parametric sufficient optimality conditions and duality results are established under the aforesaid assumptions on the obje...Minimax programming problems involving generalized (p, r)-invex functions are consid- ered. Parametric sufficient optimality conditions and duality results are established under the aforesaid assumptions on the objective and constraint functions.展开更多
基金The research is supported by the Department of Science and Technology,Ministry of Science and Technology,Government of India under the SERC Fast Track Scheme for Young Scientists 2001-2002(No.SR/FTP/MS-22/2001).
文摘In this paper, we introduce a new class of generalized convex function, namely, a-pseudounivex function, by combining the concepts of pseudo-univex and α-invex functions. Further, we establish some relationships between vector variational-like inequality problems and vector optimization problems under the assumptions of α-pseudo-univex functions. Results obtained in this paper present a refinement and improvement of previously known results.
文摘This paper extends the class of generalized type I functions introduced by Aghezzaf and Hachimi(2000) to the context of higher-order case and formulate a number of higher-order duals to a non-differentiable multi-objective programming problem and establishes higher-order duality results under the higher-order generalized type I functions introduced in the present paper, A special case that appears repeatedly in the literature is that the support function is the square root of a positive semi-definite quadratic form. This and other special cases can be readily generated from these results.
文摘Minimax programming problems involving generalized (p, r)-invex functions are consid- ered. Parametric sufficient optimality conditions and duality results are established under the aforesaid assumptions on the objective and constraint functions.