"[7F9903E1A6CD]" . . "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."@en . . "Matou\u0161ek, Ji\u0159\u00ED" . "Discrete and Computational Geometry" . "RIV/00216208:11320/09:00206350!RIV10-MSM-11320___" . . . "4" . "1"^^ . "000271198900001" . "10"^^ . . "Removing; degeneracy; LP-type; problems; revisited"@en . "1"^^ . "0179-5376" . "42" . . "RIV/00216208:11320/09:00206350" . . . . "Removing degeneracy in LP-type problems revisited" . . "US - Spojen\u00E9 st\u00E1ty americk\u00E9" . "Removing degeneracy in LP-type problems revisited" . "Removing degeneracy in LP-type problems revisited"@en . "338922" . . "11320" . . "P(1M0545), Z(MSM0021620838)" . . "Removing degeneracy in LP-type problems revisited"@en . . . "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." . . . . .