In[7]:= RegionMember[Octahedron[], {x, y, z}]
Out[7]= RegionMember[Octahedron[], {x, y, z}]
In[13]:= FindMinimum[{z, RegionMember[#, {x, y, z}]}, {x, y,
z}] & /@ {Tetrahedron[], Cube[], Dodecahedron[], Icosahedron[]}
During evaluation of In[13]:= FindMinimum::dinfeas: The dual is infeasible, which implies that the primal optimization is either unbounded or infeasible.
During evaluation of In[13]:= FindMinimum::ubnd: The problem is unbounded.
During evaluation of In[13]:= FindMinimum::dinfeas: The dual is infeasible, which implies that the primal optimization is either unbounded or infeasible.
During evaluation of In[13]:= FindMinimum::dinfeas: The dual is infeasible, which implies that the primal optimization is either unbounded or infeasible.
During evaluation of In[13]:= General::stop: Further output of FindMinimum::dinfeas will be suppressed during this calculation.
Out[13]= {{-\[Infinity], {x -> Indeterminate, y -> Indeterminate,
z -> Indeterminate}}, {-\[Infinity], {x -> Indeterminate,
y -> Indeterminate,
z -> Indeterminate}}, {-\[Infinity], {x -> Indeterminate,
y -> Indeterminate,
z -> Indeterminate}}, {-\[Infinity], {x -> Indeterminate,
y -> Indeterminate, z -> Indeterminate}}}