On \((p,r)\)-invexity-type nonlinear programming problems.
From MaRDI portal
Publication:5957157
DOI10.1006/jmaa.2001.7665zbMath1052.90072OpenAlexW2010253050MaRDI QIDQ5957157
Publication date: 8 September 2003
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.2001.7665
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items (10)
The Notion of V-r-Invexity in Differentiable Multiobjective Programming ⋮ A class of \(r\)-semipreinvex functions and optimality in nonlinear programming ⋮ \((p,r)\)-invexity in multiobjective programming. ⋮ Optimality and duality for multiple-objective optimization under generalized type I univexity ⋮ Optimality and invexity in optimization problems in Banach algebras (spaces) ⋮ Generalized (p, r)-Invexity in Mathematical Programming ⋮ Some results on mathematical programs with equilibrium constraints ⋮ Higher order duality in multiobjective fractional programming problem with generalized convexity ⋮ Fritz John type optimality and duality in nonlinear programming under weak pseudo-invexity ⋮ Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity
Cites Work
- Unnamed Item
- Unnamed Item
- The essence of invexity
- Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
- Optimality criteria in mathematical programming involving generalized invexity
- On sufficiency of the Kuhn-Tucker conditions
- Generalized B-vex functions and generalized B-vex programming
- 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
- Invex functions and constrained local minima
- r-convex functions
This page was built for publication: On \((p,r)\)-invexity-type nonlinear programming problems.
