Variable elimination (Gaussian elimination, Fourier-Motzkin elimination), Moore-Penrose pseudoinverse, reduction to reduced row echelon form, value substitution, projecting a vector on the convex polytope described by a system of (in)equations, simplify systems by removing spurious columns and rows and collapse implied equalities, test if a matrix is totally unimodilar, compute variable ranges implied by linear (in)equalities.
|Author||Mark van der Loo [aut, cre], Edwin de Jonge [aut]|
|Date of publication||2016-03-04 22:30:48|
|Maintainer||Mark van der Loo <firstname.lastname@example.org>|
allTotallyUnimodular: Test if a list of matrices are all unimodular
block_index: Find independent blocks of equations.
compact: Remove spurious variables and restrictions
echelon: Reduced row echelon form
eliminate: Eliminate a variable from a set of edit rules
hellerTompkins: Determine if a matrix is totally unimodular using Heller and...
is_feasible: Check feasibility of a system of linear (in)equations
is_totally_unimodular: Test for total unimodularity of a matrix.
lintools: Tools for manipulating linear systems of (in)equations
normalize: Bring a system of (in)equalities in a standard form
pinv: Moore-Penrose pseudoinverse
project: Project a vector on the border of the region defined by a set...
raghavachari: Determine if a matrix is unimodular using recursive...
ranges: Derive variable ranges from linear restrictions
reduceMatrix: Apply reduction method from Scholtus (2008)
sparse_constraints: Generate sparse set of constraints.
sparse_project: Successive projections with sparsely defined restrictions
subst_value: Substitute a value in a system of linear (in)equations