Simplex: This determines the
type of crash
used when the algorithm begins. During the crash procedure, an initial basis is determined which is
as close to feasibility and triangularity as possible. A good choice at this stage will
significantly reduce the number of iterations required to find an optimal solution. The possible
values increase proportionally to their time-consumption.