Optimality conditions for weak efficiency to vector optimization problems with composed convex functions

DOI10.2478/S11533-008-0036-6MaRDI QIDQ944049zbMATH OpenOpenAlexFDO

Authors Radu I. Boţ, Ioan Bogdan Hodrea, Gert Wanka

Publication date 12 September 2008

Published in Central European Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.2478/s11533-008-0036-6

zbMATH Keywords

composed convex functionsconjugate dualitymultiobjective optimizationweak efficiency

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Optimality and duality in nonsmooth composite vector optimization and applications
• Scalar and vector optimization with composed objective functions and constraints
• scientific article; zbMATH DE number 883360
• Conjugate duality for multiobjective composed optimization problems
• Optimality conditions of multiobjective programming problems based on weak convexity

Cites work

• An analysis of some dual problems in multiobjective optimization (I)
• Characterizations of solution sets of convex vector minimization problems
• Composite Nonsmooth Programming with Gâteaux Differentiability
• Convex Analysis
• Convex composite minimization with \(C^{1,1}\) functions
• Duality for location problems with unbounded unit balls
• Farkas-type results for inequality systems with composed convex functions via conjugate duality
• Farkas-Type Results With Conjugate Functions
• First and second-order optimality conditions for convex composite multiobjective optimization
• scientific article; zbMATH DE number 3926624 (Why is no real title available?)
• scientific article; zbMATH DE number 3927769 (Why is no real title available?)
• scientific article; zbMATH DE number 3595790 (Why is no real title available?)
• scientific article; zbMATH DE number 734672 (Why is no real title available?)
• scientific article; zbMATH DE number 1792004 (Why is no real title available?)
• Necessary and sufficient conditions of optimality for some classical scheduling problems
• New constraint qualification and conjugate duality for composed convex optimization problems
• New formulas for the Legendre-Fenchel transform.
• Strong duality for generalized convex optimization problems
• Weak efficiency for multiobjective variational problems.
• Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.

Cited in

(7)

• 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
• Scalar and vector optimization with composed objective functions and constraints
• Optimality and duality for a weakly efficient solution of bilevel multiobjective fractional programming problems with extremal-value function
• Optimality and duality in nonsmooth composite vector optimization and applications
• -optimality conditions for composed convex optimization problems

This page was built for publication: Optimality conditions for weak efficiency to vector optimization problems with composed convex functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q944049)