Publication at Faculty of Mathematics and Physics |
2009
Abstract
We consider LP-type problems, a successful axiomatic framework for optimization problems capturing, e.g., linear programming and the smallest enclosing ball of a point set. Earlier the author and Skovron proved that in order to remove degeneracies of an LP-type problem, we sometimes have to increase its combinatorial dimension by an arbitrarily large amount.
Here somewhat stronger results are proved by a completely different and much simpler method using topology.