Modifier and Type | Class and Description |
---|---|
class |
LowerBoundConstraints
This is a lower bound constraints such that for all xi's,
xi ≥ b
|
class |
NonNegativityConstraints
These constraints ensures that for all variables are non-negative.
|
Modifier and Type | Method and Description |
---|---|
LinearGreaterThanConstraints |
BoxConstraints.lowerBoundConstraints()
Split the box constraints and get the greater-than-the-lower-bounds part.
|
LinearGreaterThanConstraints |
LinearLessThanConstraints.toGreaterThanConstraints() |
LinearGreaterThanConstraints |
BoxConstraints.toGreaterThanConstraints() |
Modifier and Type | Method and Description |
---|---|
LinearGreaterThanConstraints |
LPCanonicalProblem1.getGreaterThanConstraints()
Get the greater-than-or-equal-to constraints of the linear programming problem.
|
Constructor and Description |
---|
LPCanonicalProblem1(Vector cost,
LinearGreaterThanConstraints greater)
Construct a linear programming problem in the canonical form.
|
LPProblemImpl1(Vector cost,
LinearGreaterThanConstraints greater,
LinearEqualityConstraints equal)
Construct a general linear programming problem with only greater-than-or-equal-to and
equality constraints.
|
LPProblemImpl1(Vector cost,
LinearGreaterThanConstraints greater,
LinearLessThanConstraints less,
LinearEqualityConstraints equal,
BoxConstraints bounds)
Construct a general linear programming problem.
|
Modifier and Type | Method and Description |
---|---|
LinearGreaterThanConstraints |
QPProblem.getGreaterThanConstraints()
Get the set of linear greater-than-or-equal-to constraints.
|
Constructor and Description |
---|
QPProblem(QuadraticFunction f,
LinearEqualityConstraints equal,
LinearGreaterThanConstraints greater)
Construct a quadratic programming problem with linear equality and greater-than-or-equal-to constraints.
|
QPProblem(QuadraticFunction f,
LinearEqualityConstraints equal,
LinearGreaterThanConstraints greater,
LinearLessThanConstraints less)
Construct a quadratic programming problem.
|
QPProblem(QuadraticFunction f,
LinearGreaterThanConstraints greater)
Construct a quadratic programming problem with linear greater-than-or-equal-to constraints.
|
QPProblem(QuadraticFunction f,
LinearGreaterThanConstraints greater,
LinearLessThanConstraints less)
Construct a quadratic programming problem with linear inequality constraints.
|
Modifier and Type | Method and Description |
---|---|
static LinearGreaterThanConstraints |
ILPNode.getGreaterThanConstraint(Vector minimizer,
int i)
Construct a greater-than constraint for the branching greater-than subproblem.
|
Constructor and Description |
---|
ILPProblemImpl1(Vector cost,
LinearGreaterThanConstraints greater,
LinearLessThanConstraints less,
LinearEqualityConstraints equal,
BoxConstraints bounds,
int[] integers,
double epsilon)
Construct an ILP problem, in which the variables can be real or integral.
|
PureILPProblem(Vector cost,
LinearGreaterThanConstraints greater,
LinearLessThanConstraints less,
LinearEqualityConstraints equal,
BoxConstraints bounds,
double epsilon)
Construct a pure ILP problem.
|
Modifier and Type | Method and Description |
---|---|
LinearGreaterThanConstraints |
QPWeightsLimit.linearGreaterThanConstraints() |
LinearGreaterThanConstraints |
QPNoConstraint.linearGreaterThanConstraints()
Deprecated.
|
LinearGreaterThanConstraints |
QPMinWeights.linearGreaterThanConstraints() |
LinearGreaterThanConstraints |
QPNoShortSelling.linearGreaterThanConstraints() |
LinearGreaterThanConstraints |
QPConstraint.linearGreaterThanConstraints() |
LinearGreaterThanConstraints |
QPUnity.linearGreaterThanConstraints() |
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.