Duality for multiobjective fractional programming involving \(n\)-set functions

From MaRDI portal
Publication:1340522

DOI10.1006/jmaa.1994.1331zbMath0823.90120OpenAlexW2089300759MaRDI QIDQ1340522

C. R. Bector, Shashi Pandey, Davinder Bhatia

Publication date: 14 December 1994

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.1994.1331




Related Items (15)

A fifth bibliography of fractional programming*The saddle theorem for multiobjective generalized fractional programming problems with set functionsAPPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMINGOptimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functionsDuality for minmax \(B\)-vex programming involving \(n\)-set functionsLagrangian duality for preinvex set-valued functionsSufficiency in multiobjective subset programming involving generalized type-I functionsA survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ On a general duality model in multiobjective fractional programming with \(n\)-set functionsOptimality and duality for multiobjective programming involving subdifferentiable set functionsEfficiency Criteria and Duality Models for Multiobjective Fractional Programming Problems Containing Locall'y Subdifferentiable and ρ-Convex FunctionsOptimality and duality for multiobjective fractional programming involving \(n\)-set functionsDuality for a minimax programming problem containing \(n\)-set functionsLagrange duality in multiobjective fractional programming problems with \(n\)-set functionsEfficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions




This page was built for publication: Duality for multiobjective fractional programming involving \(n\)-set functions