Multiobjective programming problems with \((G,C,\rho)\)-convexity
From MaRDI portal
Publication:2511111
DOI10.1007/s12190-012-0566-8zbMath1295.90058OpenAlexW2012460505MaRDI QIDQ2511111
Shengyun Yang, Xiaoling Liu, Guoming Lai, De-Hui Yuan
Publication date: 5 August 2014
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-012-0566-8
\((G,C,\rho)\)-convex\(G\)-duality theory\(G\)-necessary conditions\(G\)-sufficient conditionsmultiobjective program
Related Items (1)
Cites Work
- Unnamed Item
- Optimality conditions and duality for nondifferentiable multiobjective fractional programming problems with \((C,\alpha ,\rho ,d)\)-convexity
- The essence of invexity
- New optimality conditions and duality results of \(G\) type in differentiable mathematical programming
- On \(G\)-invex multiobjective programming. II: Duality
- On \(G\)-invex multiobjective programming. I: Optimality
- On sufficiency of the Kuhn-Tucker conditions
- On efficiency and duality for multiobjective programs
- Efficiency and generalized convex duality for multiobjective programs
- Nonsmooth multiobjective programs with \(V\)-\(\rho\)-invexity
- Efficiency conditions and duality for a class of multiobjective fractional programming problems
- Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity
- Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity
- What is invexity?
- Necessary and sufficient conditions in constrained optimization
- On generalised convex mathematical programming
- Generalized (F, ρ)-convexity and duality for non smooth multi-objective programs
- \((p,r)\)-invex sets and functions
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
This page was built for publication: Multiobjective programming problems with \((G,C,\rho)\)-convexity
