Click or drag to resize

PrimalSimplexSolverORTools Class

Class PrimalSimplexSolver is a class for solving linear programming prolems using the primal simplex method.
Inheritance Hierarchy

Namespace:  CenterSpace.NMath.Core
Assembly:  NMath (in NMath.dll) Version: 7.3
Syntax
[SerializableAttribute]
public class PrimalSimplexSolverORTools : SimplexSolverBaseORTools, 
	ICloneable

The PrimalSimplexSolverORTools type exposes the following members.

Constructors
Properties
  NameDescription
Public propertyExceptionMessage
If the solver result is SolverResult.UnexpectedException gets the exception message property.
(Inherited from ConstrainedOptimizerORTools.)
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 ConstrainedOptimizerORTools.)
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 ConstrainedOptimizerORTools.)
Public propertyPivotCount
Gets the number of simplex pivots performed. Includes both major and minor pivots.
(Inherited from SimplexSolverBaseORTools.)
Public propertyResult
Gets the result of the most recent solve attempt.
(Inherited from ConstrainedOptimizerORTools.)
Top
Methods
  NameDescription
Protected methodAddConstraints
Adds the linear constraints in the given linearly constrained problem to a Google OR-tools GLOP linear model.
(Inherited from ConstrainedOptimizerORTools.)
Protected methodAddVariablesAndBounds
Adds the variables in the given linearly constrained problem to a Google OR-tools GLOP linear model
(Inherited from ConstrainedOptimizerORTools.)
Public methodClone
Creates a deep copy of self.
Protected methodSetStatus
Sets the SolverResult value base on Google OR-Tools ResultStatus value.
(Inherited from ConstrainedOptimizerORTools.)
Public methodSolve(LinearProgrammingProblem)
Solves a linear programming problem.
(Inherited from SimplexSolverBaseORTools.)
Public methodSolve(MixedIntegerLinearProgrammingProblem)
Solves a mixed integer linear programming problem with default solver parameters.
(Inherited from SimplexSolverBaseORTools.)
Public methodSolve(LinearProgrammingProblem, Boolean)
Solves the given linear programming problem using the supplied primal simplex solver paramters.
Public methodSolve(MixedIntegerLinearProgrammingProblem, Boolean)
Solves the given mixed integer linear programming problem using the supplied primal simplex solver paramters.
Public methodSolve(DoubleVector, DoubleVector, DoubleVector)
Solves a linear programming problems where the variables are constrained by the given bounds. The solution maximizes the objective function.
(Inherited from SimplexSolverBaseORTools.)
Protected methodSolve(LinearProgrammingProblem, Boolean, IEnumerableInt32)
Solves a linear programming problem using the given solver parameters.
(Inherited from SimplexSolverBaseORTools.)
Public methodSolve(DoubleVector, DoubleMatrix, DoubleVector, Int32, Int32, Int32, DoubleVector, DoubleVector)
Solves a linear programming problem with the given constraints and variable bounds.
(Inherited from SimplexSolverBaseORTools.)
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.
(Inherited from SimplexSolverBaseORTools.)
Public methodSolveNonnegative(DoubleVector, DoubleMatrix, DoubleVector, Int32, Int32, Int32)
Solves a linear system. The solution components are constrained to be nonnegative.
(Inherited from SimplexSolverBaseORTools.)
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.
(Inherited from SimplexSolverBaseORTools.)
Top
Fields
  NameDescription
Protected fieldexceptionMessage_
Constains exception message if there is an unexpected exception during the solve.
(Inherited from ConstrainedOptimizerORTools.)
Protected fieldoptimalValue_
Optimal value of the objective function if the the result of the solver is SolveResult.Optimal
(Inherited from ConstrainedOptimizerORTools.)
Protected fieldoptimalX_
Optimal solution value of the the result if the solver is SolveResult.Optimal
(Inherited from ConstrainedOptimizerORTools.)
Protected fieldresult_
Result of the solver attempt.
(Inherited from ConstrainedOptimizerORTools.)
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:
See Also