In this paper, we study a method for finding robust solutions to multiobjective optimization problems under uncertainty. We follow the set-based minmax approach for handling the uncertainties which leads to a certain set optimization problem with the strict upper type set relation. We introduce, under some assumptions, a reformulation using instead the strict lower type … Read more
This paper considers an extension of the shortest path network interdiction problem that incorporates robustness to account for parameter uncertainty. The shortest path interdiction problem is a game of two players with conflicting agendas and capabilities: an evader, who traverses the arcs of a network from a source node to a sink node using the … Read more
We study robust versions of the uncapacitated lot sizing problem, where the demand is subject to uncertainty. The robust models are guided by three parameters, namely, the total scaled uncertainty budget, the minimum number of periods in which one would like the demand to be protected against uncertainty, and the minimum scaled protection level per … Read more