SimplexSolverOptions
Options & Configuration · AiDotNet.Models.Options
Configuration for the simplex linear-programming solver.
Inheritance: ModelOptions → SimplexSolverOptions
For Beginners
These settings control how accurately and how long the simplex solver searches the corners of a linear problem before returning.
How It Works
Every value has a documented default drawn from standard practice, and every one is settable, so no behaviour of the solver is hard-coded out of the caller’s reach.
Reference: George B. Dantzig, “Maximization of a Linear Function of Variables Subject to Linear Inequalities” (1947), with Bland’s anti-cycling rule (1977).
Constructors
| Constructor | Summary |
|---|---|
SimplexSolverOptions() |
Initializes the options with documented defaults. |
SimplexSolverOptions(SimplexSolverOptions other) |
Initializes the options by copying another configuration. |
Properties
| Property | Summary |
|---|---|
double Tolerance { get; set; } |
Gets or sets the magnitude below which a tableau entry is treated as zero. |
int DegeneratePivotsBeforeBlandsRule { get; set; } |
Gets or sets the number of consecutive degenerate pivots tolerated before the solver switches to Bland’s anti-cycling rule. |
int MaxIterations { get; set; } |
Gets or sets the maximum number of simplex pivots across both phases. |