<s>
Fourier	B-Algorithm
–	I-Algorithm
Motzkin	I-Algorithm
elimination	I-Algorithm
,	O
also	O
known	O
as	O
the	O
FME	O
method	O
,	O
is	O
a	O
mathematical	O
algorithm	O
for	O
eliminating	O
variables	O
from	O
a	O
system	O
of	O
linear	O
inequalities	O
.	O
</s>
<s>
Unnecessary	O
constraints	O
may	O
be	O
detected	O
using	O
linear	B-Algorithm
programming	I-Algorithm
.	O
</s>
<s>
Two	O
"	O
acceleration	O
"	O
theorems	O
due	O
to	O
Imbert	O
permit	O
the	O
elimination	O
of	O
redundant	O
inequalities	O
based	O
solely	O
on	O
syntactic	O
properties	O
of	O
the	O
formula	O
derivation	O
tree	O
,	O
thus	O
curtailing	O
the	O
need	O
to	O
solve	O
linear	B-Algorithm
programs	I-Algorithm
or	O
compute	O
matrix	O
ranks	O
.	O
</s>
<s>
This	O
gives	O
rise	O
to	O
the	O
need	O
of	O
eliminating	O
the	O
aforementioned	O
auxiliary	O
rates	O
,	O
which	O
is	O
executed	O
via	O
Fourier	B-Algorithm
–	I-Algorithm
Motzkin	I-Algorithm
elimination	I-Algorithm
.	O
</s>
<s>
Redundant	O
constraint	O
can	O
be	O
identified	O
by	O
solving	O
a	O
linear	B-Algorithm
program	I-Algorithm
as	O
follows	O
.	O
</s>
<s>
Consequently	O
,	O
any	O
STI	O
can	O
be	O
proven	O
via	O
linear	B-Algorithm
programming	I-Algorithm
by	O
checking	O
if	O
it	O
is	O
implied	O
by	O
the	O
basic	O
identities	O
and	O
non-negativity	O
constraints	O
.	O
</s>
<s>
The	O
described	O
algorithm	O
first	O
performs	O
Fourier	B-Algorithm
–	I-Algorithm
Motzkin	I-Algorithm
elimination	I-Algorithm
to	O
remove	O
the	O
auxiliary	O
rates	O
.	O
</s>
