The saddle theorem for multiobjective generalized fractional programming problems with set functions
From MaRDI portal
Publication:854429
DOI10.1007/BF02896470zbMath1132.90367OpenAlexW2091247091MaRDI QIDQ854429
Publication date: 4 December 2006
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02896470
Minimax problems in mathematical programming (90C47) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items (1)
Cites Work
- Unnamed Item
- Optimal constrained selection of a measurable subset
- On multiple objective programming problems with set functions
- Epigraphs of convex set functions
- Convex programming with set functions
- Lagrange multiplier theorem of multiobjective programming problems with set functions
- On the optimality conditions of vector-valued \(n\)-set functions
- 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
- Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions
- Duality for multiobjective fractional programming involving \(n\)-set functions
- Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions
- Proper efficiency and the theory of vector maximization
- Optimality conditions and duality for multiobjective measurable subset selection problems
- A Partitioning Problem with Applications in Regional Design
- On the Fundamental Lemma of Neyman and Pearson
This page was built for publication: The saddle theorem for multiobjective generalized fractional programming problems with set functions
