Find an interior point of a polytope given by a set of linear constraints along each dimension.
Whether constr is given in homogeneous coordinate representation
Whether the point should be randomized
har for a description of the constraint definition and the homogeneous coordinate representation.
Solves a slack-maximizing LP to find an interior point of the polytope defined by the given constraints. The randomized version randomly scales the slack on each (non-redundant) constraint.
Gert van Valkenhoef
1 2 3 4 5 6 7