Degeneracy in linear programming
= Degeneracy in linear programming
A <basic feasible solution> is degenerate when one or more of its basic variables is zero. A <simplex algorithm> pivot may then change the basis without moving the feasible point or changing the objective. Assignment networks force many zero-flow basic tree arcs.