hellerTompkins

This function is <code>deducorrect</code> internal

internal

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.

Mark der Loo

lintools

Manipulation of Linear Systems of (in)Equalities

Mark van der Loo

Edwin de Jonge

hellerTompkins function

<dl><dt>A</dt>
<dd>An object of class matrix in \(\{-1,0,1\}^{m\times n}\). 
Each column must have exactly 2 nonzero elements. (This is tested by 
 <code>is_totally_unimodular</code>).</dd></dl>

Arguments

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

<dl>

<dt>A</dt>
<dd>An object of class matrix in \(\{-1,0,1\}^{m\times n}\). 
Each column must have exactly 2 nonzero elements. (This is tested by 
 <code>is_totally_unimodular</code>).</dd>

</dl>

Join us for
RADAR: AI Edition

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

Description

Usage

Value

Arguments

See Also

Join us for RADAR: AI Edition

Description

Usage

Value

Arguments

See Also

Join us for
RADAR: AI Edition