| Name | Description | Type | Package | Framework |
| LPCanonicalProblem1 | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.problem | SuanShu | |
| LPCanonicalProblem2 | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.problem | SuanShu | |
| LPProblem | A linear programming (LP) problem minimizes a linear objective function subject to a collection of linear constraints. | Interface | com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.problem | SuanShu |
| LPProblemImpl1 | This is an implementation of a linear programming problem, LPProblem. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.problem | SuanShu |
| LPStandardProblem | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.problem | SuanShu | |