Explicit storage, iteration and scalar-visit limits for simplex minimization.
Maximum simultaneous logical scalar slots including borrowed sparse input.
Maximum pairwise weight transfers; a final full pricing pass is separate.
Maximum conservative scalar visits, including admission and final pricing.
Explicit storage, iteration and scalar-visit limits for simplex minimization.