Abstract In this paper we consider a problem, called convex projection, of projecting set onto subspace. We will show that to projection one can assign particular multi-objective optimization such the solution problem also solves (and vice versa), which is analogous result in polyhedral case considered Löhne and Weißing (Math Methods Oper Res 84(2):411–426, 2016). practice, however, only comput...

This chapter is devoted to summarize common concepts related to multi-objective optimization (MO). An overview of “traditional” as well as CI-based MO is given. Further, all aspects of performance assessment for MO techniques are discussed. Finally, challenges facing MO techniques are addressed. All of these description and analysis give the readers basic knowledge for understandings the rest o...