Szabó Eszter: Inverse Optimization Problems

Given a function c, the capacity of a set X is the minimum value of the function c(s) for all elements s in X. The maximum-capacity set problem aims to find a feasible set F with the maximum capacity from a family of feasible sets. In this work, we consider the inverse maximum capacity set problem, where we aim to modify the capacity function as little as possible to make a given set optimal. We consider this problem under different objective functions. I will talk about these problems and the polynomial algorithms for solving them. 

This is a joint work with Kitti Varga.