Klee Minty 3D LP

A 3D LP where the ‘dantzig’ pivot rule results in a simplex path through every bfs. Klee, Victor; Minty, George J. (1972). “How good is the simplex algorithm?”

maxs.t. (0)zx​4x​5x​6 = 0 + 4x​1 + 2x​2 + 1x​3= 5 - 1x​1 + 0x​2 + 0x​3= 25 - 4x​1 - 1x​2 + 0x​3= 125 - 8x​1 - 4x​2 - 1x​3
Constraint(s)(4) 1x​1 + 0x​2 + 0x​3 ≤ 5(5) 4x​1 + 1x​2 + 0x​3 ≤ 25(6) 8x​1 + 4x​2 + 1x​3 ≤ 125Objective Value: 0.00.052.81105.62147.88200.69Iteration: 001234567