A center of a polytope: An expository review and a parallel implementation
The solution space of the rectangular linear system Ax=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...
Saved in:
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
1993-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S0161171293000262 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The solution space of the rectangular linear system Ax=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. |
---|---|
ISSN: | 0161-1712 1687-0425 |