
Continuation of modern geometric descriptions of polyhedrons. Included are definitions of convex polyhedron, half spaces, hyperplanes, affine dimension, and some connections to Linear Programming.


Introduction to (modern) Polyhedral Geometry. This lecture defines convex sets and polyhedra and proves a few statements about convex sets and polyhedra.


Videos and all other materials are copyright 2021 Matthias Köppe and shared as Open Educational Resources subject to the Creative Commons AttributionShareAlike 3.0 Unported (CC BYSA 3.0)…


Videos and all other materials are copyright 2021 Matthias Köppe and shared as Open Educational Resources subject to the Creative Commons AttributionShareAlike 3.0 Unported (CC BYSA 3.0)…


Videos and all other materials are copyright 2021 Matthias Köppe and shared as Open Educational Resources subject to the Creative Commons AttributionShareAlike 3.0 Unported (CC BYSA 3.0)…






WeylMinkowski's theorem proved using Fourier Motzkin elimination and Polarity of cones.


FourierMotzkin applied to Farkas lemma and duality






Production planning example: Objective function; graphical method for solving the optimization problem. Notions and basic results on convex polyhedra. notes20201009.pdf Videos and all other…
