Package dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex
package dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex
-
ClassDescriptionThe phase 1 procedure finds a feasible table from an infeasible one by pivoting the simplex table of a related problem.The scheme 2 procedure removes equalities and free variables.Jordan Exchange swaps the r-th entering variable (row) with the s-th leaving variable (column) in a matrix A.This is a simplex table used to solve a linear programming problem using a simplex method.