Generalized ( ,α, ρ, θ)–d–V–univex functions and non-smooth alternative theorems
From MaRDI portal
Publication:5852131
DOI10.1080/00207160801989867zbMath1206.90168OpenAlexW131053668MaRDI QIDQ5852131
Zi-Shuang Tong, Xiao Jin Zheng
Publication date: 26 January 2010
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160801989867
Related Items (2)
Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \((F,\alpha ,\rho ,\theta)\)-d-V-univex functions ⋮ Unnamed Item
Cites Work
- The essence of invexity
- Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions
- Minimax fractional programming under nonsmooth generalized \((\mathcal F,\rho, \theta)\)-d-univexity
- On sufficiency of the Kuhn-Tucker conditions
- Characterizations of the Benson proper efficiency for nonconvex vector optimization
- A theorem of the alternative and its application to the optimization of set-valued maps
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
- Infine functions, nonsmooth alternative theorems and vector optimization problems
- Duality and saddle-point type optimality for generalized nonlinear fractional programming.
- Near-subconvexlikeness in vector optimization with set-valued functions
- Nondifferentiable multiobjective programming under generalized \(d\)-univexity
- Proper efficiency and the theory of vector maximization
- Invex multifunctions and duality
- Nonsmooth invexity
- Optimization and nonsmooth analysis
- Necessary and sufficient conditions in constrained optimization
- On generalised convex mathematical programming
- Invex nonsmooth alternative theorem and applications*
- Invexity in multifunction optimization
- Convex Analysis
This page was built for publication: Generalized ( ,α, ρ, θ)–d–V–univex functions and non-smooth alternative theorems
