  A polyhedral approximation of a convex body can be calculated by solving
approximately an associated multiobjective convex program (MOCP). An MOCP can
be solved approximately by Benson type algorithms, which compute outer and
inner polyhedral approximations of the problem's upper image. Polyhedral
approximations of a convex body can be obtained from polyhedral approximations
of the upper image of the associated MOCP. We provide error bounds in terms of
the Hausdorff distance for the polyhedral approximation of a convex body in
dependence of the stopping criteria of the primal and dual Benson algorithm
which is applied to the associated MOCP.
