Question

Give Two examples of Convex Pllyhedron....

Answer 1

Answer:

A convex polyhedron can be defined algebraically as the set of solutions to a system of linear inequalities

mx<=b,  

where m is a real s×3 matrix and b is a real s-vector. Although usage varies, most authors additionally require that a solution be bounded for it to qualify as a convex polyhedron. A convex polyhedron may be obtained from an arbitrary set of points by computing the convex hull of the points. The surface defined by a set of inequalities may be visualized using the command RegionPlot3D[ineqs,  {x, xmin, xmax}, {y, ymin, ymax}, {z, zmin, zmax}]. The method of vertex enumeration (Fukuda and Mizukoshi) can also be used to determine the faces of the resulting polyhedron directly.

Step-by-step explanation: