Simplex

Related lectures (31)

Page 2 of 4

Covers the explicit computations of nerves of categories and geometric realisations of simplicial sets.

Explores lack of fit concept and experimental designs for second-degree functions.

Explains the simplex algorithm process of finding the next vertex and selecting variables.

Covers the process of solving Linear Programs (LPs) using the simplex method.

Covers the simplex algorithm applied to the simple case of inequality constraints.

Covers the Simplex Algorithm, focusing on efficiency and degeneracy in linear optimization problems.

Covers the basics of linear programming and the simplex method, focusing on finding optimal solutions and handling degeneracy.

Introduces two fundamental examples of simplicial sets: the nerve of a small category and the singular simplicial set of a topological space.

Covers the proof of Theorem A, discussing homology, quotients, and isomorphisms.

Explores mixing space, ternary diagrams, greenhouse optimization, and solution scenarios.