Uses of Package
com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver

Packages that use com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver

Package	Description
com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver
com.numericalmethod.suanshu.optimization.multivariate.constrained.integer.linear.cuttingplane

Classes in com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver used by com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver

Class and Description
FerrisMangasarianWrightPhase2 This implementation solves a canonical linear programming problem that does not need preprocessing its simplex table.
LPSimplexSolver A simplex solver works toward an LP solution by sequentially applying Jordan exchange to a simplex table.

Classes in com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver used by com.numericalmethod.suanshu.optimization.multivariate.constrained.integer.linear.cuttingplane

Class and Description
LPSimplexSolver A simplex solver works toward an LP solution by sequentially applying Jordan exchange to a simplex table.