TOPICS
Search

Search Results for ""


141 - 150 of 550 for Convex PolytopeSearch Results
The Kuhn-Tucker theorem is a theorem in nonlinear programming which states that if a regularity condition holds and f and the functions h_j are convex, then a solution ...
There are a number of attractive polyhedron compounds consisting of 12 octahedra. This compound will be implemented in a future version of the Wolfram Language as ...
There are a number of attractive polyhedron compounds consisting of 13 octahedra. This compound will be implemented in a future version of the Wolfram Language as ...
There are a number of attractive polyhedron compounds consisting of 25 octahedra. These compounds will be implemented in a future version of the Wolfram Language as ...
There are a number of attractive polyhedron compounds consisting of 30 octahedra. This compound will be implemented in a future version of the Wolfram Language as ...
There are a number of attractive polyhedron compounds consisting of 35 octahedra. This compound will be implemented in a future version of the Wolfram Language as ...
There are a number of attractive polyhedron compounds consisting of six octahedra. The two illustrated above can be constructed as the duals of cube 6-compounds. These ...
There are a number of attractive polyhedron compounds consisting of seven octahedra. The compound illustrated above can be constructed as the dual of cube 7-compound. The ...
There are a number of attractive polyhedron compounds consisting of nine octahedra. The compound illustrated above can be constructed as the dual of cube 9-compound. The ...
A number of attractive 50-compounds of the regular tetrahedron can be constructed. The compounds illustrated above will be implemented in a future version of the Wolfram ...
1 ... 12|13|14|15|16|17|18 ... 55 Previous Next

...