Sign inSign in
ConceptMathematics

Simplex method

An algorithm that finds the optimum by moving from one corner of the feasible set to the next along edges that lower the cost.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Corners of feasible sets1Feasible region1Linear programming1

Lecturers

1

    Connections

    3

    The lectures that define it or assume it, and the concepts next to it.

    Concepts2

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.