Sufficient conditions and duality for a class of multiobjective fractional programming problems with higher-order \((F,\alpha ,\rho,d)\)-convexity
DOI10.1007/s12190-008-0080-1zbMath1192.49021OpenAlexW2039321331MaRDI QIDQ949344
Publication date: 21 October 2008
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-008-0080-1
optimality conditionsdualitymultiobjective fractional programming problemproperly efficient solutionhigher-order \((F,\alpha,\rho,d)\) convexity
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15) Optimality conditions for free problems in two or more independent variables (49K10)
Related Items (3)
Cites Work
- Necessary conditions for optimality of nondifferentiable convex multiobjective programming
- Duality for multiobjective fractional programming involving generalized \(\eta\)-bonvex functions
- Higher-order generalized invexity and duality in mathematical programming
- Optimality and duality for the multiobjective fractional programming with the generalized \((F,\rho)\) convexity.
- Some results on mathematical programming with generalized ratio invexity
- Second order \((F, \alpha , \rho , d)\)-convexity and duality in multiobjective programming
- Proper efficiency and the theory of vector maximization
- Multiobjective fractional programming duality theory
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
This page was built for publication: Sufficient conditions and duality for a class of multiobjective fractional programming problems with higher-order \((F,\alpha ,\rho,d)\)-convexity