DualSimplexSolver Class

Note: This API is now obsolete.

Class DualSimplexSolver is a class for solving linear programming prolems using the dual simplex method.

Inheritance Hierarchy

SystemObject
  CenterSpace.NMath.CoreConstrainedOptimizer
    CenterSpace.NMath.CoreSimplexSolverBase
      CenterSpace.NMath.CoreDualSimplexSolver

Namespace: CenterSpace.NMath.Core
Assembly: NMath (in NMath.dll) Version: 7.4

Syntax

C++

Copy

[SerializableAttribute]
[ObsoleteAttribute("Instead use DualSimplexSolverORTools")]
public class DualSimplexSolver : SimplexSolverBase, 
	ICloneable

<SerializableAttribute>
<ObsoleteAttribute("Instead use DualSimplexSolverORTools")>
Public Class DualSimplexSolver
	Inherits SimplexSolverBase
	Implements ICloneable

[SerializableAttribute]
[ObsoleteAttribute(L"Instead use DualSimplexSolverORTools")]
public ref class DualSimplexSolver : public SimplexSolverBase, 
	ICloneable

[<SerializableAttribute>]
[<ObsoleteAttribute("Instead use DualSimplexSolverORTools")>]
type DualSimplexSolver = 
    class
        inherit SimplexSolverBase
        interface ICloneable
    end

The DualSimplexSolver type exposes the following members.

Constructors

	Name	Description
	DualSimplexSolver	Constructs a DualSimplexSolver instance.
	DualSimplexSolver(DualSimplexSolver)	Copy constructor.

Top

Properties

	Name	Description
	ExceptionMessage	If the solver result is SolverResult.UnexpectedException gets the exception message property. (Inherited from ConstrainedOptimizer)
	OptimalObjectiveFunctionValue	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)
	OptimalX	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)
	PivotCount	Gets the number of simplex pivots performed. Includes both major and minor pivots. (Inherited from SimplexSolverBase)
	Result	Gets the result of the most recent solve attempt. (Inherited from ConstrainedOptimizer)

Top

Methods

	Name	Description
	AddConstraints	Adds the linear constraints in the given linearly constrained problem to a Microsoft Solver Foundation linear model. (Inherited from ConstrainedOptimizer)
	AddVariablesAndBounds	Adds the variables in the given linearly constrained problem to a Microsoft Solver Foundation linear model. (Inherited from ConstrainedOptimizer)
	Clone	Creates a deep copy of self.
	GetMSFSolverParams	Creates a Microsoft Solver Foundation simplex solver parameters from the given dual simplex solver parameters. (Overrides SimplexSolverBaseGetMSFSolverParams(SimplexSolverParamsBase))
	SetStatus	Sets the SolverResult value base on the give Microsoft Solver Foundation LinearResult value. (Inherited from ConstrainedOptimizer)
	Solve(LinearProgrammingProblem)	Solves a linear programming problem. (Inherited from SimplexSolverBase)
	Solve(MixedIntegerLinearProgrammingProblem)	Solves a mixed integer linear programming problem with default solver parameters. (Inherited from SimplexSolverBase)
	Solve(LinearProgrammingProblem, DualSimplexSolverParams)	Solves the given linear programming problem using the given solver parameters.
	Solve(MixedIntegerLinearProgrammingProblem, DualSimplexSolverParams)	Solves the given mixed integer linear programming problem using the given solver parameters.
	Solve(MixedIntegerLinearProgrammingProblem, SimplexSolverMixedIntParams)	Solves a mixed integer linear programming problem using the given solver parameters. (Inherited from SimplexSolverBase)
	Solve(MixedIntegerLinearProgrammingProblem, SimplexSolverParamsBase)	Solves a mixed integer linear programming problem using the given solver parameters. (Inherited from SimplexSolverBase)
	Solve(DoubleVector, DoubleVector, DoubleVector)	Solves a linear programming problems where the variables are constrained by the give bounds. The solution maximizes the objective function. (Inherited from SimplexSolverBase)
	Solve(MixedIntegerLinearProgrammingProblem, SimplexSolverParamsBase, SimplexSolverMixedIntParams)	Solves a mixed integer linear programming problem using the given simplex and mixed integer solver parameters. (Inherited from SimplexSolverBase)
	Solve(LinearProgrammingProblem, SimplexSolverParamsBase, IEnumerableInt32, SimplexSolverMixedIntParams)	Solvers a linear programming problem using the given solver parameters. (Inherited from SimplexSolverBase)
	Solve(DoubleVector, DoubleMatrix, DoubleVector, Int32, Int32, Int32, DoubleVector, DoubleVector)	Solves a linear programming problem with the given constraints and variable bounds. (Inherited from SimplexSolverBase)
	SolveNonnegative(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. (Inherited from SimplexSolverBase)
	SolveNonnegative(DoubleVector, DoubleMatrix, DoubleVector, Int32, Int32, Int32)	Solves a linear system. The solution components are constrained to be nonnegative. (Inherited from SimplexSolverBase)
	SolveNonnegative(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. (Inherited from SimplexSolverBase)

Top

Fields

	Name	Description
	exceptionMessage_	Constains exception message if there is an unexpected exception during the solve. (Inherited from ConstrainedOptimizer)
	optimalValue_	Optimal value of the objective function if the the result of the solver is SolveResult.Optimal (Inherited from ConstrainedOptimizer)
	optimalX_	Optimal solution value of the the result if the solver is SolveResult.Optimal (Inherited from ConstrainedOptimizer)
	result_	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. 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:

Reference

CenterSpace.NMath.Core Namespace