ILinearProgramSolver<T>
Interfaces · AiDotNet.Solvers.LinearProgramming
Solves linear programs.
Known implementations: InteriorPointSolver<T>, SimplexSolver<T>
For Beginners
You describe the problem (what to minimize, what the limits are) and the solver hands back the best allowed choice, or tells you that no allowed choice exists, or that your limits let the answer run away to infinity.
How It Works
Implementations differ in algorithm — the simplex method walks the vertices of the feasible region, while interior-point methods cut through its middle — but agree on this contract, so a caller can swap one for the other without changing anything else.
Methods
| Method | Summary |
|---|---|
LinearProgramSolution<T> Solve(LinearProgram<T> program) |
Solves a linear program. |