Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions

DOI10.1016/S0898-1221(02)00114-1zbMath1008.90055OpenAlexW2038232616MaRDI QIDQ1609081

G. J. Zalmai

Publication date: 15 August 2002

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(02)00114-1

zbMATH Keywords

duality theoremsefficiency criteriageneralized \(n\)-set convex functionsmultiobjective fractional subset programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)

Related Items (18)

Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions ⋮ Sufficiency and duality for multiobjective variational control problems with generalized \((F,\alpha ,\rho ,\theta )\)-V-convexity ⋮ The saddle theorem for multiobjective generalized fractional programming problems with set functions ⋮ Optimality conditions for multiple objective fractional subset programming with \(({\mathcal F},\alpha,\rho,\theta)\)-V-type-I and related non-convex functions ⋮ Duality for multiple objective fractional subset programming with generalized \((\Gamma\mkern-15mu-,\rho,\sigma,\theta)\)-V-Type-I functions ⋮ Sufficient efficiency criteria in multiobjective fractional programming with generalized \(( \mathcal {F},b,\phi ,\rho ,\theta ) \)-univex \(n\)-set functions ⋮ Sufficiency in multiobjective subset programming involving generalized type-I functions ⋮ Role of \((\rho , \eta , A)\)-invexity to \(\varepsilon \)-optimality conditions for multiple objective fractional programming ⋮ On a general duality model in multiobjective fractional programming with \(n\)-set functions ⋮ Optimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-type-I and related non-convex functions ⋮ Second order duality for nondifferentiable multiobjective programming problem involving \((F, \alpha , \rho , d)-V\)-type I functions ⋮ Multiobjective fractional programming involving generalized semilocally V-type I-preinvex and related functions ⋮ Optimality and duality for a multi-objective programming problem involving generalized \(d\)-type-I and related \(n\)-set functions ⋮ Second-Order Duality in Multiobjective Programming Involving (F, α, ρ,d)-V-Type I Functions ⋮ Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions ⋮ On nondifferentiable minimax fractional programming under generalized \(\alpha\)-type I invexity ⋮ Unnamed Item ⋮ Semiinfinite multiobjective fractional programming, Part I: Sufficient efficiency conditions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• On multiple objective programming problems with set functions
• Proper D-solutions of multiobjective programming problems with set functions
• Lagrangian function and duality theory in multiobjective programming with set functions
• Optimality for set functions with values in ordered vector spaces
• Generalized convex set functions
• On sufficiency of the Kuhn-Tucker conditions
• Lagrange multiplier theorem of multiobjective programming problems with set functions
• Duality theorems of vector-valued \(n\)-set functions
• On the optimality conditions of vector-valued \(n\)-set functions
• On the optimality of differentiable nonconvex \(n\)-set functions
• Optimality and duality for multiobjective fractional programming involving \(n\)-set functions
• On generalized convex functions in optimization theory -- a survey
• Nonlinear multiobjective optimization
• Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions
• Efficiency and duality for nonlinear multiobjective programs involving \(n\)-set functions
• Duality for multiobjective fractional programming involving \(n\)-set functions
• Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions
• On duality of multiobjective fractional measurable subset selection problems
• Duality theorems for multiobjective fractional minimization problems involving set functions
• Duality for multiobjective \(B\)-vex programming involving \(n\)-set functions
• Optimality conditions and duality for multiobjective measurable subset selection problems
• The Multiobjective Optimization Problem of Set Function
• Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
• Invex functions and constrained local minima
• Further Generalizations of Convexity in Mathematical Programming
• Oil minmax programming problems containing n-set functions
• On generalised convex mathematical programming
• Proper efficiency principles and duality models for a class of continuous-time multiobjective fractional programming problems with operator constraints
• Multiobjective Fractional Duality Forn-Set Functions
• A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions]
• Optimality and duality for multiobjective programming involving subdifferentiable set functions
• Various types of nonsmooth invex functions
• Duality for multiobjective programming involving n-set functions
• Duality for multiobjective fractional programming involvingn-set functions sup^*
• On Nonlinear Fractional Programming
• Seven Kinds of Convexity
• Generalized convex duality for multiobjective fractional programs

This page was built for publication: Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions