Sufficiency and duality in multiobjective programming involving generalized F-convex functions
From MaRDI portal
(Redirected from Publication:1329322)
Sufficiency and duality in multiobjective programming involving generalized \(F\)-convex functions
Sufficiency and duality in multiobjective programming involving generalized \(F\)-convex functions
The following nonlinear vector maximum problem is considered: \[ \text{Maximize}\quad f(x)= [f_ 1(x), f_ 2(x),\dots, f_ k(x)]\tag{P} \] subject to \(x\in X= \{x; x\in S,\;g(x)\leq 0,\;h(x)= 0\}\), where \(S\) is non-empty open convex subset of \(\mathbb{R}^ n\) and \(f: S\to \mathbb{R}^ k\), \(g: S\to \mathbb{R}^ m\), and \(h: S\to \mathbb{R}^ l\) are differentiable functions at \(x^ 0\in X\), an efficient solution or a candidate for an efficient solution. The aim of the paper is assuming \(F\)-pseudoconvexity and \(F\)-quasiconvexity of the functions, to extend Kuhn-Tucker sufficient optimality conditions, Wolfe duality theorems and Mond-Weir duality theorems to the vector maximum problem (P).
Recommendations
- Sufficiency and duality in multiobjective programming involving generalized \((F,\rho)\)-convexity
- Sufficiency and Duality in Multiobjective Programming with Generalized (F, ρ)-Convexity
- scientific article; zbMATH DE number 2201818
- Sufficiency and duality in multiobjective programming under generalized type I functions
- Sufficiency and duality in differentiable multiobjective programming involving generalized type I functions
Cited in
(36)- Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions
- Second order mixed type duality in multiobjective programming problems.
- Another approach to multiobjective programming problems with \(F\)-convex functions
- Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions
- Duality for nondifferentiable static multiobjective variational problems involving generalized (F,)-convex functions
- Second order \((F,\alpha ,\rho ,d,E)\)-convex function and the duality problem
- A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems
- Optimality conditions and duality of three kinds of nonlinear fractional programming problems
- Strong duality for proper efficiency in vector optimization
- Higher-order duality for a class of nondifferentiable multiobjective programming problems involving generalized type I and related functions
- Infine functions and nonsmooth multiobjective optimization problems
- Sufficiency and duality in multiobjective programming under generalized type I functions
- Sufficiency and duality in multiobjective variational problems with generalized type I functions
- Second order \((F, \alpha , \rho , d)\)-convexity and duality in multiobjective programming
- Second Order Duality in Multiobjective Programming
- Higher order duality in multiobjective programming with cone constraints
- Multiobjective Problems with Nonsmooth Equality Constraints
- Strong Duality with Proper Efficiency in Multiobjective Optimization Involving Nonconvex Set-Valued Maps
- Duality with generalized convexity
- scientific article; zbMATH DE number 179184 (Why is no real title available?)
- Sufficient optimality criteria and duality for nondifferentiable fractional variational problems with generalized (F, ρ)-convexity
- A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
- Optimality and duality for generalized fractional variational problems involving generalized (fρ)-convex functions
- Minmax programming : optimality and Wolfe type duality for a problem involving bectovex functions
- ρ-Invex Functions and ( F , ρ)Convex Functions: Properties and Equivalences
- Optimality and Wolfe duality for multiobjective bectovex programming
- Optimality and duality for multiobjective fractional programming involving nonsmooth(si:Fesi:ρ)–convex functions
- Saddle point criteria in semi-infinite minimax fractional programming under \((\Phi,\rho)\)-invexity
- Optimality Conditions and Duality for Multiobjective Control Problems
- scientific article; zbMATH DE number 2201818 (Why is no real title available?)
- Sufficiency and Duality in Multiobjective Programming with Generalized (F, ρ)-Convexity
- Second-Order Duality for Nondifferentiable Multiobjective Programming Problems
- Optimality and duality for multiobjective fractional programming involving nonsmooth pseudoinvex functions
- Generalized convexity in multiobjective programming
- Sufficiency and duality in multiobjective programming involving generalized \((F,\rho)\)-convexity
- Sufficiency in nonsmooth multiobjective programming involving generalized ( F, )-convexity
This page was built for publication: Sufficiency and duality in multiobjective programming involving generalized \(F\)-convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329322)
