.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
Cycling: If a sequence of pivots starting from some basic
feasible solution ends up at the exact sa me basi c feasibl e
solution, then we refer to this as cycling. If the s im p le x
method cycles, i t can cycle forever.
In 1953, Hoffman gave the first cycling example, which had 11
variables and 3 equations.
In 1955, E. M. L. Beale gave a smaller example, which had 7
variables and 3 equations.
3 / 13
评论0
最新资源