Name | Description | Type | Package | Framework |
LPBoundedMinimizer | This is the solution to a bounded linear programming problem. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution | SuanShu |
LPSimplexMinimizer | A simplex LP minimizer can be read off from the solution simplex table. | Interface | com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution | SuanShu |
LPSimplexSolution | The solution to a linear programming problem using a simplex method contains an LPSimplexMinimizer. | Interface | com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution | SuanShu |
LPUnboundedMinimizer | This is the solution to an unbounded linear programming problem. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution | SuanShu |
LPUnboundedMinimizerScheme2 | This is the solution to an unbounded linear programming problem found in scheme 2. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution | SuanShu |