<s>
Benson	B-Application
's	I-Application
algorithm	I-Application
,	O
named	O
after	O
Harold	O
Benson	O
,	O
is	O
a	O
method	O
for	O
solving	O
multi-objective	B-Algorithm
linear	I-Algorithm
programming	I-Algorithm
problems	O
and	O
vector	O
linear	O
programs	O
.	O
</s>
<s>
The	O
primary	O
concept	O
in	O
Benson	B-Application
's	I-Application
algorithm	I-Application
is	O
to	O
evaluate	O
the	O
upper	O
image	O
of	O
the	O
vector	O
optimization	O
problem	O
by	O
cutting	B-Algorithm
planes	I-Algorithm
.	O
</s>
<s>
In	O
particular	O
,	O
Benson	B-Application
's	I-Application
algorithm	I-Application
finds	O
the	O
extreme	O
points	O
of	O
the	O
set	O
,	O
which	O
is	O
called	O
upper	O
image	O
.	O
</s>
<s>
There	O
is	O
a	O
dual	O
variant	O
of	O
Benson	B-Application
's	I-Application
algorithm	I-Application
,	O
which	O
is	O
based	O
on	O
geometric	O
duality	O
for	O
multi-objective	O
linear	O
programs	O
.	O
</s>
