Multiobjective programming problems under generalized convexity
From MaRDI portal
Publication:5301183
zbMATH Open1267.90128MaRDI QIDQ5301183FDOQ5301183
Authors: Altannar Chinchuluun, Panos M. Pardalos
Publication date: 2 July 2013
Recommendations
- On generalized convexity and duality in multiobjective programming problems
- Generalised convexity and duality in multiple objective programming
- Efficiency conditions and duality for a class of multiobjective fractional programming problems
- Multiobjective programming problems with \((G,C,\rho)\)-convexity
- Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)
Cited In (26)
- First-order optimality conditions and duality results for multi-objective optimisation problems
- Optimality and duality for minimax fractional programming with support function under \((C, \alpha, \rho, d)\)-convexity
- Title not available (Why is that?)
- Perturbing convex multiobjecttve programs
- Generalized convexity in multiobjective programming
- Multiobjective programming under generalized type I invexity
- Multiobjective variational programming under generalized type I univexity
- Generalized polarity and weakest constraint qualifications in multiobjective optimization
- Multiobjective fractional programming with generalized convexity
- Generalized convex programming
- Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions
- Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
- On generalized convexity and duality in multiobjective programming problems
- Optimality conditions of multiobjective programming problems based on weak convexity
- Duality for a kind of multiobjective optimization problem under generalized convexity
- Lagrange multipliers for multiobjective programs with a general preference
- A complementarity constraint formulation of convex multiobjective optimization 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
- Generalised convexity and duality in multiple objective programming
- Generalized proximal point algorithms for multiobjective optimization problems
- Title not available (Why is that?)
- The Wolfe type duality in the generalized convex multiobjective programming
- Optimality and duality for complex multi-objective programming
- Title not available (Why is that?)
- Multiobjective programming problems with \((G,C,\rho)\)-convexity
This page was built for publication: Multiobjective programming problems under generalized convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301183)