Optimality conditions and duality for multiobjective measurable subset selection problems
From MaRDI portal
Publication:3363067
DOI10.1080/02331939108843661zbMath0734.90077OpenAlexW2080340034MaRDI QIDQ3363067
Publication date: 1991
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939108843661
duality resultsOptimality conditionsgeneralized \(\rho\)-convexityconstrained multiobjective measurable subset selection problems
Multi-objective and goal programming (90C29) Duality theory (optimization) (49N15) Optimality conditions (49K99)
Related Items (15)
The saddle theorem for multiobjective generalized fractional programming problems with set functions ⋮ Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions ⋮ Sufficiency in multiobjective subset programming involving generalized type-I functions ⋮ On optimality and duality for multiobjective programming problems involving generalized \(d\)-type-I and related \(n\)-set functions. ⋮ Optimality and duality for multiobjective programming involving subdifferentiable set functions ⋮ On minimax fractional programming of generalized convex set functions ⋮ Optimality and duality for a multi-objective programming problem involving generalized \(d\)-type-I and related \(n\)-set functions ⋮ Generalized V-univexity type-I for multiobjective programming with \(n\)-set functions ⋮ Optimality and duality for multiobjective fractional programming involving \(n\)-set functions ⋮ Optimality for nonlinear programs containingn-set functions ⋮ Duality for a minimax programming problem containing \(n\)-set functions ⋮ Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions ⋮ Duality for multiobjective programming involving n-set functions ⋮ Duality for multiobjective fractional programming involvingn-set functions sup* ⋮ 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
- Optimal constrained selection of a measurable subset
- Duality in mathematical programming of set functions: On Fenchel duality theorem
- On multiple objective programming problems with set functions
- Epigraphs of convex set functions
- Lipschitz continuous policy functions for strongly concave optimization problems
- Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
- On proper and improper efficient solutions of optimal problems with multicriteria
- Strong convexity of sets and functions
- Extreme convex set functions with finite carrier: General theory
- Equazioni differenziali e algebriche: un algoritmo esplicito di tipo perturbativo
- Application de la méthode des éléments finis à l'approximation d'un problème de domaine optimal. Méthodes de résolution des problèmes approches
- Saddle points of Hamiltonian systems in convex Lagrange problems having a nonzero discount rate
- Concepts of proper efficiency
- Proper efficiency and the theory of vector maximization
- Some properties of convex set functions
- A class of extreme convex set functions with finite carrier
- Strong and Weak Convexity of Sets and Functions
- Second order optimality conditions for mathematical prograramming with set functions
- Saddle point and duality in the optimization theory of convex set functions
- IX. On the problem of the most efficient tests of statistical hypotheses
- Duality Relationships for a Partitioning Problem
- A Partitioning Problem with Applications in Regional Design
- On the Fundamental Lemma of Neyman and Pearson
This page was built for publication: Optimality conditions and duality for multiobjective measurable subset selection problems
