Uses of Interface
dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.problem.LPProblem
-
-
Uses of LPProblem in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp with type parameters of type LPProblem Modifier and Type Interface Description interface
LPSolver<P extends LPProblem,S extends LPSolution<?>>
An LP solver solves a Linear Programming (LP) problem. -
Uses of LPProblem in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.problem
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.problem that implement LPProblem Modifier and Type Class 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. -
Uses of LPProblem in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex
Constructors in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex with parameters of type LPProblem Constructor 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. -
Uses of LPProblem 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 with type parameters of type LPProblem Modifier and Type Interface Description interface
LPSimplexSolver<P extends LPProblem>
A simplex solver works toward an LP solution by sequentially applying Jordan exchange to a simplex table.Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver that implement LPProblem Modifier and Type Class Description static class
LPRevisedSimplexSolver.Problem
Methods in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver with parameters of type LPProblem Modifier and Type Method Description LPSolution<LPMinimizer>
LPRevisedSimplexSolver. solve(LPProblem p)
LPSimplexSolution
LPTwoPhaseSolver. solve(LPProblem problem)
-
Uses of LPProblem in dev.nm.solver.multivariate.constrained.integer.linear.problem
Subinterfaces of LPProblem in dev.nm.solver.multivariate.constrained.integer.linear.problem Modifier and Type Interface 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.Classes in dev.nm.solver.multivariate.constrained.integer.linear.problem that implement LPProblem Modifier and Type Class 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.
-