Results 31 to 40 of about 431 (190)
Semi-invex functions and their subdifferentials [PDF]
Bulletin of the Australian Mathematical Society, 1997 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
Duality results on mathematical programs with vanishing constraints involving generalized invex functions [PDF]
, 2023 In the here presented research, we investigate Wolfe and Mond-Weir duality models applied to a specific category of generalized convex functions known as p-invex functions. We establish various dualities between the primal MPVC and itsWolfe type dual, as
Joshi, Bhuwan Chandra
core +1 more source
Optimality conditions and duality in multiobjective programming with invexity [PDF]
Yugoslav Journal of Operations Research, 2008 (', ρ)-invexity has recently been introduced with the intent of generalizing invex functions in mathematical programming. Using such conditions we obtain new sufficiency results for optimality in multiobjective programming and extend some classical ...
Ferrara Massimiliano +1 more
doaj +1 more source
On Constraint Qualifications and Optimality Conditions in Nonsmooth Semi-infinite Optimization [PDF]
Control and Optimization in Applied MathematicsThe primary objective of this paper is to enhance several well-known geometric constraint qualifications and necessary optimality conditions for nonsmooth semi-infinite optimization problems (SIPs).
Atefeh Hassani Bafrani
doaj +1 more source
Nonsmooth semi-infinite roughly B-invex multi-objective programming problems
Results in Control and Optimization, 2023 In this paper, we will study a nonsmooth semi-infinite multi-objective programming problem involving roughly B-invex functions. Sufficient optimality conditions for the primal problem are derived. We shall formulate Mond–Weir type dual and establish weak
Tarek Emam
doaj +1 more source
Invexity of supremum and infimum functions [PDF]
Bulletin of the Australian Mathematical Society, 2002 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
Generalized Differentiable -Invex Functions and Their Applications in Optimization [PDF]
Advances in Operations Research, 2012 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
On a Nonsmooth Vector Optimization Problem with Generalized Cone Invexity
Abstract and Applied Analysis, 2012 By using Clarke’s generalized gradients we consider a nonsmooth vector optimization problem with cone constraints and introduce some generalized cone-invex functions called K-α-generalized invex, K-α-nonsmooth invex, and other related functions.
Hehua Jiao, Sanyang Liu
doaj +1 more source
Nonsmooth Multiobjective Fractional Programming with Local Lipschitz Exponential B-p,r-Invexity
Journal of Applied Mathematics, 2013 We study nonsmooth multiobjective fractional programming problem containing local Lipschitz exponential B-p,r-invex functions with respect to η and b. We introduce a new concept of nonconvex functions, called exponential B-p,r-invex functions.
Shun-Chin Ho
doaj +1 more source
Logarithmic penalty function method for invex multi-objective fractional programming problems
Journal of Taibah University for Science, 2020 In this paper, a new logarithmic penalty function method is used for solving nonlinear multi-objective fractional programming problems (MOFPP) involving invex objectives and constraints functions with respect to the same function η.
Mansur Hassan +2 more
doaj +1 more source