Find an interior point of a polytope given by a set of linear constraints along each dimension.

1 | ```
findInteriorPoint(constr, homogeneous=FALSE, randomize=FALSE)
``` |

`constr` |
Constraint definition |

`homogeneous` |
Whether constr is given in homogeneous coordinate representation |

`randomize` |
Whether the point should be randomized |

See `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.

A vector.

Gert van Valkenhoef

`findExtremePoints`

`findVertices`

1 2 3 4 5 6 7 |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.