Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions
From MaRDI portal
Publication:1378572
DOI10.1006/jmaa.1997.5644zbMath0914.90232OpenAlexW1993159454MaRDI QIDQ1378572
Publication date: 23 June 1999
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1997.5644
dualitymultiobjective programmingPareto optimalitynecessary conditionssufficient conditionssubdifferentiable set functions
Related Items (8)
Sufficient optimality criteria and duality for nondifferentiable fractional variational problems with generalized (F, ρ)-convexity ⋮ Minimax fractional programming involving generalised invex functions ⋮ Three types dual model for minimax fractional programming ⋮ On minimax fractional programming of generalized convex set functions ⋮ Parameter-free dual models for fractional programming with generalized invexity ⋮ Minimax fractional programming for \(n\)-set functions and mixed-type duality under generalized Invexity ⋮ Duality for a minimax programming problem containing \(n\)-set functions ⋮ Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions
Cites Work
- Unnamed Item
- Optimization theory for n-set functions
- Sufficiency criteria and duality for nonlinear programs involving n-set functions
- Optimal constrained selection of a measurable subset
- Duality in mathematical programming of set functions: On Fenchel duality theorem
- Existence and Lagrangian duality for maximization of set-valued functions
- Moreau-Rockafellar type theorem for convex set functions
- Lagrange multiplier theorem of multiobjective programming problems with set functions
- On the optimality conditions of vector-valued \(n\)-set functions
- On efficiency and duality for multiobjective programs
- On the optimality of differentiable nonconvex \(n\)-set functions
- Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
- On sufficiency and duality for generalized quasiconvex programs
- Efficiency and duality for nonlinear multiobjective programs involving \(n\)-set functions
- Sufficiency and duality in multiobjective programming involving generalized \(F\)-convex functions
- Optimization of set-valued functions
- Duality for multiobjective fractional programming involving \(n\)-set functions
- Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions
- On duality of multiobjective fractional measurable subset selection problems
- Duality for nondifferentiable static multiobjective variational problems involving generalized \((F,\rho)\)-convex functions
- Optimality and duality for generalized fractional programming involving nonsmooth pseudoindex functions
- Duality for generalized fractional programs involving n-set functions
- Optimality conditions and duality for multiobjective measurable subset selection problems
- Second order optimality conditions for mathematical prograramming with set functions
- The Fenchel-Moreau Theorem for Set Functions
- Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
- Saddle point and duality in the optimization theory of convex set functions
- Oil minmax programming problems containing n-set functions
- Multiobjective Fractional Duality Forn-Set Functions
- Optimality and duality for generalized fractional variational problems involving generalized (fρ)-convex functions
- Optimality and duality for multiobjective programming involving subdifferentiable set functions
- Optimality for nonlinear programs containingn-set functions
- Generalized (F, ρ)-convexity and duality for non smooth multi-objective programs
- Duality for multiobjective programming involving n-set functions
- Optimality and duality for multiobjective fractional programming involving nonsmooth($si:F$esi:ρ)–convex functions
- Seven Kinds of Convexity
- Optimality and duality for multiobjective fractional programming involving nonsmooth pseudoinvex functions
This page was built for publication: Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions
