Results 141 to 150 of about 565 (171)
Some of the next articles are maybe not open access.

On Characterizations of Prequasi-Invex Functions

Journal of Optimization Theory and Applications, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luo, H. Z., Xu, Z. K.
openaire   +2 more sources

Multiobjective programming with new invexities

Optimization Letters, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maria Viorica Stefanescu   +2 more
openaire   +2 more sources

Invexity in multifunction optimization

Numerical Functional Analysis and Optimization, 1991
The concept of invex function is extended to arbitrary multifunctions, without requiring any differentiability property. Relations with the usual invexity for functions are established. For minimization of a vector multifunction objective, subject to a multiftmction inclusion constraint, necessary Lagrangian conditions are obtained, which become ...
P.H. Sach, B.D. Craven
openaire   +1 more source

Fractional Programming with Invexity

1999
Consider the nonlinear fractional programming problem: $$\mathop{{\min }}\limits_{{x \in {{X}_{0}}}} f\left( x \right)/g\left( x \right) subject to h\left( x \right) \leqslant 0, $$ (4.1) . Recently, Khan and Hanson gave sufficient conditions for optimality, and established duality results, assuming that f and -g are invex with respect to a ...
B. D. Craven, B. Mond
openaire   +1 more source

Generalized Nonsmooth Invexity

Journal of Information and Optimization Sciences, 1994
Abstract In this paper sufficient optimality conditions and duality results are established for a nonlinear programming problem without differentiability assumption on the data wherein Clarke’s generalized gradient is used to define invexity, pβeudoinvexity and quasiinvexity for Lipβchitz functions.
R. N. Kaul, S. K. Suneja, C. S. Lalitha
openaire   +1 more source

Multiobjective programming under d-invexity

European Journal of Operational Research, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

(p,r)-Invexity in multiobjective programming

European Journal of Operational Research, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Optimization with generalized invexity

Optimization, 2005
Constrained optimization is studied, with nonsmooth (Lipschitz) functions in abstract spaces and cone-constraints. Some more general Lagrangian necessary conditions are obtained, using strict minimum and approximation methods. These conditions are sufficient for a minimum under generalized invex assumptions.
openaire   +1 more source

-invex-infine functions and applications

Nonlinear Analysis: Theory, Methods & Applications, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Home - About - Disclaimer - Privacy