Results 41 to 50 of about 358 (190)
Semi-invex functions and their subdifferentials [PDF]
We introduce the notion of semi-invex function (non-smooth) and the associated subdifferential. We study their properties and establish the conditions for optimality in constrained and unconstrained minimisation problems.
Dutta, J., Vetrivel, V., Nanda, S.
openaire +2 more sources
Invexity of supremum and infimum functions [PDF]
Under suitable assumptions we establish the formulas for calculating generalised gradients and generalised directional derivatives in the Clarke sense of the supremum and the infimum of an infinite family of Lipschitz functions. From these results we derive the results ensuring such a supremum or infimum are an invex function when all functions of the ...
Nguyen Xuan Ha, Do Van Luu
openaire +2 more sources
Second-order duality for invex composite optimization [PDF]
The second-order duality results for the invex composite optimization problem are studied. Its objective function is a composition of nonfinite valued differentiable invex and a vector valued functions. Several duality results are also discussed for both
Nahak, Chandal, Padhan, Saroj Kumar
core +1 more source
Nonlinear programming problem for strongly [PDF]
The concepts of strongly E-invex sets, strongly E-invex, strongly E-preinvex, and strongly pseudo E-preinvex functions are introduced in this paper. We have included several non-trivial examples to support our definitions.
Akhlad Iqbal, Askar Hussain
core +1 more source
E-B-invexity in E-differentiable mathematical programming
In this paper, a new concept of generalized convexity is introduced for (not necessarily) differentiable optimization problem with E-differentiable functions. Namely, for an E-differentiable function, the concept of E-B-invexity is defined.
Najeeb Abdulaleem
doaj +1 more source
Generalized Differentiable -Invex Functions and Their Applications in Optimization [PDF]
The concept of -convex function and its generalizations is studied with differentiability assumption. Generalized differentiable -convexity and generalized differentiable -invexity are used to derive the existence of optimal solution of a general optimization problem.
Sangeeta Jaiswal, Geetanjali Panda
openaire +1 more source
The theory of convexity pertaining to fractional calculus is a well-established concept that has attracted significant attention in mathematics and various scientific disciplines for over a century.
Muhammad Tariq +5 more
doaj +1 more source
The method of Weighted Multi objective Fractional Linear Programming Problem (MOFLPP) [PDF]
More theories and algorithms in non-linear programming with titles convexity (Convex). When the objective function is fractional function, will not have to have any swelling, but can get other good properties have a role in the development of algorithms ...
Waleed Khalid Jaber, Zeanab k. jabar
doaj +1 more source
Minimax fractional semi-infinite programming is an important research direction for semi-infinite programming, and has a wide range of applications, such as military allocation problems, economic theory, cooperative games, and other fields.
Hong Yang, Angang Cui
doaj +1 more source
A class of generalized invex functions and vector variational-like inequalities
In this paper, a class of generalized invex functions, called ( α , ρ , η ) $(\alpha,\rho,\eta)$ -invex functions, is introduced, and some examples are presented to illustrate their existence.
Ru Li, Guolin Yu
doaj +1 more source

