<s>
Multi-objective	B-Algorithm
linear	I-Algorithm
programming	I-Algorithm
is	O
a	O
subarea	O
of	O
mathematical	O
optimization	O
.	O
</s>
<s>
A	O
multiple	O
objective	O
linear	B-Algorithm
program	I-Algorithm
(	O
MOLP	O
)	O
is	O
a	O
linear	B-Algorithm
program	I-Algorithm
with	O
more	O
than	O
one	O
objective	O
function	O
.	O
</s>
<s>
An	O
MOLP	O
is	O
a	O
special	O
case	O
of	O
a	O
vector	O
linear	B-Algorithm
program	I-Algorithm
.	O
</s>
<s>
Multi-objective	B-Algorithm
linear	I-Algorithm
programming	I-Algorithm
is	O
also	O
a	O
subarea	O
of	O
Multi-objective	O
optimization	O
.	O
</s>
<s>
Often	O
in	O
the	O
literature	O
,	O
the	O
aim	O
in	O
multiple	O
objective	O
linear	B-Algorithm
programming	I-Algorithm
is	O
to	O
compute	O
the	O
set	O
of	O
all	O
efficient	O
extremal	O
points	O
.....	O
</s>
<s>
It	O
is	O
not	O
compatible	O
with	O
an	O
optimal	O
solution	O
of	O
a	O
linear	B-Algorithm
program	I-Algorithm
but	O
rather	O
parallels	O
the	O
set	O
of	O
all	O
optimal	O
solutions	O
of	O
a	O
linear	B-Algorithm
program	I-Algorithm
(	O
which	O
is	O
more	O
difficult	O
to	O
determine	O
)	O
.	O
</s>
<s>
This	O
term	O
is	O
misleading	O
because	O
a	O
single	O
efficient	O
point	O
can	O
be	O
already	O
obtained	O
by	O
solving	O
one	O
linear	B-Algorithm
program	I-Algorithm
,	O
such	O
as	O
the	O
linear	B-Algorithm
program	I-Algorithm
with	O
the	O
same	O
feasible	O
set	O
and	O
the	O
objective	O
function	O
being	O
the	O
sum	O
of	O
the	O
objectives	O
of	O
MOLP	O
.	O
</s>
<s>
Multiobjective	O
variants	O
of	O
the	O
simplex	B-Algorithm
algorithm	I-Algorithm
are	O
used	O
to	O
compute	O
decision	O
set	O
based	O
solutions	O
and	O
objective	O
set	O
based	O
solutions	O
.	O
</s>
<s>
Objective	O
set	O
based	O
solutions	O
can	O
be	O
obtained	O
by	O
Benson	B-Application
's	I-Application
algorithm	I-Application
.	O
</s>
<s>
Multiobjective	O
linear	B-Algorithm
programming	I-Algorithm
is	O
equivalent	O
to	O
polyhedral	O
projection	O
.	O
</s>
