The Cone-Subdifferential of Efficient Solutions Set for Vector Optimizations Problem with Perturbed Order
Shan Li
Abstract
Shan Li
Abstract
Aim To study the cone subdifferential of the cone efficient solution sets for set valued vector optimization problem with perturbed order. Methods The theories of topology, convex analysis and functional analysis are used to study and analyze some properties of the set valued function in the problem. Results The sufficient conditions of cone subdifferential and weak cone subdifferential for cone efficient solutions set and weak cone efficient solutions set of the problem are obtained. Conclusion The theory of vector optimization is complemented.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Aim To study the cone subdifferential of the cone efficient solution sets for set valued vector optimization problem with perturbed order. Methods The theories of topology, convex analysis and functional analysis are used to study and analyze some properties of the set valued function in the problem. Results The sufficient conditions of cone subdifferential and weak cone subdifferential for cone efficient solutions set and weak cone efficient solutions set of the problem are obtained. Conclusion The theory of vector optimization is complemented.
Key concepts: Subderivative, Cone (formal languages), Mathematics, Convex cone, Vector optimization, Dual cone and polar cone, Set (abstract data type), Function (biology)