Results 21 to 30 of about 59 (56)

Nonemptiness and Compactness of Solutions Set for Nondifferentiable Multiobjective Optimization Problems

open access: yesJournal of Applied Mathematics, Volume 2011, Issue 1, 2011., 2011
A nondifferentiable multiobjective optimization problem with nonempty set constraints is considered, and the equivalence of weakly efficient solutions, the critical points for the nondifferentiable multiobjective optimization problems, and solutions for vector variational‐like inequalities is established under some suitable conditions. Nonemptiness and
Xin-kun Wu   +3 more
wiley   +1 more source

On Properties of Geodesic η‐Preinvex Functions

open access: yesAdvances in Operations Research, Volume 2009, Issue 1, 2009., 2009
The present paper deals with the properties of geodesic η‐preinvex functions and their relationships with η‐invex functions and strictly geodesic η‐preinvex functions. The geodesic η‐pre‐pseudo‐invex and geodesic η‐pre‐quasi‐invex functions on the geodesic invex set are introduced and some of their properties are discussed.
I. Ahmad   +3 more
wiley   +1 more source

Continuous‐Time Multiobjective Optimization Problems via Invexity

open access: yesAbstract and Applied Analysis, Volume 2007, Issue 1, 2007., 2007
We introduce some concepts of generalized invexity for the continuous‐time multiobjective programming problems, namely, the concepts of Karush‐Kuhn‐Tucker invexity and Karush‐Kuhn‐Tucker pseudoinvexity. Using the concept of Karush‐Kuhn‐Tucker invexity, we study the relationship of the multiobjective problems with some related scalar problems.
Valeriano A. De Oliveira   +2 more
wiley   +1 more source

Generalized preinvex functions and their properties

open access: yesInternational Journal of Stochastic Analysis, Volume 2006, Issue 1, 2006., 2006
We introduce some new classes of preinvex and invex functions, which are called ϕ‐preinvex and ϕ‐invex functions. We study some properties of these classes of ϕ‐preinvex (ϕ‐invex) functions. In particular, we establish the equivalence among the ϕ‐preinvex functions, ϕ‐invex functions, and ϕη‐monotonicity of their differential under some suitable ...
Muhammad Aslam Noor, Khalida Inayat Noor
wiley   +1 more source

Duality for multiobjective variational control and multiobjective fractional variational control problems with pseudoinvexity

open access: yesInternational Journal of Stochastic Analysis, Volume 2006, Issue 1, 2006., 2006
A class of multiobjective variational control and multiobjective fractional variational control problems is considered, and the duality results are formulated. Under pseudoinvexity assumptions on the functions involved, weak, strong, and converse duality theorems are proved.
C. Nahak
wiley   +1 more source

Generalized (𝔉, b, ϕ, ρ, θ)‐univex n‐set functions and global parametric sufficient optimality conditions in minmax fractional subset programming

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 2005, Issue 8, Page 1253-1276, 2005., 2005
We first define a new class of generalized convex n‐set functions, called (𝔉, b, ϕ, ρ, θ)‐univex functions, and then establish a fairly large number of global parametric sufficient optimality conditions under a variety of generalized (𝔉, b, ϕ, ρ, θ)‐univexity assumptions for a discrete minmax fractional subset programming problem.
G. J. Zalmai
wiley   +1 more source

Generalized (ℱ, b, φ, ρ, θ)‐univex n‐set functions and global semiparametric sufficient efficiency conditions in multiobjective fractional subset programming

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 2005, Issue 6, Page 949-973, 2005., 2005
A fairly large number of global semiparametric sufficient efficiency results are established under various generalized (ℱ, b, φ, ρ, θ)‐univexity assumptions for a multiobjective fractional subset programming problem.
G. J. Zalmai
wiley   +1 more source

Multiobjective duality with ρ − (η, θ)‐invexity

open access: yesInternational Journal of Stochastic Analysis, Volume 2005, Issue 2, Page 175-180, 2005., 2005
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.
C. Nahak, S. Nanda
wiley   +1 more source

Home - About - Disclaimer - Privacy