This HTML5 document contains 42 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n15http://localhost/temp/predkladatel/
n19http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n13http://linked.opendata.cz/resource/domain/vavai/projekt/
n16http://linked.opendata.cz/ontology/domain/vavai/
n8http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n12http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F09%3A00206350%21RIV10-MSM-11320___/
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n11http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n14http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F09%3A00206350%21RIV10-MSM-11320___
rdf:type
skos:Concept n16:Vysledek
dcterms: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 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. 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.
dcterms:title
Removing degeneracy in LP-type problems revisited Removing degeneracy in LP-type problems revisited
skos:prefLabel
Removing degeneracy in LP-type problems revisited Removing degeneracy in LP-type problems revisited
skos:notation
RIV/00216208:11320/09:00206350!RIV10-MSM-11320___
n3:aktivita
n9:Z n9:P
n3:aktivity
P(1M0545), Z(MSM0021620838)
n3:cisloPeriodika
4
n3:dodaniDat
n14:2010
n3:domaciTvurceVysledku
n19:3374041
n3:druhVysledku
n17:J
n3:duvernostUdaju
n4:S
n3:entitaPredkladatele
n12:predkladatel
n3:idSjednocenehoVysledku
338922
n3:idVysledku
RIV/00216208:11320/09:00206350
n3:jazykVysledku
n11:eng
n3:klicovaSlova
Removing; degeneracy; LP-type; problems; revisited
n3:klicoveSlovo
n6:Removing n6:LP-type n6:degeneracy n6:problems n6:revisited
n3:kodStatuVydavatele
US - Spojené státy americké
n3:kontrolniKodProRIV
[7F9903E1A6CD]
n3:nazevZdroje
Discrete and Computational Geometry
n3:obor
n18:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n13:1M0545
n3:rokUplatneniVysledku
n14:2009
n3:svazekPeriodika
42
n3:tvurceVysledku
Matoušek, Jiří
n3:wos
000271198900001
n3:zamer
n8:MSM0021620838
s:issn
0179-5376
s:numberOfPages
10
n15:organizacniJednotka
11320