Learn R Programming

lintools (version 0.1.7)

Manipulation of Linear Systems of (in)Equalities

Description

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 unimodular, compute variable ranges implied by linear (in)equalities.

Copy Link

Version

Install

install.packages('lintools')

Monthly Downloads

386

Version

0.1.7

License

GPL-3

Issues

Pull Requests

Stars

Forks

Maintainer

Last Published

January 16th, 2023

Functions in lintools (0.1.7)

pinv

Moore-Penrose pseudoinverse
subst_value

Substitute a value in a system of linear (in)equations
project

Project a vector on the border of the region defined by a set of linear (in)equality restrictions.
sparse_project

Successive projections with sparsely defined restrictions
reduceMatrix

Apply reduction method from Scholtus (2008)
sparse_constraints

Generate sparse set of constraints.
ranges

Derive variable ranges from linear restrictions
raghavachari

Determine if a matrix is unimodular using recursive Raghavachari criterium
eliminate

Eliminate a variable from a set of edit rules
compact

Remove spurious variables and restrictions
allTotallyUnimodular

Test if a list of matrices are all unimodular
lintools

Tools for manipulating linear systems of (in)equations
block_index

Find independent blocks of equations.
is_totally_unimodular

Test for total unimodularity of a matrix.
echelon

Reduced row echelon form
is_feasible

Check feasibility of a system of linear (in)equations
normalize

Bring a system of (in)equalities in a standard form
hellerTompkins

Determine if a matrix is totally unimodular using Heller and Tompkins criterium.