<s>
Strong	B-Algorithm
duality	I-Algorithm
is	O
a	O
condition	O
in	O
mathematical	O
optimization	O
in	O
which	O
the	O
primal	O
optimal	O
objective	O
and	O
the	O
dual	B-Algorithm
optimal	O
objective	O
are	O
equal	O
.	O
</s>
<s>
This	O
is	O
as	O
opposed	O
to	O
weak	B-Algorithm
duality	I-Algorithm
(	O
the	O
primal	B-Algorithm
problem	I-Algorithm
has	O
optimal	O
value	O
smaller	O
than	O
or	O
equal	O
to	O
the	O
dual	B-Algorithm
problem	O
,	O
in	O
other	O
words	O
the	O
duality	B-Algorithm
gap	I-Algorithm
is	O
greater	O
than	O
or	O
equal	O
to	O
zero	O
)	O
.	O
</s>
<s>
Strong	B-Algorithm
duality	I-Algorithm
holds	O
if	O
and	O
only	O
if	O
the	O
duality	B-Algorithm
gap	I-Algorithm
is	O
equal	O
to	O
0	O
.	O
</s>
