Nondifferentiable multiobjective programming under generalized \(d\)-univexity

DOI10.1016/S0377-2217(03)00439-9zbMath1067.90150OpenAlexW2103732289MaRDI QIDQ1887881

Yanyan Li

Publication date: 22 November 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00439-9

zbMATH Keywords

DualityMultiobjective programmingOptimalityPareto efficient solutionGeneralized d-univexity

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Related Items (26)

Nonsmooth multiobjective optimization involving generalized univex functions ⋮ On optimality conditions for multiobjective optimization problems in topological vector space ⋮ Nonsmooth multiple-objective optimization in separable Hilbert spaces ⋮ On Efficiency in Nondifferentiable Multiobjective Optimization Involving Pseudo d-Univex Functions; Duality ⋮ Nonsmooth multiobjective optimization using limiting subdifferentials ⋮ Minimax fractional programming under nonsmooth generalized \((\mathcal F,\rho, \theta)\)-d-univexity ⋮ Generalized univex functions in nonsmooth multiobjective optimization ⋮ The study of certain optimization problems via variational inequalities ⋮ Duality and a characterization of pseudoinvexity for Pareto and weak Pareto solutions in nondifferentiable multiobjective programming ⋮ Sufficiency and duality in nonsmooth multiobjective programming problem under generalized univex functions ⋮ Mixed type duality for nondifferentiable multiobjective fractional programming under generalized \((d,\rho, \eta, \theta)\)-type 1 univex function ⋮ Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints ⋮ Optimality criteria and duality in multiobjective programming involving nonsmooth invex functions ⋮ Optimality conditions and duality for a class of nondifferentiable multi-objective fractional programming problems ⋮ Infinite (semi-infinite) problems to characterize the optimality of nonlinear optimization problems ⋮ Mixed Duality without Constraint Qualification for Nonsmooth Fractional Programming ⋮ \(d-\rho -(\eta ,\theta )\)-invexity in multiobjective optimization ⋮ Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions ⋮ Multiobjective Problems with Nonsmooth Equality Constraints ⋮ Optimality conditions for interval-valued univex programming ⋮ Nondifferentiable multiobjective programming under generalized \(d_I\)-invexity ⋮ On vector variational-like inequality problems ⋮ Generalized ( ,α, ρ, θ)–d–V–univex functions and non-smooth alternative theorems ⋮ \(E\)-univex sets, \(E\)-univex functions and \(E\)-differentiable \(E\)-univex programming ⋮ Multiobjective programming under \((\varphi,d)\)-V-type I univexity ⋮ Role of \(\alpha\)-pseudo-univex functions in vector variational-like inequality problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimality and duality in nondifferentiable multiobjective optimization involving \(d\)-type I and related functions
• Multiobjective duality with invexity
• Optimality criteria in mathematical programming involving generalized invexity
• Pre-invex functions in multiple objective optimization
• On sufficiency of the Kuhn-Tucker conditions
• \(D\)-invexity and optimality conditions
• On multiple-objective optimization with generalized univexity
• Optimality criteria and duality in multiple-objective optimization involving generalized invexity
• Optimality and duality with generalized convexity
• On sufficiency and duration in nonsmooth multiobjective programming.
• Optimality and duality with generalized semi-univexity.
• SUFFICIENT OPTIMALITY CONDITIONS AND DUALITY IN MULTIOBJECTIVE OPTIMIZATION INVOLVING GENERALIZED CONVEXITY
• Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming
• Nonsmooth invexity
• Nondifferentiable optimization by smooth approximations
• Necessary and sufficient conditions in constrained optimization
• On generalised convex mathematical programming
• On generalised convex multi-objective nonsmooth programming
• Multiobjective programming under \(d\)-invexity

This page was built for publication: Nondifferentiable multiobjective programming under generalized \(d\)-univexity