The Linear Inequalities Set Representation of Minkovski's Sum for Two Polyhedrons

A convex polyhedron is represented as a set of the linear inequalities solutions. Minkowski's sum of two convex polyhedrons $X,Y\subset \mathbb{R}^n$ is polyhedron as well is represented as a set of the linear inequalities solutions. Polynomial algorithm of solving this problem based of forming number of extra inequalities in the summands representation and them translation to resultant representation is presented in the paper. Usage of parallel and distributed computation for effective algorithm Implementation is suggested.