Modifier and Type | Class and Description |
---|---|
class |
UpperBoundConstraints
This is an upper bound constraints such that for all xi's,
xi ≤ b
|
Modifier and Type | Method and Description |
---|---|
LinearLessThanConstraints |
LinearGreaterThanConstraints.toLessThanConstraints() |
LinearLessThanConstraints |
BoxConstraints.toLessThanConstraints() |
LinearLessThanConstraints |
BoxConstraints.upperBoundConstraints()
Split the box constraints and get the less-than-the-upper-bounds part.
|
Modifier and Type | Method and Description |
---|---|
LinearLessThanConstraints |
LPProblemImpl1.getLessThanConstraints() |
Constructor and Description |
---|
LPCanonicalProblem2(Vector cost,
LinearLessThanConstraints less)
Construct a linear programming problem in the canonical form.
|
LPProblemImpl1(Vector cost,
LinearGreaterThanConstraints greater,
LinearLessThanConstraints less,
LinearEqualityConstraints equal,
BoxConstraints bounds)
Construct a general linear programming problem.
|
Modifier and Type | Method and Description |
---|---|
LinearLessThanConstraints |
QPProblem.getLessThanConstraints() |
Constructor and Description |
---|
QPProblem(QuadraticFunction f,
LinearEqualityConstraints equal,
LinearGreaterThanConstraints greater,
LinearLessThanConstraints less)
Construct a quadratic programming problem.
|
QPProblem(QuadraticFunction f,
LinearEqualityConstraints equal,
LinearLessThanConstraints less)
Construct a quadratic programming problem with linear equality and less-than-or-equal-to constraints.
|
QPProblem(QuadraticFunction f,
LinearGreaterThanConstraints greater,
LinearLessThanConstraints less)
Construct a quadratic programming problem with linear inequality constraints.
|
QPProblem(QuadraticFunction f,
LinearLessThanConstraints less)
Construct a quadratic programming problem with linear less-than-or-equal-to constraints.
|
Modifier and Type | Method and Description |
---|---|
static LinearLessThanConstraints |
ILPNode.getLessThanConstraint(Vector minimizer,
int i)
Construct a less-than constraint for the branching less-than subproblem.
|
Modifier and Type | Method and Description |
---|---|
LinearLessThanConstraints |
ILPProblemImpl1.getLessThanConstraints() |
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 |
---|---|
LinearLessThanConstraints |
QPWeightsLimit.linearLessThanConstraints() |
LinearLessThanConstraints |
QPNoConstraint.linearLessThanConstraints()
Deprecated.
|
LinearLessThanConstraints |
QPMinWeights.linearLessThanConstraints() |
LinearLessThanConstraints |
QPNoShortSelling.linearLessThanConstraints() |
LinearLessThanConstraints |
QPConstraint.linearLessThanConstraints() |
LinearLessThanConstraints |
QPUnity.linearLessThanConstraints() |
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.