In this thesis, we consider several problems related to online resource management. In online optimization, an algorithm has to make decisions based on a sequence of incoming bits of information without knowledge of future inputs. We apply the well-established concept of competitive analysis in...

In real-world applications of optimization, optimal solutions are often of limited value, because disturbances of or changes to input data may diminish the quality of an optimal solution or even render it infeasible. One way to deal with uncertain input data is robust optimization, the aim of...

In this paper we present new concepts of efficiency for uncertain multi-objective optimization problems. We analyze the connection between the concept of minmax robust efficiency presented by Ehrgott et al. (Eur J Oper Res, <CitationRef CitationID="CR14">2014</CitationRef>, doi:<ExternalRef> <RefSource>10.1016/j.ejor.2014.03.013</RefSource> <RefTarget Address="10.1016/j.ejor.2014.03.013" TargetType="DOI"/> </ExternalRef>) and the upper set less order...</refsource></externalref></citationref>