Search Java Classes and Packages

Search Java Frameworks and Libraries

255581 classes and counting ...
Search Tips Index Status



#Com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex Classes and Interfaces - 19 results found.
NameDescriptionTypePackageFramework
FerrisMangasarianWrightPhase1The phase 1 procedure finds a feasible table from an infeasible one by pivoting the simplex table of a related problem.Classcom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplexSuanShu
FerrisMangasarianWrightPhase2This implementation solves a canonical linear programming problem that does not need preprocessing its simplex table.Classcom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solverSuanShu
FerrisMangasarianWrightScheme2The scheme 2 procedure removes equalities and free variables.Classcom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplexSuanShu
JordanExchangeJordan Exchange swaps the r-th entering variable (row) with the s-th leaving variable (column) in a matrix A.Classcom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplexSuanShu
LPBoundedMinimizerThis is the solution to a bounded linear programming problem.Classcom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solutionSuanShu
LPCanonicalSolverThis is an LP solver that solves a canonical LP problem in the following form.Classcom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solverSuanShu
LPSimplexMinimizerA simplex LP minimizer can be read off from the solution simplex table.Interfacecom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solutionSuanShu
LPSimplexSolutionThe solution to a linear programming problem using a simplex method contains an LPSimplexMinimizer.Interfacecom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solutionSuanShu
LPSimplexSolverA simplex solver works toward an LP solution by sequentially applying Jordan exchange to a simplex table.Interfacecom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solverSuanShu
LPTwoPhaseSolverThis implementation solves a linear programming problem, LPProblem, using a two-step approach.Classcom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solverSuanShu
LPUnboundedMinimizerThis is the solution to an unbounded linear programming problem.Classcom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solutionSuanShu
LPUnboundedMinimizerScheme2This is the solution to an unbounded linear programming problem found in scheme 2.Classcom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solutionSuanShu
NaiveRuleThis pivoting rule chooses the column with the most negative reduced cost.Classcom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.pivotingSuanShu
SimplexPivotingA simplex pivoting finds a row and column to exchange to reduce the cost function.Interfacecom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.pivotingSuanShu
SimplexPivoting .PivotClasscom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.pivotingSuanShu
SimplexTableThis is a simplex table used to solve a linear programming problem using a simplex method.Classcom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplexSuanShu
SimplexTable .LabelClasscom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplexSuanShu
SimplexTable .LabelTypethe artificial variable, x0, pp.Classcom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplexSuanShu
SmallestSubscriptRuleBland's smallest-subscript rule is for anti-cycling in choosing a pivot.Classcom.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.pivotingSuanShu