Uses of Package
dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp

Packages that use dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp

Package	Description
dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp
dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution
dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver

Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp used by dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp

Class and Description
LPMinimizer An LP minimizer minimizes the objective of an LP problem, satisfying all the constraints.
LPSolution A solution to an LP problem contains all information about solving an LP problem such as whether the problem has a solution (bounded), how many minimizers it has, and the minimum.

Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp used by dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution

Class and Description
LPMinimizer An LP minimizer minimizes the objective of an LP problem, satisfying all the constraints.
LPSolution A solution to an LP problem contains all information about solving an LP problem such as whether the problem has a solution (bounded), how many minimizers it has, and the minimum.

Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp used by dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver

Class and Description
LPMinimizer An LP minimizer minimizes the objective of an LP problem, satisfying all the constraints.
LPSolution A solution to an LP problem contains all information about solving an LP problem such as whether the problem has a solution (bounded), how many minimizers it has, and the minimum.
LPSolver An LP solver solves a Linear Programming (LP) problem.