Microsoft.SolverFoundation.Solvers Namespace
[This documentation is for preview only, and is subject to change in later releases. Blank topics are included as placeholders.]
The Microsoft.SolverFoundation.Solvers namespace contains classes and enumerations used by Microsoft Solver Foundation 2.1 to implement multiple solvers, such as the compact quasi-Newton solver, constraint satisfaction solver, interior point solver, and simplex solver. If you want to integrate your own solver, use the classes in the Microsoft.SolverFoundation.Services namespace.
Classes
Class | Description | |
---|---|---|
CompactQuasiNewtonModel | Defines the compact quasi-Newton (CQN) solver for nonlinear models. | |
CompactQuasiNewtonSolver | Finds a local minimum or maximum for an unconstrained nonlinear function. | |
CompactQuasiNewtonSolverParams | Defines the parameters for the compact quasi-Newton solver. | |
ConstraintSolverParams | Defines the search strategy for constraint satisfaction programming (CSP). | |
ConstraintSolverSolution | Defines a constraint satisfaction programming (CSP) solution. | |
ConstraintSystem | Defines how to create and solve models. | |
CspComposite | Defines a composite data type that consists of a finite set of terms. | |
CspDomain | Defines all the possible values for a term. | |
CspListOperators | Defines list operators for models. | |
CspPowerList | Defines power-list domains. | |
CspPowerSet | Defines power-set domains. | |
CspSetOperators | Defines set operators for models. | |
CspTerm | Defines a variable or function to use in modeling. | |
HybridLocalSearchModel | The model for the HybridLocalSearchSolver. | |
HybridLocalSearchModel.Goal | Information attached to every goal | |
HybridLocalSearchParameters | Specifies the parameters for the HybridLocalSearchModel. | |
HybridLocalSearchProperties | Represents properties that can be retrieved for the hybrid local search (HLS) solver. | |
HybridLocalSearchSolver | A solver that uses simple, general-purpose local search strategies. | |
InteriorPointSolver | Solves linear and nonlinear convex optimization problems. | |
InteriorPointSolverParams | Defines the parameters for the interior point method (IPM) solver. | |
NelderMeadSolver | Finds a local minimum or maximum for a box-constrained nonlinear function. | |
NelderMeadSolverParams | Parameters for the NelderMeadSolver. | |
SatSolution | Stores information for a SatSolver solution. | |
SatSolver | Defines a satisfaction solver. | |
SatSolverParams | Defines the parameters for the satisfaction solver. | |
SerializationStatus | Defines the error conditions that occur during serialization. | |
SimplexSolver | Defines a branch-and-bound search for optimizing mixed integer problems. | |
SimplexSolverParams | Defines the parameters used by the simplex solver. | |
UnconstrainedNonlinearModel | Represents the base class for unconstrained nonlinear models. |
Structures
Structure | Description | |
---|---|---|
Literal | Defines a Boolean variable or the negation of a Boolean variable. |
Interfaces
Interface | Description | |
---|---|---|
IInteriorPointStatistics | Defines metrics for the solutions of the interior point method (IPM) algorithm. | |
ISimplexPivotInformation | Defines information for solving a simplex pivot. |
Enumerations
Enumeration | Description | |
---|---|---|
BranchingStrategy | Defines the branching strategies for the mixed integer programming (MIP) solver. | |
CompactQuasiNewtonSolutionQuality | Defines the solution quality. | |
ConstraintSolverParams.CspSearchAlgorithm | Defines the search algorithm for constraint satisfaction programming (CSP). | |
ConstraintSolverParams.LocalSearchMove | Defines the heuristics for moves in a local search. | |
ConstraintSolverParams.TreeSearchValueOrdering | Defines the choices for value ordering. | |
ConstraintSolverParams.TreeSearchVariableOrdering | Defines the choices for tree search algorithms. | |
ConstraintSolverSolution.SolutionQuality | Defines the result of the constraint solver. | |
ConstraintSystem.ModelConstructionMode | Defines the modes for model construction. | |
CspDomain.ValueKind | Defines the valid kinds of values in domains. | |
CutKind | Defines the types of cuts that a solver can generate. | |
InteriorPointAlgorithmKind | Defines the options for the interior point method algorithm. | |
InteriorPointKktForm | Defines the options of Karush-Kuhn-Tucker (KKT) matrix arithmetic. | |
NelderMeadStartMethod | Specifies how to initialize the starting point for a NelderMeadSolver. | |
NelderMeadTerminationSensitivity | The termination policy for NelderMead. | |
SearchStrategy | Defines the options for search strategies for the mixed integer programming (MIP) solver. | |
SerializationStatus.Status | Indicates the error code that occurred during the serialization of the constraint system. | |
SimplexAlgorithmKind | Defines two classes of simplex algorithms. | |
SimplexBasisKind | Defines the options for initial basis. | |
SimplexCosting | Defines the options for simplex costing. | |
SimplexVarValKind | Defines variables that are supported by the simplex solver. | |
SolverKind | Defines the types of solvers. |