Search

In this paper, the concept of second order generalized α-type I univexity is introduced. Based on the new definitions, we derive weak, strong and strict converse duality results for two second order duals of a minmax fractional programming problem. [ABSTRACT FROM AUTHOR]

In this paper, new classes of generalized (F,α,ρ, d)-V -type I functions are introduced for differentiable multiobjective programming problems. Based upon these generalized convex functions, sufficient optimality conditions are established. Weak, strong and strict converse duality theorems are also derived for Wolfe and Mond-Weir type multiobjective dual programs. [ABSTRACT FROM AUTHOR]

In this paper, a new class of second-order (F, α, ρ, d)-V-type I functions is introduced that generalizes the notion of (F, α, ρ, θ)-V-convex functions introduced by Zalmai (Computers Math. Appl. 2002; 43:1489-1520) and (F, α, ρ, p, d)-type I functions defined by Hachimi and Aghezzaf (Numer. Funct. Anal. Optim. 2004; 25:725-736). Based on these functions, weak, strong, and strict converse duality theorems are derived for Wolfe and Mond-Weir type multiobjective dual programs in order to relate the efficient and weak efficient solutions of primal and dual problems. [ABSTRACT FROM AUTHOR]

A fractional analogue of Sinha's problem [8] is considered and duality theory is developed for it. This duality subsumes duality results of Chadha [3] and Sinha [8], and gives a dual to the minimum risk problem of stochastic programming studied by Bergthaller [1]. [ABSTRACT FROM AUTHOR]