Review set
Degenerate corners and their bases
The questions ask you to spot a degenerate solution from its components and to say what follows for an algorithm walking between corners. The count is quick to recall; telling degeneracy from multiple optima, and reading a tie in the ratio test as a warning, is what needs practice.
What this involves
Retrieval after a delay, which is what makes knowledge durable.
Answers here count towards what the system knows about your skills.
What this covers
- Recognise a degenerate basic feasible solution
Given a basic feasible solution, the learner can decide whether it is degenerate, explain the condition both as a count of positive components and as a surplus of active constraints, identify how many bases may describe the point, and state what degeneracy implies for a simplex iteration.