• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.111-125
• /
• 2012

In this paper, we introduce new classes of generalized convex n-set functions called $d$-weak strictly pseudo-quasi type-I univex, $d$-strong pseudo-quasi type-I univex and $d$-weak strictly pseudo type-I univex functions and focus our study on multiobjective subset programming problem. Sufficient optimality conditions are obtained under the assumptions of aforesaid functions. Duality results are also established for Mond-Weir and general Mond-Weir type dual problems in which the involved functions satisfy appropriate generalized $d$-type-I univexity conditions.

• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.991-1010
• /
• 2008

A discrete minmax fractional subset programming problem is considered. Various parametric and parameter-free global sufficient optimality conditions and duality results are discussed under generalized ($F,{\alpha},{\rho},{\theta}$)-V-type-I n-set functions.

• Communications of the Korean Mathematical Society
• /
• v.19 no.1
• /
• pp.179-196
• /
• 2004

Mond-Weir type duals for multiobjective variational problems are formulated. Under generalized vector variational type I invexity assumptions on the functions involved, sufficient optimality conditions, weak and strong duality theorems are proved efficient and properly efficient solutions of the primal and dual problems.

• Journal of applied mathematics & informatics
• /
• v.31 no.5_6
• /
• pp.835-852
• /
• 2013

In this paper, we have considered a class of constrained non-smooth multiobjective fractional programming problem involving support functions under generalized convexity. Also, second order Mond Weir type dual and Schaible type dual are discussed and various weak, strong and strict converse duality results are derived under generalized class of second order (F, ${\alpha}$, ${\rho}$, $d$)-V-type I functions. Also, we have illustrated through non-trivial examples that class of second order (F, ${\alpha}$, ${\rho}$, $d$)-V-type I functions extends the definitions of generalized convexity appeared in the literature.

• Journal of applied mathematics & informatics
• /
• v.31 no.1_2
• /
• pp.189-197
• /
• 2013

In this paper, Karush-Kuhn-Tucker type sufficient optimality conditions are obtained for a feasible point of a nonsmooth multiobjective fractional programming problem to be an efficient or properly efficient by using generalized ($F,{\rho},{\sigma}$)-type I functions.

• Communications of the Korean Mathematical Society
• /
• v.9 no.3
• /
• pp.607-616
• /
• 1994

I. M. Gelfand and G. E. Shilov [GS] introduced the Gelfand-Shilov spaces of type S, generalized type S and type W of test functions to investigate the uniqueness of the solutions of the Cauchy problems of partial differential equations. Using the heat kernel method Matsuzawa gave structure theorems for distributions, hyperfunctions and generalized functions in the dual space $(S^s_r)'$ of the Gelfand-Shilov space of type S in [M1, M2 and DM], respectively. Also, we gave structure theorems for ultradistributions, Fourier hyperfunctions in [CK, KCK], respectively.

• Communications of the Korean Mathematical Society
• /
• v.32 no.4
• /
• pp.835-850
• /
• 2017

A remarkably large number of special functions (such as the Gamma and Beta functions, the Gauss hypergeometric function, and so on) have been investigated by many authors. Motivated the works of both works of both Burchnall and Chaundy and Chaundy and very recently, Brychkov and Saad gave interesting generalizations of Appell type functions. In the present sequel to the aforementioned investigations and some of the earlier works listed in the reference, we present some new differential formulas for the generalized Appell's type functions ${\kappa}_i$, $i=1,2,{\ldots},18$ by considering the product of two $_4F_3$ functions.

• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.211-225
• /
• 2004

A mixed type dual to a programming problem containing support functions in a objective as well as constraint functions is formulated and various duality results are validated under generalized convexity and invexity conditions. Several known results are deducted as special cases.

• Journal of applied mathematics & informatics
• /
• v.26 no.1_2
• /
• pp.75-106
• /
• 2008

In this paper, we derive necessary optimality conditions for a continuous programming problem in which both objective and constraint functions contain support functions and is, therefore, nondifferentiable. It is shown that under generalized invexity of functionals, Karush-Kuhn-Tucker type optimality conditions for the continuous programming problem are also sufficient. Using these optimality conditions, we construct dual problems of both Wolfe and Mond-Weir types and validate appropriate duality theorems under invexity and generalized invexity. A mixed type dual is also proposed and duality results are validated under generalized invexity. A special case which often occurs in mathematical programming is that in which the support function is the square root of a positive semidefinite quadratic form. Further, it is also pointed out that our results can be considered as dynamic generalizations of those of (static) nonlinear programming with support functions recently incorporated in the literature.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.2
• /
• pp.541-560
• /
• 2023

Let T be an m-linear Calderón-Zygmund operator. $T_{{\vec{b}S}}$ is the generalized commutator of T with a class of measurable functions {b_i}^∞_i=1. In this paper, we will give some new estimates for $T_{{\vec{b}S}}$ when {b_i}^∞_i=1 belongs to Orlicz-type space and Lipschitz space, respectively.