My (Chiffon) Nguyen

Home

❯

Resources

❯

Math

❯

Geometry

❯

convex polyhedron

convex polyhedron

Nov 05, 20241 min read

A convex polyhedron is the intersection of infinite number of half spaces, thus it is also convex.

It could be bounded (called convex polytope) or unbounded.

Credit: Math Monks


Graph View

Backlinks

  • Minerva CS164 Optimization Methods
  • convex polyhedron
  • linear programming

Created with Quartz v4.5.0 © 2025

  • GitHub
  • Mail
  • Home