On invexity-type nonlinear programming problems
From MaRDI portal
Publication:1321449
DOI10.1007/BF02196597zbMath0797.90102OpenAlexW1984367974MaRDI QIDQ1321449
Publication date: 27 April 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02196597
generalized invexitysaddle pointsconstraint qualificationKuhn-Tucker pointFritz John pointsSFJ-invex programming
Related Items (9)
A fifth bibliography of fractional programming* ⋮ A Derivative for Semipreinvex Functions and Its Applications in Semipreinvex Programming ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ Generalized invexity-type conditions in constrained optimization ⋮ Continuous-time generalized fractional programming ⋮ On the Fritz John saddle point problem for differentiable multiobjective optimization ⋮ On the optimality of some classes of invex problems ⋮ Second-order Kuhn-Tucker invex constrained problems ⋮ Optimality conditions for an isolated minimum of order two in \(C1\) constrained optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality criteria in nonlinear programming involving nonconvex functions
- The essence of invexity
- Saddle-point type optimality criteria for generalized fractional programming
- Generalized fractional programming duality: A parametric approach
- 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
- Duality in generalized fractional programming via Farkas' lemma
- Duality in generalized linear fractional programming
- What is invexity?
- Necessary and sufficient conditions in constrained optimization
- Invex functions and constrained local minima
- Sufficiency of Exact Penalty Minimization
This page was built for publication: On invexity-type nonlinear programming problems
