(p,r)-Invex Sets and Functions [PDF]
Journal of Mathematical Analysis and Applications, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tadeusz Antczak
exaly +6 more sources
Generalized logarithmic penalty function method for solving smooth nonlinear programming involving invex functions [PDF]
Arab Journal of Basic and Applied Sciences, 2019 In this paper, we have reviewed some penalty function methods for solving constrained optimization problems in the literature and proposed a continuously differentiable logarithmic penalty function which consists of the proposed logarithmic penalty ...
Mansur Hassan, Adam Baharum
doaj +3 more sources
Invex sets and preinvex functions on Riemannian manifolds [PDF]
Journal of Mathematical Analysis and Applications, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ali Barani
exaly +3 more sources
Higher order duality in multiobjective fractional programming problem with generalized convexity [PDF]
Yugoslav Journal of Operations Research, 2017 We have introduced higher order generalized hybrid B -(b,ρ,θ,˜ρ,˜r)-invex function. Then, we have estabilished higher order weak, strong and strict converse duality theorems for a multiobjective fractional programming problem with support ...
Pankaj, Joshi Bhuwan Chandra
doaj +5 more sources
On Invex Sets and Preinvex Functions [PDF]
Journal of Mathematical Analysis and Applications, 1995 Conditions are given when invex implies preinvex. This is generalized to prequasiinvex.
Mohan, S.R., Neogy, S.K.
openaire +3 more sources
Modified Courant-Beltrami penalty function and a duality gap for invex optimization problem [PDF]
International Journal for Simulation and Multidisciplinary Design Optimization, 2019 In this paper, we modified a Courant-Beltrami penalty function method for constrained optimization problem to study a duality for convex nonlinear mathematical programming problems. Karush-Kuhn-Tucker (KKT) optimality conditions for the penalized problem
Hassan Mansur, Baharum Adam
doaj +2 more sources
Duality of (h,φ)-Multiobjective Programming Involving Generalized Invex Functions [PDF]
Journal of Applied Mathematics, 2012 In the setting of Ben-Tal's generalized algebraic operations, this paper deals with Mond-Weir type dual theorems of multiobjective programming problems involving generalized invex functions.
GuoLin Yu
doaj +2 more sources
E-invexity and generalized E-invexity in E-differentiable multiobjective programming [PDF]
ITM Web of Conferences, 2019 In this paper, a new concept of generalized convexity is introduced for not necessarily differentiable vector optimization problems. For an E-differentiable function, the concept of E-invexity is introduced as a generalization of the E-differentiable E ...
Abdulaleem Najeeb
doaj +3 more sources
Optimality Conditions in Nondifferentiable G-Invex Multiobjective Programming [PDF]
Journal of Inequalities and Applications, 2010 We consider a class of nondifferentiable multiobjective programs with inequality and equality constraints in which each component of the objective function contains a term involving the support function of a compact convex set.
Kim HoJung, Seo YouYoung, Kim DoSang
doaj +4 more sources
On the Continuity of the Kernel of Invex Functions [PDF]
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.
Smart, Ian
openaire +3 more sources