Nickel, StefanStefanNickelSchöbel, AnitaAnitaSchöbel2017-09-072017-09-071999https://resolver.sub.uni-goettingen.de/purl?gro-2/4674In this paper we consider the problem of optimizing a piecewise-linear objective function over a non-convex domain. In particular we do not allow the solution to lie in the interior of a prespecified region R. We discuss the geometrical properties of this problems and present algorithms based on combinatorial arguments. In addition we show how we can construct quite complicated shaped sets R while maintaining the combinatorial properties.enjournal_article10.1023/a:10083676081723146867