The saddle theorem for multiobjective generalized fractional programming problems with set functions
DOI10.1007/BF02896470zbMATH Open1132.90367OpenAlexW2091247091MaRDI QIDQ854429FDOQ854429
Authors: Sanming Liu, Enmin Feng
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
Recommendations
- Saddle point theorems for multiobjective fractional programming with generalized uniform \(B_\rho\)-\((p,r)\)-invexity functions
- Publication:4944835
- Duality for multiobjective fractional programming involving \(n\)-set functions
- Saddlepoint Theory for Nondifferentiable Multiobjective Fractional Programming
- Optimality and duality for multiobjective fractional programming involving \(n\)-set functions
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Minimax problems in mathematical programming (90C47)
Cites Work
- Proper efficiency and the theory of vector maximization
- On the optimality conditions of vector-valued \(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 the Fundamental Lemma of Neyman and Pearson
- 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
- Duality for multiobjective fractional programming involving \(n\)-set functions
- A Partitioning Problem with Applications in Regional Design
- Optimal constrained selection of a measurable subset
- On multiple objective programming problems with set functions
- Lagrange multiplier theorem of multiobjective programming problems with set functions
- Epigraphs of convex set functions
- Convex programming with set functions
- Equazioni differenziali e algebriche: un algoritmo esplicito di tipo perturbativo
- Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions
- Optimality conditions and duality for multiobjective measurable subset selection problems
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: The saddle theorem for multiobjective generalized fractional programming problems with set functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854429)