Contractibility of the solution sets for set optimization problems

Abstract

This paper aims at investigating the contractibility of the solution sets for set optimization problems by utilizing strictly quasi cone-convexlikeness, which is an assumption weaker than strictly cone-convexity, strictly cone-quasiconvexity and strictly naturally quasi cone-convexity. We establish the contractibility of l-minimal, l-weak minimal, u-minimal and u-weak minimal solution sets for set optimization problems by using the star-shape sets and the nonlinear scalarizing functions for sets. Moreover, we also discuss the arcwise connectedness and the contractibility of p-minimal and p-weak minimal solution sets for set optimization problems by using the scalarization technique. Finally, our main results are applied to the contractibility of the solution sets for vector optimization problems.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…