Sign inSign in
ConceptEngineering

Smallest set of mutually infeasible inequalities

Finding the smallest subset of mutually infeasible convex inequalities that is itself infeasible using dual variables.
as Stephen Boyd defines itStanford University
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.

Certificate of infeasibility1Convex inequalities1Duality1Infeasibility1

Lecturers

1

    Connections

    2

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

    Concept1

    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.