Duality for multiple objective fractional subset programming with generalized (-15mu-,,,)-V-Type-I functions
From MaRDI portal
(Redirected from Publication:858577)
Duality for multiple objective fractional subset programming with generalized \((\Gamma\mkern-15mu-,\rho,\sigma,\theta)\)-V-Type-I functions
Duality for multiple objective fractional subset programming with generalized \((\Gamma\mkern-15mu-,\rho,\sigma,\theta)\)-V-Type-I functions
Recommendations
- Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex 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 programming with generalized type-I univexity
- Semiparametric sufficient efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized ( F,, )-convex functions
- Optimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-type-I and related non-convex functions
Cites work
- \(D\)-invexity and optimality conditions
- A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
- A transposition theorem with applications to constrained optimal control problems
- Duality for multiobjective fractional programming involvingn-set functions sup*
- Duality for multiobjective programming involving n-set functions
- Duality theorems for multiobjective fractional minimization problems involving set functions
- Duality theorems 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
- Extreme convex set functions with finite carrier: General theory
- Further Generalizations of Convexity in Mathematical Programming
- scientific article; zbMATH DE number 1664596 (Why is no real title available?)
- scientific article; zbMATH DE number 3904354 (Why is no real title available?)
- scientific article; zbMATH DE number 3621419 (Why is no real title available?)
- scientific article; zbMATH DE number 1086942 (Why is no real title available?)
- scientific article; zbMATH DE number 1774234 (Why is no real title available?)
- Invex functions and constrained local minima
- Lagrange multiplier theorem of multiobjective programming problems with set functions
- Lagrangian function and duality theory in multiobjective programming with set functions
- Multiobjective programming under generalized type I invexity
- Oil minmax programming problems containing n-set functions
- On duality of multiobjective fractional measurable subset selection problems
- On generalised convex mathematical programming
- On multiple objective programming problems with set functions
- On multiple-objective optimization with generalized univexity
- On Nonlinear Fractional Programming
- On sufficiency of the Kuhn-Tucker conditions
- On the optimality conditions of vector-valued n-set functions
- On the optimality of differentiable nonconvex n-set functions
- Optimal constrained selection of a measurable subset
- Optimality and duality for multiobjective programming involving subdifferentiable set functions
- Optimality criteria in mathematical programming involving generalized invexity
- Optimality for set functions with values in ordered vector spaces
- Optimality of differentiable, vector-valued n-set functions
- Optimization theory for n-set functions
- Proper D-solutions of multiobjective programming problems with set functions
- Semiparametric sufficient efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized ( F,, )-convex functions
- Sufficiency and duality in differentiable multiobjective programming involving generalized type I functions
- Sufficiency criteria and duality for nonlinear programs involving n-set functions
- The Multiobjective Optimization Problem of Set Function
Cited in
(8)- Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions
- Sufficient efficiency criteria in multiobjective fractional programming with generalized \(( \mathcal {F},b,\phi ,\rho ,\theta ) \)-univex \(n\)-set functions
- Optimality conditions for multiple objective fractional subset programming with \(({\mathcal F},\alpha,\rho,\theta)\)-V-type-I and related non-convex functions
- Sufficiency in multiobjective subset programming involving generalized type-I functions
- Duality for multiple objective fractional programming with generalized type-I univexity
- Second order duality for mathematical programming involving n-set functions
- On a general duality model in multiobjective fractional programming with \(n\)-set functions
- Duality for fractional interval-valued bilevel optimization problems
This page was built for publication: Duality for multiple objective fractional subset programming with generalized \((\Gamma\mkern-15mu-,\rho,\sigma,\theta)\)-V-Type-I functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858577)
