Results 91 to 100 of about 565 (171)
On the Continuity of the Kernel of Invex Functions
Journal of Mathematical Analysis and Applications, 1996 A differentiable real function is invex on a domain \(C\) if \(f(x)- f(u) \geq\eta(x,u)^T \nabla f(u)\) for all \(x,u\) in \(C\). Examples are given where the kernel \(\eta(.,.)\) is required to be continuous; and sufficient conditions are obtained for a continuous \(\eta\) to exist, or to not exist.
openaire +2 more sources
Higher-Order Duality for Multiobjective Programming Involving (Φ , ρ)-Invexity
, 2016 [[abstract]]The concepts of ( Φ , ρ)-invexity have been given by Caristi, Ferrara and Stefanescu[32]. We consider a higher-order dual model associated to a multiobjective programming problem involving support functions and a weak duality result is ...
Deo Brat Ojha
core
New Integral Inequalities through Invexity with Applications
International Journal of Analysis and Applications, 2014 In this paper, we obtain some inequalities of Simpson’s inequality type for functions whose derivatives absolute values are quasi-preinvex function. Applications to some special means are considered.
Shahid Qaisar +2 more
doaj +2 more sources
Optimality Conditions for Nondifferentiable Multiobjective Semi-Infinite Programming Problems
Abstract and Applied Analysis, 2016 We have considered a multiobjective semi-infinite programming problem with a feasible set defined by inequality constraints. First we studied a Fritz-John type necessary condition. Then, we introduced two constraint qualifications and derive the weak and
D. Barilla, G. Caristi, A. Puglisi
doaj +1 more source
PROPER AND ISOLATED EFFICIENCIES IN MULTIOBJECTIVE OPTIMIZATION PROBLEMS
Tạp chí Khoa học Đại học Đà Lạt, 2012 We employ some advanced tools of variational analysis and generalised differentiation such as the nonsmooth version of Fermat's rule, the limiting sub-differential of maximum functions, and the sum rules for the Frechet and Mordukhovich sub-differentials
Thái Doãn Chương
doaj +1 more source
Nondifferentiable higher order symmetric duality under invexity/generalized invexity
Filomat, 2014 In this paper, we introduce a pair of nondifferentiable higher-order symmetric dual models. Weak, strong and converse duality theorems for this pair are established under the assumption of higher order invexity/generalized invexity. Self duality has been discussed assuming the function involved to be skew-symmetric.
T.R. Gulati, Khushboo Verma
openaire +2 more sources
, 2021 In this paper, we derive sufficient condition for global optimality for a nonsmooth semi-infinite mathematical program with equilibrium constraints involving generalized invexity of order σ > 0 assumptions.
Bhuwan Chandra Joshi
core +1 more source
On Nonsmooth Semi-Infinite Minimax Programming Problem with (Φ, )-Invexity [PDF]
, 2020 We are interested in a nonsmooth minimax programming Problem (SIP). Firstly, we establish the necessary optimality conditions theorems for Problem (SIP) when using the well-known Caratheodory's theorem. Under the Lipschitz (Φ, )-invexity assumptions,
X L Liu, C Q Xu, G M Lai, D H Yuan
core
Taiwanese Journal of Mathematics, 2010 Necessary Lagrangian conditions for a constrained minimum become sufficient under generalized convex assumptions, in particular invex, and duality results follow. Many classes of vector functions with properties related to invex have been studied, but It has not been clear how far these classes are distinct. Various inclusions between these classes are
openaire +2 more sources
Proximal methods with invexity and fractional calculus
, 2017 We present some proximal methods with invexity results involving fractional ...
Anastassiou, George A. +2 more
core