Removing degeneracy in LP-type problems revisited
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A00206350" target="_blank" >RIV/00216208:11320/09:00206350 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Removing degeneracy in LP-type problems revisited
Original language description
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 anLP-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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Discrete and Computational Geometry
ISSN
0179-5376
e-ISSN
—
Volume of the periodical
42
Issue of the periodical within the volume
4
Country of publishing house
US - UNITED STATES
Number of pages
10
Pages from-to
—
UT code for WoS article
000271198900001
EID of the result in the Scopus database
—