A Comparison of Benson’s Outer Approximation Algorithm with an Extended Version of Multiobjective Simplex Algorithm

Algorithm 2

Extended Multiobjective Simplex Algorithm.

(0)	Input:
(1)	Initialize:  ;
	Phase I: solve the LP min . If the optimal value of LP is not zero; STOP; . Otherwise, x^0 is a basic feasible solution of MOLP.
	Phase II : solve the LP min . If it is infeasible STOP, . Otherwise, is an optimal solution. Find optimal basis B and basic feasible solution of LP min ; .
(2)	whiledo
(3)	;
(4)	;
(5)	;
(6)
(7)	.
(8)	;
(9)
(10)
(11)	; then
(12)	;
(13)	;
(14)	;
(15)	endif
(16)	endfor
(17)	endfor
(18)	endfor
(19)	endwhile
(20)	Output:
	.