Results 31 to 40 of about 59 (56)
Some of the next articles are maybe not open access.
On generalized KT-pseudoinvex control problems involving multiple integral functionals
European Journal of Control, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Treanţă, Savin, Arana-Jiménez, Manuel
openaire +1 more source
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)
openaire +2 more sources
Invex and Pseudoinvex Functions in Multiobjective Programming
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 +1 more source
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 +1 more source
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 +1 more source
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
Integrative oncology: Addressing the global challenges of cancer prevention and treatment
Ca-A Cancer Journal for Clinicians, 2022Jun J Mao,, Msce +2 more
exaly
Multidisciplinary standards of care and recent progress in pancreatic ductal adenocarcinoma
Ca-A Cancer Journal for Clinicians, 2020Aaron J Grossberg +2 more
exaly
Oral complications of cancer and cancer therapy
Ca-A Cancer Journal for Clinicians, 2012Joel B Epstein +2 more
exaly