Package | Description |
---|---|
dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex | |
dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver |
Modifier and Type | Method and Description |
---|---|
SimplexTable |
FerrisMangasarianWrightPhase1.process()
Find a feasible table, if any.
|
SimplexTable |
FerrisMangasarianWrightScheme2.process()
Remove equalities and free variables, if possible.
|
Modifier and Type | Method and Description |
---|---|
Vector |
LPRevisedSimplexSolver.findFeasiblePoint(Matrix A,
Vector b) |
dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver.LPRevisedSimplexSolver.WorkingSet |
LPRevisedSimplexSolver.findVertex(Matrix A,
Vector b,
Vector x0) |
LPSimplexSolution |
LPTwoPhaseSolver.solve(LPProblem problem) |
LPSimplexSolution |
LPTwoPhaseSolver.solve(SimplexTable table) |
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.