Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||Some results on centers of polytopes|
|Abstract:||The main ingredient for polynomiality in interior point methods is the centering procedure. All interior point algorithms for solving linear programing (LP) problems, known to be polynomial, have an explicit or implicit mechanism for finding a center of the LP polytope. Therefore, we consider the study of centers of polytopes as an important undertaking. In this work, we describe three notions of centers of a polytope and their relations. We show that if we can compute any one of them in polynomial time, then we can solve LP in polynomial time.|
interior point methods
centers of polytopes
|Editor:||Taylor & Francis Ltd|
|Appears in Collections:||Artigos e Materiais de Revistas Científicas - Unicamp|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.