Generalized (p, r)-Invexity in Mathematical Programming
From MaRDI portal
Publication:4435182
DOI10.1081/NFA-120023865zbMath1097.90042OpenAlexW2049057688MaRDI QIDQ4435182
Publication date: 26 November 2003
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1081/nfa-120023865
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Convexity of real functions in one variable, generalizations (26A51)
Related Items (9)
\(G\)-semipreinvexity and its applications ⋮ On semi-\((B, G)\)-preinvex functions ⋮ Minimax programming under generalized \((p, r)\)-invexity ⋮ Sufficient Conditions for Nonsmoothr-Invexity ⋮ Optimality and duality for a nonsmooth multiobjective optimization involving generalized type I functions ⋮ Unnamed Item ⋮ \((p,r)\)-invex sets and functions ⋮ Optimality conditions and duality for nondifferentiable multiobjective programming problems involving \(d\)-\(r\)-type I functions ⋮ Optimality and duality for nonsmooth multiobjective optimization problems with generalized V -r-invexity
Cites Work
- Unnamed Item
- The essence of invexity
- \(r\)-preinvexity and \(r\)-invexity in mathematical programming
- Optimality criteria in mathematical programming involving generalized invexity
- On sufficiency of the Kuhn-Tucker conditions
- What is invexity?
- Necessary and sufficient conditions in constrained optimization
- A class of nonconvex functions and mathematical programming
- A duality theorem for non-linear programming
- \((p,r)\)-invex sets and functions
- On \((p,r)\)-invexity-type nonlinear programming problems.
This page was built for publication: Generalized (p, r)-Invexity in Mathematical Programming