Optimality conditions for multiple objective fractional subset programming with \(({\mathcal F},\alpha,\rho,\theta)\)-V-type-I and related non-convex functions
From MaRDI portal
Publication:2389822
DOI10.1016/j.mcm.2007.12.018zbMath1187.90258MaRDI QIDQ2389822
Publication date: 19 July 2009
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2007.12.018
optimality conditions; multiple objective fractional subset programming; generalized \(n\)-set convex functions
Related Items
Cites Work
- 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
- 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 criteria in mathematical programming involving generalized invexity
- 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
- 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
- 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
- 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
- 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
