Results 31 to 40 of about 66 (53)
Multiobjective duality with ρ − (η, θ)‐invexity
International Journal of Stochastic Analysis, Volume 2005, Issue 2, Page 175-180, 2005., 2005 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]
Springerplus, 2016 Verma RU, Seol Y.
europepmc +1 more source
A class of generalized invex functions and vector variational-like inequalities. [PDF]
J Inequal Appl, 2017 Li R, Yu G.
europepmc +1 more source
Some of the next articles are maybe not open access.
Higher order invex functions and higher order pseudoinvex ones
Applicable Analysis, 2013In this article we introduce a notion of a higher order invex scalar function in terms of the higher order lower Dini directional derivatives. This notion differs from the respective ones, applied in duality theory. Higher order invex functions are expanding classes of functions in the sense that every invex function of order n (n is a positive integer)
Vsevolod I Ivanov
exaly +4 more sources
On generalized KT-pseudoinvex control problems involving multiple integral functionals
European Journal of Control, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Savin Treanta, Manuel Arana-Jiménez
openaire +3 more sources
Invex and Pseudoinvex Functions in Multiobjective Programming
Lecture Notes in Economics and Mathematical Systems, 1997D. H. Martin studied the optimality conditions of invex functions in the scalar case. In this work we will generalize his results making them applicable to the vectorial case. We will prove that equivalences between minima and stationary points are still true if we have to optimize p-objective functions instead of one objective function.
R. Osuna-Gómez +3 more
openaire +3 more sources
Optimization, 1996
We establish the Kuhn–Tucker necessary and sufficient conditions for an efficient optimum of nonsmooth multiobjective fractional programming problems containing pseudo–invex functions. Bector type dual for multiobjective fractional programming problem is introduced and certain duality results have been derived in the framework of pseudo–invex ...
openaire +3 more sources
We establish the Kuhn–Tucker necessary and sufficient conditions for an efficient optimum of nonsmooth multiobjective fractional programming problems containing pseudo–invex functions. Bector type dual for multiobjective fractional programming problem is introduced and certain duality results have been derived in the framework of pseudo–invex ...
openaire +3 more sources
On Strong Pseudoinvexity in a Programming Problem Containing Lp Norm in the Objective Function
OPSEARCH, 1999Sufficient conditions for optimality of Kuhn-Tucker type of a programming problem containing Lp norm in the objective function are obtained under strong pseudoinvexity assumptions. Based upon these conditions duality theorems are also established.
openaire +2 more sources
Efficiency in generalised V-KT-pseudoinvex control problems
International Journal of Control, 2020Savin Treanţă
exaly
On Characterizing the Solution Sets of Pseudoinvex Extremum Problems
Journal of Optimization Theory and Applications, 2008Yang X M
exaly