ConceptEngineering
Constraint redundancy testing
Determining if an inequality in a polyhedron is redundant by maximizing its left-hand side over the remaining inequalities via an LP.
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.
Linear programming1Polyhedra1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.