Interface LPProblem
-
- All Superinterfaces:
ConstrainedOptimProblem,OptimProblem
- All Known Subinterfaces:
ILPProblem
- All Known Implementing Classes:
ILPProblemImpl1,LPCanonicalProblem1,LPCanonicalProblem2,LPProblemImpl1,LPRevisedSimplexSolver.Problem,LPStandardProblem,PureILPProblem
public interface LPProblem extends ConstrainedOptimProblem
A linear programming (LP) problem minimizes a linear objective function subject to a collection of linear constraints.
s.t.min c'x
some x ≥ 0, some x are free.A * x ≥ b Aeq * x = beq
-
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description ImmutableMatrixA()Get the coefficients, A, of the greater-than-or-equal-to constraints A * x ≥ b.ImmutableMatrixAeq()Get the coefficients, Aeq, of the equality constraints Aeq * x ≥ beq.ImmutableVectorb()Get the values, b, of the greater-than-or-equal-to constraints A * x ≥ b.ImmutableVectorbeq()Get the values, beq, of the equality constraints Aeq * x ≥ beq.ImmutableVectorc()Get the objective function.booleanisFree(int i)Check whether xi is a free variable after handling the box constraints.-
Methods inherited from interface dev.nm.solver.multivariate.constrained.problem.ConstrainedOptimProblem
getEqualityConstraints, getLessThanConstraints
-
Methods inherited from interface dev.nm.solver.problem.OptimProblem
dimension, f
-
-
-
-
Method Detail
-
c
ImmutableVector c()
Get the objective function.- Returns:
- the objective function
-
A
ImmutableMatrix A()
Get the coefficients, A, of the greater-than-or-equal-to constraints A * x ≥ b.- Returns:
- the coefficients of the greater-than-or-equal-to constraints
-
b
ImmutableVector b()
Get the values, b, of the greater-than-or-equal-to constraints A * x ≥ b.- Returns:
- the values of the greater-than-or-equal-to constraints
-
Aeq
ImmutableMatrix Aeq()
Get the coefficients, Aeq, of the equality constraints Aeq * x ≥ beq.- Returns:
- the coefficients of the equality constraints
-
beq
ImmutableVector beq()
Get the values, beq, of the equality constraints Aeq * x ≥ beq.- Returns:
- the values of the equality constraints
-
isFree
boolean isFree(int i)
Check whether xi is a free variable after handling the box constraints.- Parameters:
i- the index of a variable, counting from 1- Returns:
trueif xi is free
-
-