Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized ( F,,,)-V-convex functions
From MaRDI portal
Publication:1609081
Recommendations
- Parametric sufficient efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized (F, ρ, θ) -convex functions
- Optimality conditions and duality models for minmax fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho, \theta)\)-\(V\)-convex functions
- Efficiency Criteria and Duality Models for Multiobjective Fractional Programming Problems Containing Locall'y Subdifferentiable and ρ-Convex Functions
- 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 \(({\mathcal F},\alpha,\rho,\theta)\)-V-type-I and related non-convex functions
- Efficiency conditions and duality for a class of multiobjective fractional programming problems
- Duality for multiple objective fractional subset programming with generalized \((\Gamma\mkern-15mu-,\rho,\sigma,\theta)\)-V-Type-I functions
- Optimality and duality for the multiobjective fractional programming with the generalized (F,) convexity.
- Proper efficiency conditions and duality models for nonsmooth multiobjective fractional programming problems with operator constraints. I: Theory
Cites work
- A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
- Duality for multiobjective \(B\)-vex programming involving \(n\)-set functions
- Duality for multiobjective fractional programming involving \(n\)-set functions
- 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 and duality for nonlinear multiobjective programs involving \(n\)-set functions
- Further Generalizations of Convexity in Mathematical Programming
- Generalized convex duality for multiobjective fractional programs
- Generalized convex set functions
- scientific article; zbMATH DE number 3856842 (Why is no real title available?)
- scientific article; zbMATH DE number 3904354 (Why is no real title available?)
- scientific article; zbMATH DE number 1328995 (Why is no real title available?)
- scientific article; zbMATH DE number 486773 (Why is no real title available?)
- Invex functions and constrained local minima
- Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions
- Lagrange multiplier theorem of multiobjective programming problems with set functions
- Lagrangian function and duality theory in multiobjective programming with set functions
- Multiobjective Fractional Duality Forn-Set Functions
- Nonlinear multiobjective optimization
- Oil minmax programming problems containing n-set functions
- On duality of multiobjective fractional measurable subset selection problems
- On generalised convex mathematical programming
- On generalized convex functions in optimization theory -- a survey
- On multiple objective programming problems with set functions
- 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 fractional programming involving \(n\)-set functions
- Optimality and duality for multiobjective programming involving subdifferentiable set functions
- Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
- Optimality conditions and duality for multiobjective measurable subset selection problems
- Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions
- 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
- Proper efficiency principles and duality models for a class of continuous-time multiobjective fractional programming problems with operator constraints
- Seven Kinds of Convexity
- Sufficiency criteria and duality for nonlinear programs involving n-set functions
- The Multiobjective Optimization Problem of Set Function
- Various types of nonsmooth invex functions
Cited in
(21)- On nondifferentiable minimax fractional programming under generalized -type I invexity
- Sufficient efficiency criteria in multiobjective fractional programming with generalized \(( \mathcal {F},b,\phi ,\rho ,\theta ) \)-univex \(n\)-set functions
- Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized ( F,,) -convex functions
- Optimality conditions and duality models for minmax fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho, \theta)\)-\(V\)-convex functions
- Multiobjective fractional programming involving generalized semilocally V-type I-preinvex and related 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
- Optimality and duality for a multi-objective programming problem involving generalized \(d\)-type-I and related \(n\)-set functions
- Semiinfinite multiobjective fractional programming. I: Sufficient efficiency conditions
- Role of ( , , A)-invexity to -optimality conditions for multiple objective fractional programming
- Second order duality for mathematical programming involving n-set functions
- Parametric sufficient efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized (F, ρ, θ) -convex functions
- Second-Order Duality in Multiobjective Programming Involving (F, α, ρ,d)-V-Type I Functions
- 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
- Semiparametric sufficient efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized ( F,, )-convex functions
- 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
- Duality for multiple objective fractional subset programming with generalized \((\Gamma\mkern-15mu-,\rho,\sigma,\theta)\)-V-Type-I functions
- Second order duality for nondifferentiable multiobjective programming problem involving \((F, \alpha , \rho , d)-V\)-type I functions
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1609081)
