public class LPRevisedSimplexSolver extends Object implements LPSolver<LPRevisedSimplexSolver.Problem,LPSolution<LPMinimizer>>
Modifier and Type | Class and Description |
---|---|
static class |
LPRevisedSimplexSolver.Problem |
Constructor and Description |
---|
LPRevisedSimplexSolver(double epsilon) |
Modifier and Type | Method and Description |
---|---|
Vector |
findFeasiblePoint(Matrix A,
Vector b) |
dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver.LPRevisedSimplexSolver.WorkingSet |
findVertex(Matrix A,
Vector b,
Vector x0) |
LPSolution<LPMinimizer> |
solve(LPProblem p) |
LPSolution<LPMinimizer> |
solve(LPRevisedSimplexSolver.Problem p)
Solve an optimization problem, e.g.,
OptimProblem . |
public LPSolution<LPMinimizer> solve(LPProblem p) throws Exception
Exception
public LPSolution<LPMinimizer> solve(LPRevisedSimplexSolver.Problem p) throws Exception
Optimizer
OptimProblem
.solve
in interface Optimizer<LPRevisedSimplexSolver.Problem,LPSolution<LPMinimizer>>
p
- an optimization problemException
- when there is an error solving the problempublic Vector findFeasiblePoint(Matrix A, Vector b) throws LPUnbounded, LPInfeasible
LPUnbounded
LPInfeasible
public dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver.LPRevisedSimplexSolver.WorkingSet findVertex(Matrix A, Vector b, Vector x0) throws LPInfeasible, dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver.LPRevisedSimplexSolver.VertexNotFound
LPInfeasible
dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver.LPRevisedSimplexSolver.VertexNotFound
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.