Modifier and Type | Interface and Description |
---|---|
interface |
LPSolver<P extends LPProblem,S extends LPSolution<?>>
An LP solver solves a Linear Programming (LP) problem.
|
Modifier and Type | Class and Description |
---|---|
class |
LPCanonicalProblem1
This is a linear programming problem in the 1st canonical form (following the convention in the reference):
min c'x
s.t.
|
class |
LPCanonicalProblem2
This is a linear programming problem in the 2nd canonical form (following the convention in the wiki):
min c'x
s.t.
|
class |
LPProblemImpl1
This is an implementation of a linear programming problem,
LPProblem . |
class |
LPStandardProblem
This is a linear programming problem in the standard form:
min c'x
s.t.
|
Constructor and Description |
---|
SimplexTable(LPProblem problem)
Construct a simplex table from a general linear programming problem.
|
SimplexTable(LPProblem problem,
double epsilon)
Construct a simplex table from a general linear programming problem.
|
Modifier and Type | Interface and Description |
---|---|
interface |
LPSimplexSolver<P extends LPProblem>
A simplex solver works toward an LP solution by sequentially applying Jordan exchange to a simplex table.
|
Modifier and Type | Class and Description |
---|---|
static class |
LPRevisedSimplexSolver.Problem |
Modifier and Type | Method and Description |
---|---|
LPSolution<LPMinimizer> |
LPRevisedSimplexSolver.solve(LPProblem p) |
LPSimplexSolution |
LPTwoPhaseSolver.solve(LPProblem problem) |
Modifier and Type | Interface and Description |
---|---|
interface |
ILPProblem
A linear program in real variables is said to be integral if it has at least one optimal solution which is integral.
|
Modifier and Type | Class and Description |
---|---|
class |
ILPProblemImpl1
This implementation is an ILP problem, in which the variables can be real or integral.
|
class |
PureILPProblem
This is a pure integer linear programming problem, in which all variables are integral.
|
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.