Results 1  10
of
59
SYMMETRIC DUALITY FOR MULTIOBJECTIVE VARIATIONAL PROBLEMS WITH PSEUDOINVEXITY* Do SANG $\mathrm{I}\backslash \mathrm{I}\mathrm{M}\nearrow $ , GUE MYUNG LEE
"... Dantzig, Eisenberg and Cottle [1] first $\mathrm{f}\mathrm{c}$) $\mathrm{r}\mathrm{l}\mathrm{l}\mathrm{l}\iota$latecl a $1$) $\mathrm{a}\mathrm{i}\mathrm{r} $ of symmetric dual nonlinear programs in $\mathrm{w}\mathrm{h}\mathrm{i}\mathrm{c}1_{1} $ the dual of dual equals the $1$) $\mathrm{r}\mathrm{ ..."
Abstract
 Add to MetaCart
Dantzig, Eisenberg and Cottle [1] first $\mathrm{f}\mathrm{c}$) $\mathrm{r}\mathrm{l}\mathrm{l}\mathrm{l}\iota$latecl a $1$) $\mathrm{a}\mathrm{i}\mathrm{r} $ of symmetric dual nonlinear programs in $\mathrm{w}\mathrm{h}\mathrm{i}\mathrm{c}1_{1} $ the dual of dual equals the $1$) $\mathrm
Nondifferentiable multiobjective programming under generalized dunivexity
, 2005
"... In this paper, we are concerned with a nondifferentiable multiobjective programming problem with inequality constraints. We introduce four new classes of generalized convex functions by combining the concepts of weak strictly pseudoinvex, strong pseudoinvex, weak quasi invex, weak pseudoinvex and st ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
In this paper, we are concerned with a nondifferentiable multiobjective programming problem with inequality constraints. We introduce four new classes of generalized convex functions by combining the concepts of weak strictly pseudoinvex, strong pseudoinvex, weak quasi invex, weak pseudoinvex
Duality of Fractional Integral Programming with Generalized Invexity*)
"... A new dual type for ratio of integral variational programming is constructed by mixing the Wolfe type dual and MondWeir type dual problem. The existence $th\infty rem $ for optimal solution for the mixed programming problem is then established from necessary optimality conditions by using extra as ..."
Abstract
 Add to MetaCart
A new dual type for ratio of integral variational programming is constructed by mixing the Wolfe type dual and MondWeir type dual problem. The existence $th\infty rem $ for optimal solution for the mixed programming problem is then established from necessary optimality conditions by using extra
Invex functions and duality
 A
, 1985
"... For both differentiable and nondifferentiable functions defined in abstract spaces we characterize the generalized convex property, here called coneinvexity, in terms of Lagrange multipliers. Several classes of such functions are given. In addition an extended KuhnTucker type optimality condition ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
and a duality result are obtained for quasidifferentiable programming problems. 1980 Mathematics subject classification (Amer. Math. Soc): 90 C 30. 1.
Management Sciences
"... m Abstract: A few KarushKuhnTucker type of sufficient optimality conditions are given in this paper for nonsmooth continuoustime nonlinear multiobjective optimization problems in the Banach space L n ∞ [0, T] of all ndimensional vectorvalued Lebesgue measurable functions which are essentially ..."
Abstract
 Add to MetaCart
bounded, using Clarke regularity and generalized convexity. Further, we establish duality theorems for Wolfe and MondWeir types of dual problems under the assumptions of invexity, pseudoinvexity and quasiinvexity on the functions involved. Key–Words: Multiobjective optimization; Nonsmooth Optimization
Generalized Invexity of Higher Order and Its Applications in Variational Problems
"... In the present paper the definition of invexity for continuous functions is extended to invexity of order m which is further generalized to ρpseudoinvexity type I of order m, ρpseudoinvexity type II of order m, as well as ρquasi invexity type I of order m and ρquasiinvexity type II of order m. T ..."
Abstract
 Add to MetaCart
In the present paper the definition of invexity for continuous functions is extended to invexity of order m which is further generalized to ρpseudoinvexity type I of order m, ρpseudoinvexity type II of order m, as well as ρquasi invexity type I of order m and ρquasiinvexity type II of order m
OPTIMALITY AND DUALITY FOR A CLASS OF NONDIFFERENTIABLE MINIMAX FRACTIONAL PROGRAMMING PROBLEMS
, 2007
"... Abstract: Necessary and sufficient optimality conditions are established for a class of nondifferentiable minimax fractional programming problems with square root terms. Subsequently, we apply the optimality conditions to formulate a parametric dual problem and we prove some duality results. ..."
Abstract
 Add to MetaCart
Abstract: Necessary and sufficient optimality conditions are established for a class of nondifferentiable minimax fractional programming problems with square root terms. Subsequently, we apply the optimality conditions to formulate a parametric dual problem and we prove some duality results.
MULTIOBJECTIVE DUALITY WITH ρ − (η,θ)INVEXITY
, 2004
"... Under ρ − (η,θ)invexity assumptions on the functions involved, weak, strong, and converse duality theorems are proved to relate properly efficient solutions of the primal and dual problems for a multiobjective programming problem. 1. ..."
Abstract
 Add to MetaCart
Under ρ − (η,θ)invexity assumptions on the functions involved, weak, strong, and converse duality theorems are proved to relate properly efficient solutions of the primal and dual problems for a multiobjective programming problem. 1.
SUFFICIENCY AND DUALITY IN CONTROL PROBLEMS WITH GENERALIZED INVEXITY
, 2006
"... Abstract. Sufficient optimality criteria are derived for a control problem under generalized invexity. A MondWeir 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 ..."
Abstract
 Add to MetaCart
Abstract. Sufficient optimality criteria are derived for a control problem under generalized invexity. A MondWeir 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
SECONDORDER DUALITY FOR MULTIOBJECTIVE PROGRAMMING INVOLVING ( � , ρ)INVEXITY
"... Abstract: The concepts of ( � , ρ)invexity have been given by Caristi, Ferrara and Stefanescu[1]. We consider a secondorder dual model associated to a multiobjective programming problem involving support functions and a weak duality result is established under appropriate secondorder ( � , ρ)in ..."
Abstract
 Add to MetaCart
Abstract: The concepts of ( � , ρ)invexity have been given by Caristi, Ferrara and Stefanescu[1]. We consider a secondorder dual model associated to a multiobjective programming problem involving support functions and a weak duality result is established under appropriate secondorder ( � , ρ)invexity
Results 1  10
of
59