Higher order type-I α-invexity and duality in nondifferentiable mathematical programming
From MaRDI portal
Publication:3621444
DOI10.1080/09720502.2008.10700601zbMath1176.90632OpenAlexW2035648693MaRDI QIDQ3621444
J. S. Rautela, Shashi Kant Mishra, Rajendra Pant
Publication date: 21 April 2009
Published in: Journal of Interdisciplinary Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720502.2008.10700601
Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)
Cites Work
- Duality in vector optimization in Banach spaces with generalized convexity
- Optimality and duality in nondifferentiable and multiobjective programming under generalized \(d\)-invexity
- A class of multiple-criteria fractional programming problems
- Duality for a class of nondifferentiable mathematical programming problems
- Second- and higher-order duality in nonlinear programming
- Necessary conditions and sufficient conditions for static minmax problems
- A class of nondifferentiable mathematical programming problems
- Nondifferentiable minimax fractional programming under generalized univexity
- Optimality and duality for multiple-objective optimization under generalized type I univexity
- Relationships between vector variational-like inequality and optimization problems
- Complex minimax programming under generalized convexity
- Generalized \(\alpha\)-invexity and nondifferentiable minimax fractional programming
- Vector variational-like inequalities and non-smooth vector optimization problems
- Multiple objective fractional programming involving semilocally type I-preinvex and related functions
- On vector variational-like inequality problems
- Multiobjective fractional programming duality theory
- Preinvexity in Multiobjective Fractional Programming
- Second order generalized invexity and duality in mathematical programming
- Multiobjective second order symmetric duality with cone constraints
This page was built for publication: Higher order type-I α-invexity and duality in nondifferentiable mathematical programming
