<s>
In	O
mathematical	O
optimization	O
,	O
total	B-Algorithm
dual	I-Algorithm
integrality	I-Algorithm
is	O
a	O
sufficient	O
condition	O
for	O
the	O
integrality	O
of	O
a	O
polyhedron	O
.	O
</s>
<s>
Thus	O
,	O
the	O
optimization	B-Algorithm
of	I-Algorithm
a	I-Algorithm
linear	I-Algorithm
objective	I-Algorithm
over	I-Algorithm
the	I-Algorithm
integral	I-Algorithm
points	I-Algorithm
of	O
such	O
a	O
polyhedron	O
can	O
be	O
done	O
using	O
techniques	O
from	O
linear	B-Algorithm
programming	I-Algorithm
.	O
</s>
<s>
Thus	O
,	O
if	O
a	O
linear	B-Algorithm
program	I-Algorithm
as	O
above	O
is	O
solved	O
by	O
the	O
simplex	B-Algorithm
algorithm	I-Algorithm
,	O
the	O
optimal	O
solution	O
returned	O
will	O
be	O
integer	O
.	O
</s>
