Optimality conditions and duality for multiobjective measurable subset selection problems
From MaRDI portal
Cites work
- A class of extreme convex set functions with finite carrier
- A Partitioning Problem with Applications in Regional Design
- 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
- Concepts of proper efficiency
- Duality in mathematical programming of set functions: On Fenchel duality theorem
- Duality Relationships for a Partitioning Problem
- Epigraphs of convex set functions
- Equazioni differenziali e algebriche: un algoritmo esplicito di tipo perturbativo
- Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
- Extreme convex set functions with finite carrier: General theory
- scientific article; zbMATH DE number 3402368 (Why is no real title available?)
- IX. On the problem of the most efficient tests of statistical hypotheses
- Lipschitz continuous policy functions for strongly concave optimization problems
- On multiple objective programming problems with set functions
- On proper and improper efficient solutions of optimal problems with multicriteria
- On the Fundamental Lemma of Neyman and Pearson
- Optimal constrained selection of a measurable subset
- Optimization theory for n-set functions
- Proper efficiency and the theory of vector maximization
- Saddle point and duality in the optimization theory of convex set functions
- Saddle points of Hamiltonian systems in convex Lagrange problems having a nonzero discount rate
- Second order optimality conditions for mathematical prograramming with set functions
- Some properties of convex set functions
- Strong and Weak Convexity of Sets and Functions
- Strong convexity of sets and functions
Cited in
(16)- Optimality and duality for multiobjective fractional programming involving \(n\)-set functions
- Duality for a minimax programming problem containing n-set functions
- Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions
- Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex 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 minimax fractional programming of generalized convex set functions
- Generalized V-univexity type-I for multiobjective programming with n-set functions
- Sufficiency in multiobjective subset programming involving generalized type-I functions
- Optimality and duality for a multi-objective programming problem involving generalized \(d\)-type-I and related \(n\)-set functions
- Optimality and duality for multiobjective programming involving subdifferentiable set functions
- Optimality for nonlinear programs containingn-set functions
- Duality for multiobjective programming involving n-set functions
- Duality for multiobjective fractional programming involvingn-set functions sup*
- New concepts of generalized convexity in multiobjective subset programming
- The saddle theorem for multiobjective generalized fractional programming problems with set functions
This page was built for publication: Optimality conditions and duality for multiobjective measurable subset selection problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3363067)
