Uses of Class
dev.nm.solver.multivariate.constrained.constraint.linear.LinearGreaterThanConstraints
-
-
Uses of LinearGreaterThanConstraints in dev.nm.solver.multivariate.constrained.constraint.linear
Subclasses of LinearGreaterThanConstraints in dev.nm.solver.multivariate.constrained.constraint.linear Modifier and Type Class Description class
LowerBoundConstraints
This is a lower bound constraints such that for all xi's, xi ≥ bclass
NonNegativityConstraints
These constraints ensures that for all variables are non-negative.Methods in dev.nm.solver.multivariate.constrained.constraint.linear that return LinearGreaterThanConstraints Modifier and Type Method Description LinearGreaterThanConstraints
BoxConstraints. lowerBoundConstraints()
Split the box constraints and get the greater-than-the-lower-bounds part.LinearGreaterThanConstraints
BoxConstraints. toGreaterThanConstraints()
LinearGreaterThanConstraints
LinearLessThanConstraints. toGreaterThanConstraints()
-
Uses of LinearGreaterThanConstraints in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.problem
Methods in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.problem that return LinearGreaterThanConstraints Modifier and Type Method Description LinearGreaterThanConstraints
LPCanonicalProblem1. getGreaterThanConstraints()
Get the greater-than-or-equal-to constraints of the linear programming problem.Constructors in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.problem with parameters of type LinearGreaterThanConstraints Constructor 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. -
Uses of LinearGreaterThanConstraints in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.problem
Methods in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.problem that return LinearGreaterThanConstraints Modifier and Type Method Description LinearGreaterThanConstraints
QPProblem. getGreaterThanConstraints()
Get the set of linear greater-than-or-equal-to constraints.Constructors in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.problem with parameters of type LinearGreaterThanConstraints Constructor 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. -
Uses of LinearGreaterThanConstraints in dev.nm.solver.multivariate.constrained.integer.linear.bb
Methods in dev.nm.solver.multivariate.constrained.integer.linear.bb that return LinearGreaterThanConstraints Modifier and Type Method Description static LinearGreaterThanConstraints
ILPNode. getGreaterThanConstraint(Vector minimizer, int i)
Construct a greater-than constraint for the branching greater-than subproblem. -
Uses of LinearGreaterThanConstraints in dev.nm.solver.multivariate.constrained.integer.linear.problem
Constructors in dev.nm.solver.multivariate.constrained.integer.linear.problem with parameters of type LinearGreaterThanConstraints Constructor 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. -
Uses of LinearGreaterThanConstraints in tech.nmfin.portfoliooptimization.markowitz.constraints
Methods in tech.nmfin.portfoliooptimization.markowitz.constraints that return LinearGreaterThanConstraints Modifier and Type Method Description LinearGreaterThanConstraints
QPConstraint. linearGreaterThanConstraints()
LinearGreaterThanConstraints
QPMinWeights. linearGreaterThanConstraints()
LinearGreaterThanConstraints
QPNoConstraint. linearGreaterThanConstraints()
Deprecated.LinearGreaterThanConstraints
QPNoShortSelling. linearGreaterThanConstraints()
LinearGreaterThanConstraints
QPUnity. linearGreaterThanConstraints()
LinearGreaterThanConstraints
QPWeightsLimit. linearGreaterThanConstraints()
-