Results 21 to 30 of about 59 (56)
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
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
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
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
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
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
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
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
Role of exponential type random invexities for asymptotically sufficient efficiency conditions in semi-infinite multi-objective fractional programming. [PDF]
Verma RU, Seol Y.
europepmc +1 more source
A class of generalized invex functions and vector variational-like inequalities. [PDF]
Li R, Yu G.
europepmc +1 more source

