Click or drag to resize

MixedIntegerLinearProgrammingProblem Class

Class MixedIntegerLinearProgrammingProblem encapsulates a Linear programming problem which may contain integral constraints.
Inheritance Hierarchy

Namespace:  CenterSpace.NMath.Core
Assembly:  NMath (in NMath.dll) Version: 7.3
Syntax
[SerializableAttribute]
public class MixedIntegerLinearProgrammingProblem : LinearProgrammingProblem

The MixedIntegerLinearProgrammingProblem type exposes the following members.

Constructors
  NameDescription
Public methodMixedIntegerLinearProgrammingProblem
Default constructor. Behavior of resulting object is undefined.
Public methodMixedIntegerLinearProgrammingProblem(DoubleVector)
Constructs a MixedIntegerLinearProgrammingProblem object for minimizing objective function dot(objectiveCoefficients, x), where x is the vector of variables.
Top
Properties
  NameDescription
Public propertyConstraints
Gets and sets the linear constraints for the problem.
(Inherited from LinearConstrainedProblem.)
Public propertyIntegralVariableIndices
Gets the zero based indices of variables with integral constraints.
Public propertyNumVariables
Gets the number of variables.
(Inherited from LinearProgrammingProblem.)
Public propertyObjectiveCoefficients
Gets and sets the coefficients for the objective function.
(Inherited from LinearProgrammingProblem.)
Public propertyVariableBounds
Gets and sets variable bounds for the problem.
(Inherited from BoundedVariableProblem.)
Top
Methods
  NameDescription
Public methodAddBinaryConstraint(Int32)
Adds a binary constraint to the variable at the given index. A binary constraint restricts the variable to a value of zero or one.
Public methodAddBinaryConstraint(Int32)
Adds a binary constraint to the variables at the given indices. A binary constraint restricts the variable to a value of zero or one.
Public methodAddBounds(Int32, Double, Double)
Adds upper and lower bound constraints to a variable.
(Inherited from BoundedVariableProblem.)
Public methodAddBounds(Int32, Double, Double, Double)
Adds upper and lower bound constraints to a variable.
(Inherited from BoundedVariableProblem.)
Public methodAddConstraint(LinearConstraint)
Adds the given constraint to the problem.
(Inherited from LinearConstrainedProblem.)
Public methodAddConstraint(DoubleVector, Double, Double)
Adds a linear inequality constraint of the form lowerBound <= coefficients'x < upperBound
(Inherited from LinearConstrainedProblem.)
Public methodAddConstraint(ILinearConstraintCoefficients, Double, Double)
Adds a linear inequality constraint of the form lowerBound <= coefficients'x < upperBound
(Inherited from LinearConstrainedProblem.)
Public methodAddConstraint(DoubleVector, Double, Double, Double)
Adds a linear inequality constraint of the form lowerBound <= coefficients'x < upperBound
(Inherited from LinearConstrainedProblem.)
Public methodAddConstraint(ILinearConstraintCoefficients, Double, Double, Double)
Adds a linear inequality constraint of the form lowerBound <= coefficients'x < upperBound
(Inherited from LinearConstrainedProblem.)
Public methodAddEqualityConstraint(DoubleVector, Double)
Adds an equality constraint of the form coefficients'x = rightHandSide
(Inherited from LinearConstrainedProblem.)
Public methodAddEqualityConstraint(ILinearConstraintCoefficients, Double)
Adds an equality constraint of the form coefficients'x = rightHandSide
(Inherited from LinearConstrainedProblem.)
Public methodAddIntegralConstraint
Adds in integral constraint to the variable at the given zero based index. The index must be between zero and number of variables minus one, inclusive.
Public methodAddLowerBound(Int32, Double)
Adds an lower bound constraint on the variable at the given index.
(Inherited from BoundedVariableProblem.)
Public methodAddLowerBound(Int32, Double, Double)
Adds an lower bound constraint on the variable at the given index.
(Inherited from BoundedVariableProblem.)
Public methodAddLowerBoundConstraint(DoubleVector, Double)
Adds a linear inequality constraint of the form coefficients'x >= lowerBound
(Inherited from LinearConstrainedProblem.)
Public methodAddLowerBoundConstraint(ILinearConstraintCoefficients, Double)
Adds a linear inequality constraint of the form coefficients'x >= lowerBound
(Inherited from LinearConstrainedProblem.)
Public methodAddLowerBoundConstraint(DoubleVector, Double, Double)
Adds a linear inequality constraint of the form coefficients'x >= lowerBound
(Inherited from LinearConstrainedProblem.)
Public methodAddLowerBoundConstraint(ILinearConstraintCoefficients, Double, Double)
Adds a linear inequality constraint of the form coefficients'x >= lowerBound
(Inherited from LinearConstrainedProblem.)
Public methodAddUpperBound(Int32, Double)
Adds an upper bound constraint on the variable at the given index.
(Inherited from BoundedVariableProblem.)
Public methodAddUpperBound(Int32, Double, Double)
Adds an upper bound constraint on the variable at the given index.
(Inherited from BoundedVariableProblem.)
Public methodAddUpperBoundConstraint(DoubleVector, Double)
Adds a linear inequality constraint of the form coefficients'x <= upperBound
(Inherited from LinearConstrainedProblem.)
Public methodAddUpperBoundConstraint(ILinearConstraintCoefficients, Double)
Adds a linear inequality constraint of the form coefficients'x <= upperBound
(Inherited from LinearConstrainedProblem.)
Public methodAddUpperBoundConstraint(DoubleVector, Double, Double)
Adds a linear inequality constraint of the form coefficients'x <= upperBound
(Inherited from LinearConstrainedProblem.)
Public methodAddUpperBoundConstraint(ILinearConstraintCoefficients, Double, Double)
Adds a linear inequality constraint of the form coefficients'x <= upperBound
(Inherited from LinearConstrainedProblem.)
Protected methodCheckVariableIndex
Checks that the given variable array index is valid.
(Inherited from LinearProgrammingProblem.)
Public methodClone
Returns a deep copy of self.
Public methodEvaluateConstraints
Evaluates each of the constraints at the specified point and returns the results.
(Inherited from LinearConstrainedProblem.)
Public methodGetIntegrality
Gets the integral constraint state of the variable at the given zero based index.
Public methodPointIsFeasible(DoubleVector)
Function for determining the feasibility of a give point. A point x is feasible if it satisfies all variable bounds, linear and integral constraints.
(Overrides LinearConstrainedProblemPointIsFeasible(DoubleVector).)
Public methodPointIsFeasible(DoubleVector, Double)
Function for determining the feasibility of a give point. A point x is feasible if it satisfies all variable bounds, linear and integral constraints.
(Overrides LinearConstrainedProblemPointIsFeasible(DoubleVector, Double).)
Public methodSetIntegrality
Sets an integrality constraint for the variable with the given zero based index.
Public methodToString
Creates a string representation of the problem.
(Overrides LinearProgrammingProblemToString.)
Top
Fields
  NameDescription
Protected fieldconstraints_
Problem constraints.
(Inherited from LinearConstrainedProblem.)
Protected fieldvariableBounds_
Map containing variable bounds. Key is the variable ID, the value is the bounds.
(Inherited from BoundedVariableProblem.)
Top
Remarks
A mixed integer 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. Some or all of the variables may further be constrained to have integral values. For example:
See Also