Speaker: Marcel Turkensteen, econ, AU

Title: Tolerances of combinatorial optimization problems

Abstract:

This presentation is about the computation of so-called tolerances. These values apply to a problem in which we wish to find a combination of elements, with some feasibility criterion, that minimize an overall objective value. For example, in an assignment problem, we want to find the combination (solution) of jobs and workers (elements) which minimizes the sum of the costs (objective),  and such that each worker is assigned to one job and vice versa (feasibility).  A tolerance measures the largest change such that the current optimal solution remains optimal.

This presentation consists of two parts. The first part presents 'joint' tolerances of multiple elements as the same time. The second part presents the efficient computation of tolerances when the objective is to minimize the maximum cost.

The presentation will be 100% data and analytics-free.

Coordinators: Sanne Wøhlk and Marcel Turkensteen