Optimality and duality for a multi-objective programming problem involving generalized \(d\)-type-I and related \(n\)-set functions
From MaRDI portal
Publication:2496067
DOI10.1016/j.ejor.2005.02.062zbMath1113.90143OpenAlexW2071139489MaRDI QIDQ2496067
Publication date: 30 June 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.02.062
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items (3)
Sufficient efficiency criteria in multiobjective fractional programming with generalized \(( \mathcal {F},b,\phi ,\rho ,\theta ) \)-univex \(n\)-set functions ⋮ Painlevé-Kuratowski convergence of minimal solutions for set-valued optimization problems via improvement sets ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semiparametric sufficient efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \((\mathcal F,\rho, \theta)\)-convex functions
- Optimality of differentiable, vector-valued n-set functions
- Optimization theory for n-set functions
- Sufficiency criteria and duality for nonlinear programs involving n-set functions
- Optimal constrained selection of a measurable subset
- On multiple objective programming problems with set functions
- Proper D-solutions of multiobjective programming problems with set functions
- Epigraphs of convex set functions
- Duality theorems of vector-valued \(n\)-set functions
- On the optimality conditions of vector-valued \(n\)-set functions
- \(D\)-invexity and optimality conditions
- On the optimality of differentiable nonconvex \(n\)-set functions
- Extreme convex set functions with finite carrier: General theory
- Optimality and duality for multiobjective fractional programming involving \(n\)-set functions
- On multiple-objective optimization with generalized univexity
- Optimality criteria and duality in multiple-objective optimization involving generalized invexity
- A note on fractional minmax programs containing \(n\)-set functions
- On optimality and duality for multiobjective programming problems involving generalized \(d\)-type-I and related \(n\)-set functions.
- Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions
- On duality of multiobjective fractional measurable subset selection problems
- Duality for multiobjective \(B\)-vex programming involving \(n\)-set functions
- Optimality conditions and duality for multiobjective measurable subset selection problems
- The Multiobjective Optimization Problem of Set Function
- Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
- Oil minmax programming problems containing n-set functions
- On generalised convex mathematical programming
- Generalized convex duality for multiobjective fractional programs
- Generalized invexity and duality in multiobjective programming problems
This page was built for publication: Optimality and duality for a multi-objective programming problem involving generalized \(d\)-type-I and related \(n\)-set functions
