Preprint series: 06-14 , Reports on Optimization and Stochastics

MSC:

90C29 Multi-objective and goal programming; vector optimization

Abstract: We investigate two rather technical properties concerning Lipschitz mappings. In the first part, we show that the result of Roberts and Varberg on the Lipschitz conditions for convex functions also holds for mappings with values in partially ordered spaces. In the second part, we prove that the distance functions can be used for exact penalization in vector optimization problems. Our results are close to similar assertions in real-valued convex optimization.

Keywords: vector-valued optimization, Lipschitz condition, abstract constraints, exact penalization

Upload: 2006-11-15