Optimality conditions for weak efficiency to vector optimization problems with composed convex functions
From MaRDI portal
Publication:944049
DOI10.2478/s11533-008-0036-6zbMath1176.90526OpenAlexW2040919468MaRDI QIDQ944049
Ioan Bogdan Hodrea, Radu Ioan Boţ, Gert Wanka
Publication date: 12 September 2008
Published in: Central European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/s11533-008-0036-6
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Related Items (5)
Optimality and duality in nonsmooth composite vector optimization and applications ⋮ Unnamed Item ⋮ Second-order weakly composed adjacent-generalized contingent epiderivatives and applications to composite set-valued optimization problems ⋮ Higher-order generalized tangent epiderivatives and applications to set-valued optimization ⋮ A new approach to strong duality for composite vector optimization problems
Cites Work
- Necessary and sufficient conditions of optimality for some classical scheduling problems
- Duality for location problems with unbounded unit balls
- Strong duality for generalized convex optimization problems
- First and second-order optimality conditions for convex composite multiobjective optimization
- Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
- New formulas for the Legendre-Fenchel transform.
- Weak efficiency for multiobjective variational problems.
- Convex composite minimization with \(C^{1,1}\) functions
- New constraint qualification and conjugate duality for composed convex optimization problems
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
- Characterizations of solution sets of convex vector minimization problems
- Composite Nonsmooth Programming with Gâteaux Differentiability
- An analysis of some dual problems in multiobjective optimization (I)
- Farkas-Type Results With Conjugate Functions
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimality conditions for weak efficiency to vector optimization problems with composed convex functions
