Click or drag to resize

SimplexSolverBase Class

Note: This API is now obsolete.

Class SimplexSolverBase is an abstract base class for classes solving mixed integer linear programming prolems using variants of the simplex method.
Inheritance Hierarchy

Namespace:  CenterSpace.NMath.Core
Assembly:  NMath (in NMath.dll) Version: 7.4
Syntax
[SerializableAttribute]
[ObsoleteAttribute("Instead use SimplexSolverBaseORTools")]
public abstract class SimplexSolverBase : ConstrainedOptimizer

The SimplexSolverBase type exposes the following members.

Constructors
Properties
  NameDescription
Public propertyExceptionMessage
If the solver result is SolverResult.UnexpectedException gets the exception message property.
(Inherited from ConstrainedOptimizer.)
Public propertyOptimalObjectiveFunctionValue
Gets the optimal objective function value if the solve result is SolverResult.Optimal, or the current solution value if the result is SolverResult.SolutionFeasibleButNotOptimal Otherwise the value is Double.NaN.
(Inherited from ConstrainedOptimizer.)
Public propertyOptimalX
Gets the optimal value if the solve result is SolverResult.Optimal, or the current solution value if the result is SolverResult.SolutionFeasibleButNotOptimal Contains an empty vector otherwise.
(Inherited from ConstrainedOptimizer.)
Public propertyPivotCount
Gets the number of simplex pivots performed. Includes both major and minor pivots.
Public propertyResult
Gets the result of the most recent solve attempt.
(Inherited from ConstrainedOptimizer.)
Top
Methods
  NameDescription
Protected methodAddConstraints
Adds the linear constraints in the given linearly constrained problem to a Microsoft Solver Foundation linear model.
(Inherited from ConstrainedOptimizer.)
Protected methodAddVariablesAndBounds
Adds the variables in the given linearly constrained problem to a Microsoft Solver Foundation linear model.
(Inherited from ConstrainedOptimizer.)
Protected methodStatic memberCheck
Checks bounds and constraints.
Protected methodStatic memberCheckBounds(DoubleVector, DoubleVector)
Checks validity of variable upper bounds.
Protected methodStatic memberCheckBounds(DoubleVector, DoubleVector, DoubleVector)
Checks variable bounds.
Protected methodStatic memberCheckConstraints
Checks constraints validity.
Protected methodGetMSFSolverParams
Takes the given set of solver parameters and translates them into Microsoft Solver Foundation parameters.
Protected methodSetStatus
Sets the SolverResult value base on the give Microsoft Solver Foundation LinearResult value.
(Inherited from ConstrainedOptimizer.)
Public methodSolve(LinearProgrammingProblem)
Solves a linear programming problem.
Public methodSolve(MixedIntegerLinearProgrammingProblem)
Solves a mixed integer linear programming problem with default solver parameters.
Public methodSolve(MixedIntegerLinearProgrammingProblem, SimplexSolverMixedIntParams)
Solves a mixed integer linear programming problem using the given solver parameters.
Public methodSolve(MixedIntegerLinearProgrammingProblem, SimplexSolverParamsBase)
Solves a mixed integer linear programming problem using the given solver parameters.
Public methodSolve(DoubleVector, DoubleVector, DoubleVector)
Solves a linear programming problems where the variables are constrained by the give bounds. The solution maximizes the objective function.
Public methodSolve(MixedIntegerLinearProgrammingProblem, SimplexSolverParamsBase, SimplexSolverMixedIntParams)
Solves a mixed integer linear programming problem using the given simplex and mixed integer solver parameters.
Protected methodSolve(LinearProgrammingProblem, SimplexSolverParamsBase, IEnumerableInt32, SimplexSolverMixedIntParams)
Solvers a linear programming problem using the given solver parameters.
Public methodSolve(DoubleVector, DoubleMatrix, DoubleVector, Int32, Int32, Int32, DoubleVector, DoubleVector)
Solves a linear programming problem with the given constraints and variable bounds.
Public methodSolveNonnegative(DoubleVector, DoubleVector)
Solves a linear programming problem. Solution values are constrained by upper bounds and lower bounds of zero. The solution maximizes the objective function.
Public methodSolveNonnegative(DoubleVector, DoubleMatrix, DoubleVector, Int32, Int32, Int32)
Solves a linear system. The solution components are constrained to be nonnegative.
Public methodSolveNonnegative(DoubleVector, DoubleMatrix, DoubleVector, Int32, Int32, Int32, DoubleVector)
Solves a linear programming problem with the given constraints. The solution maximizes the objective function and its components are constrained to be nonnegative.
Top
Fields
  NameDescription
Protected fieldexceptionMessage_
Constains exception message if there is an unexpected exception during the solve.
(Inherited from ConstrainedOptimizer.)
Protected fieldoptimalValue_
Optimal value of the objective function if the the result of the solver is SolveResult.Optimal
(Inherited from ConstrainedOptimizer.)
Protected fieldoptimalX_
Optimal solution value of the the result if the solver is SolveResult.Optimal
(Inherited from ConstrainedOptimizer.)
Protected fieldresult_
Result of the solver attempt.
(Inherited from ConstrainedOptimizer.)
Top
Remarks
A linear programming (LP) problem optimizes a linear objective function subject to a set of linear constraints, and optionally subject to a set of variable bounds. Variables may further be constrained to integer values. The simplex method solves LP problems by constructing a solution at a vertex of a simplex, then walking along edges of the simplex to vertices with successively optimal values of the objective function until the optimum is reached. For example:
See Also