Uses of Interface
dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver.LPSimplexSolver
-
Packages that use LPSimplexSolver Package Description dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver dev.nm.solver.multivariate.constrained.integer.linear.cuttingplane -
-
Uses of LPSimplexSolver in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver that implement LPSimplexSolver Modifier and Type Class Description class
FerrisMangasarianWrightPhase2
This implementation solves a canonical linear programming problem that does not need preprocessing its simplex table.class
LPCanonicalSolver
This is an LP solver that solves a canonical LP problem in the following form.class
LPTwoPhaseSolver
This implementation solves a linear programming problem,LPProblem
, using a two-step approach.Constructors in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver with parameters of type LPSimplexSolver Constructor Description LPTwoPhaseSolver(LPSimplexSolver<LPCanonicalProblem1> solver)
Construct an LP solver to solve LP problems. -
Uses of LPSimplexSolver in dev.nm.solver.multivariate.constrained.integer.linear.cuttingplane
Constructors in dev.nm.solver.multivariate.constrained.integer.linear.cuttingplane with parameters of type LPSimplexSolver Constructor Description SimplexCuttingPlaneMinimizer(LPSimplexSolver solver, SimplexCuttingPlaneMinimizer.CutterFactory cutterFactory)
Construct a cutting-plane minimizer to solve an MILP problem.
-