Hpolytope

A H-polytope is a convex polytope defined by a set of linear inequalities or equivalently a \(d\)-dimensional H-polytope with \(m\) facets is defined by a \(m\times d\) matrix A and a \(m\)-dimensional vector b, s.t.: \(P=\{x\ |\ Ax\leq b\} \).

Provides an R interface for 'volesti' C++ package. 'volesti' computes estimations of volume
of polytopes given by (i) a set of points, (ii) linear inequalities or (iii) Minkowski sum of segments
(a.k.a. zonotopes). There are three algorithms for volume estimation as well as algorithms
for sampling, rounding and rotating polytopes. Moreover, 'volesti' provides algorithms for
estimating copulas useful in computational finance.

Vissarion Fisikopoulos

volesti

Volume Approximation and Sampling of Convex Polytopes

Hpolytope function

<ul>
<li><code>A</code> A \(m\times d\) numerical matrix A</li>
<li><code>b</code> \(m\)-dimensional vector b</li>
<li><code>type</code> An integer that declares the representation of the polytope. For H-representation the default value is 1.</li>
<li><code>dimension</code> The dimension of the polytope.</li>
<li><code>volume</code> The volume of the polytope, if it is known.</li>
</ul>

Hpolytope: An `R` class to represent H-polytopes.

Description

Arguments

Fields