VERTEX ENUMERATION OF POLYHEDRA
Autor(a) principal: | |
---|---|
Data de Publicação: | 2022 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Pesquisa operacional (Online) |
Texto Completo: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382022000100219 |
Resumo: | ABSTRACT The vertex enumeration problem of a polyhedron P in ℜ n , given by m inequalities, is widely discussed in the literature. In this work it is introduced a new algorithm to solve it. The algorithm is based on lexicographic pivoting and the worst-case time complexity is O m m + n 2 × m i n m , n which is O m n V P for the case of non-degenerate polyhedra, where V P is the number of vertices of P. The proposed algorithm was coded in Matlab and numerical experiments performed for several randomly generated problems show its efficiency. |
id |
SOBRAPO-1_dc251ea0e9d63b4bfd97545d982d87bd |
---|---|
oai_identifier_str |
oai:scielo:S0101-74382022000100219 |
network_acronym_str |
SOBRAPO-1 |
network_name_str |
Pesquisa operacional (Online) |
repository_id_str |
|
spelling |
VERTEX ENUMERATION OF POLYHEDRAvertex enumerationpolyhedrapivotingABSTRACT The vertex enumeration problem of a polyhedron P in ℜ n , given by m inequalities, is widely discussed in the literature. In this work it is introduced a new algorithm to solve it. The algorithm is based on lexicographic pivoting and the worst-case time complexity is O m m + n 2 × m i n m , n which is O m n V P for the case of non-degenerate polyhedra, where V P is the number of vertices of P. The proposed algorithm was coded in Matlab and numerical experiments performed for several randomly generated problems show its efficiency.Sociedade Brasileira de Pesquisa Operacional2022-01-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382022000100219Pesquisa Operacional v.42 2022reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/0101-7438.2022.042.00254570info:eu-repo/semantics/openAccessAssad,Caio LopesMorales,GudeliaArica,Joséeng2022-08-23T00:00:00Zoai:scielo:S0101-74382022000100219Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2022-08-23T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false |
dc.title.none.fl_str_mv |
VERTEX ENUMERATION OF POLYHEDRA |
title |
VERTEX ENUMERATION OF POLYHEDRA |
spellingShingle |
VERTEX ENUMERATION OF POLYHEDRA Assad,Caio Lopes vertex enumeration polyhedra pivoting |
title_short |
VERTEX ENUMERATION OF POLYHEDRA |
title_full |
VERTEX ENUMERATION OF POLYHEDRA |
title_fullStr |
VERTEX ENUMERATION OF POLYHEDRA |
title_full_unstemmed |
VERTEX ENUMERATION OF POLYHEDRA |
title_sort |
VERTEX ENUMERATION OF POLYHEDRA |
author |
Assad,Caio Lopes |
author_facet |
Assad,Caio Lopes Morales,Gudelia Arica,José |
author_role |
author |
author2 |
Morales,Gudelia Arica,José |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Assad,Caio Lopes Morales,Gudelia Arica,José |
dc.subject.por.fl_str_mv |
vertex enumeration polyhedra pivoting |
topic |
vertex enumeration polyhedra pivoting |
description |
ABSTRACT The vertex enumeration problem of a polyhedron P in ℜ n , given by m inequalities, is widely discussed in the literature. In this work it is introduced a new algorithm to solve it. The algorithm is based on lexicographic pivoting and the worst-case time complexity is O m m + n 2 × m i n m , n which is O m n V P for the case of non-degenerate polyhedra, where V P is the number of vertices of P. The proposed algorithm was coded in Matlab and numerical experiments performed for several randomly generated problems show its efficiency. |
publishDate |
2022 |
dc.date.none.fl_str_mv |
2022-01-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382022000100219 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382022000100219 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.1590/0101-7438.2022.042.00254570 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
text/html |
dc.publisher.none.fl_str_mv |
Sociedade Brasileira de Pesquisa Operacional |
publisher.none.fl_str_mv |
Sociedade Brasileira de Pesquisa Operacional |
dc.source.none.fl_str_mv |
Pesquisa Operacional v.42 2022 reponame:Pesquisa operacional (Online) instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO) instacron:SOBRAPO |
instname_str |
Sociedade Brasileira de Pesquisa Operacional (SOBRAPO) |
instacron_str |
SOBRAPO |
institution |
SOBRAPO |
reponame_str |
Pesquisa operacional (Online) |
collection |
Pesquisa operacional (Online) |
repository.name.fl_str_mv |
Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO) |
repository.mail.fl_str_mv |
||sobrapo@sobrapo.org.br |
_version_ |
1750318018516221952 |