In this paper, we extend the concept of cone-convexlikeness of single-valued maps to set-valued maps and study super efficiency in cone-convexlike vector optimization with set-valued maps. Under the assumption of the cone-convexlikeness, some characterizations of super efficiency are established...

In this paper, we extend the concept of cone-convexlikeness of single-valued maps to set-valued maps and study super efficiency in cone-convexlike vector optimization with set-valued maps. Under the assumption of the cone-convexlikeness, some characterizations of super efficiency are established...

Abstract We discuss a general framework of optimal stopping under constraints. We extend the Snell envelope and the characterization of optimal stopping times to our framework with constraints and give a condition which ensures the existence of a right-continuous version. We then study...