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 interfaceLPSolver<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 classLPCanonicalProblem1This is a linear programming problem in the 1st canonical form (following the convention in the reference): min c'x s.t.classLPCanonicalProblem2This is a linear programming problem in the 2nd canonical form (following the convention in the wiki): min c'x s.t.classLPProblemImpl1This is an implementation of a linear programming problem,LPProblem.classLPStandardProblemThis 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 interfaceLPSimplexSolver<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 classLPRevisedSimplexSolver.ProblemMethods 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)LPSimplexSolutionLPTwoPhaseSolver. 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 interfaceILPProblemA 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 classILPProblemImpl1This implementation is an ILP problem, in which the variables can be real or integral.classPureILPProblemThis is a pure integer linear programming problem, in which all variables are integral.
-