A center of a polytope: An expository review and a parallel implementation

S. K. Sen, Hongwei Du and D. W. Fausett

International Journal of Mathematics and Mathematical Sciences, 1993, vol. 16, 1-16

Abstract:

The solution space of the rectangular linear system A x = b , subject to x ≥ 0 , is called a polytope. An attempt is made to provide a deeper geometric insight, with numerical examples, into the condensed paper by Lord, et al. [1], that presents an algorithm to compute a center of a polytope. The algorithm is readily adopted for either sequential or parallel computer implementation. The computed center provides an initial feasible solution (interior point) of a linear programming problem.

Date: 1993
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/16/496747.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/16/496747.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:496747

DOI: 10.1155/S0161171293000262

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().