Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Some results on centers of polytopes
Author: Barnes, ER
Moretti, AC
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.
Subject: linear programing
interior point methods
centers of polytopes
Country: Inglaterra
Editor: Taylor & Francis Ltd
Citation: Optimization Methods & Software. Taylor & Francis Ltd, v. 20, n. 1, n. 9, n. 24, 2005.
Rights: fechado
Identifier DOI: 10.1080/10556780410001722462
Date Issue: 2005
Appears in Collections:Unicamp - Artigos e Outros Documentos

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.