![]() | Simplex |
Note: This API is now obsolete.
The SimplexSolverMixedIntParams type exposes the following members.
Name | Description | |
---|---|---|
![]() | SimplexSolverMixedIntParams | Constructs a SimplexSolverMixedIntParams object with default values for the parameters. Default values are: PostFeasibilityBranchingStrategy = BranchingStrategies.Automatic; PreFeasibilityBranchingStrategy = BranchingStrategies.Automatic; GapTolerance = 1e-5; GenerateCuts = false; GomoryCutRoundLimit = 200; NodePresolve = false; Presolve = true; SearchStrategy = SearchStrategies.BestBound; |
Name | Description | |
---|---|---|
![]() | GapTolerance | Gets or sets the tolerance to declare an integer solution optimal. Default is 1e-5 |
![]() | GenerateCuts | Gets or sets a value that specifies whether to generate cuts. Default is false. |
![]() | GomoryCutRoundLimit | Gets or sets the limit on generating cutting planes. Default is 200. |
![]() | NodePresolve | Gets or sets a value that indicates whether to perform presolve during a search. Default is false. |
![]() | PostFeasibilityBranchingStrategy | Gets or sets the method that the solver uses after feasibility to select variables to branch on. Default is BranchingStrategies.Automatic. |
![]() | PreFeasibilityBranchingStrategy | Gets or sets the method that the solver uses before feasibility to select variables to branch on. Default is BranchingStrategies.Automatic. |
![]() | Presolve | Gets or sets a value that indicates whether to presolve the mixed integer problem. Default is true. |
![]() | SearchStrategy | Gets or sets the search strategy for finding an optimal solution. Default is SearchStrategies.BestBound. |
Name | Description | |
---|---|---|
![]() | Clone | Returns a deep copy of self. |
![]() | ToString |
Creates a string representation for the solver.
(Overrides ObjectToString) |