Optimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-type-I and related non-convex functions

DOI10.1007/s10092-011-0050-0zbMath1269.90101MaRDI QIDQ695624

M. C. Fu

Publication date: 21 December 2012

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10092-011-0050-0

zbMATH Keywords

sufficient optimality conditions; generalized convex functions; multiple objective fractional subset programming

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

90C46: Optimality conditions and duality in mathematical programming

90C32: Fractional programming

52A01: Axiomatic and generalized convexity

Related Items

Unnamed Item, Constrained controlled optimization problems involving second-order derivatives, Sufficient efficiency criteria in multiobjective fractional programming with generalized \(( \mathcal {F},b,\phi ,\rho ,\theta ) \)-univex \(n\)-set functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semiparametric sufficient efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \((\mathcal F,\rho, \theta)\)-convex functions
• 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
• Optimality and duality for a nonsmooth multiobjective optimization involving generalized type I functions
• Minimax fractional programming for \(n\)-set functions and mixed-type duality under generalized Invexity
• 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
• 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
• \(D\)-invexity and optimality conditions
• On the optimality of differentiable nonconvex \(n\)-set functions
• Extreme convex set functions with finite carrier: General theory
• Optimality and duality for multiobjective fractional programming involving \(n\)-set functions
• On multiple-objective optimization with generalized univexity
• Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions
• On duality of multiobjective fractional measurable subset selection problems
• Duality theorems for multiobjective fractional minimization problems involving set functions
• Optimality conditions for multiple objective fractional subset programming with \(({\mathcal F},\alpha,\rho,\theta)\)-V-type-I and related non-convex functions
• The Multiobjective Optimization Problem of Set Function
• Necessary and sufficient conditions in constrained optimization
• 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
• A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions]
• A transposition theorem with applications to constrained optimal control problems
• Duality for multiobjective programming involving n-set functions
• Duality for multiobjective fractional programming involvingn-set functions sup^*
• On Nonlinear Fractional Programming
• Multiobjective programming under generalized type I invexity