Sufficiency in multiobjective subset programming involving generalized type-I functions
From MaRDI portal
Publication:2426681
DOI10.1007/s10898-007-9150-4zbMath1149.90132OpenAlexW2094650829MaRDI QIDQ2426681
Publication date: 23 April 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-007-9150-4
Cites Work
- Unnamed Item
- 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
- Duality for multiple objective fractional subset programming with generalized \((\Gamma\mkern-15mu-,\rho,\sigma,\theta)\)-V-Type-I functions
- On multiple objective programming problems with set functions
- Quelques résultats sur l'identification de domaines
- 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
- 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 criteria and duality in multiple-objective optimization involving generalized invexity
- Efficiency and duality for nonlinear multiobjective programs involving \(n\)-set functions
- Duality for multiobjective fractional programming involving \(n\)-set functions
- Duality for minmax \(B\)-vex programming involving \(n\)-set functions
- 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 for a class of multiobjective fractional programming problems
- Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions
- Sufficiency and duality in differentiable multiobjective programming involving generalized type I functions
- Proper efficiency and the theory of vector maximization
- Optimality conditions and duality for multiobjective measurable subset selection problems
- Necessary and sufficient conditions in constrained optimization
- Oil minmax programming problems containing n-set functions
- IX. On the problem of the most efficient tests of statistical hypotheses
- Duality for multiobjective programming involving n-set functions
- Duality Relationships for a Partitioning Problem
- A Partitioning Problem with Applications in Regional Design
- On the Fundamental Lemma of Neyman and Pearson
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
This page was built for publication: Sufficiency in multiobjective subset programming involving generalized type-I functions
