Document Type

Article

Publication Title

International Journal of Mathematics and Mathematical Sciences

Abstract

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. © 1993, Hindawi Publishing Corporation. All rights reserved.

First Page

209

Last Page

224

DOI

10.1155/S0161171293000262

Publication Date

3-1-1992

Share

COinS