Optimality conditions and duality for multiobjective programming involving (C,,,d) type-I functions
From MaRDI portal
Publication:3437590
zbMATH Open1132.49027MaRDI QIDQ3437590FDOQ3437590
Authors: Altannar Chinchuluun, Xiaoling Liu, D. H. Yuan, Panos M. Pardalos 
Publication date: 9 May 2007
Recommendations
- Sufficiency and duality in nondifferentiable multiobjective programming involving generalized type I functions
- Optimality and duality for nondifferentiable multiobjective programming problems involving generalized \(d-\rho -(\eta , \theta )\) type-I invex functions
- Sufficiency and duality in differentiable multiobjective programming involving generalized type I functions
- Sufficiency and duality in multiobjective programming under generalized type I functions
- Optimality and duality in nondifferentiable and multiobjective programming under generalized \(d\)-invexity
Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52) Duality theory (optimization) (49N15) Optimality conditions for free problems in two or more independent variables (49K10)
Cited In (15)
- Optimality and duality for minimax fractional programming with support function under \((C, \alpha, \rho, d)\)-convexity
- Optimality for \((h,\varphi)\)-multiobjective programming involving generalized type-I functions
- Generalized V-univexity type-I for multiobjective programming with \(n\)-set functions
- Sufficiency and duality for multiobjective variational control problems with generalized \((F,\alpha ,\rho ,\theta )\)-V-convexity
- Optimality conditions for vector optimization problems
- Sufficient optimality conditions for multiobjective programming involving \((V,\rho)_{h,\varphi}\)-type I functions
- On cone characterizations of strong and Lexicographic optimality in convex multiobjective optimization
- Optimality via generalized approximate convexity and quasiefficiency
- On vector variational-like inequalities and set-valued optimization problems
- Lower and upper ginchev derivatives of vector functions and their applications to multiobjective optimization
- On efficient applications of \(G\)-Karush-Kuhn-Tucker necessary optimality theorems to multiobjective programming problems
- Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized \((C,\alpha,\rho,d)\)-convexity
- A class of \(r\)-semipreinvex functions and optimality in nonlinear programming
- Higher order duality of multiobjective constrained ratio optimization problems
- Strong Kuhn-Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems
This page was built for publication: Optimality conditions and duality for multiobjective programming involving \((C,\alpha,\rho,d)\) type-I functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3437590)
