An Evolutionary Algorithm Using Duality-Base-Enumerating Scheme for Interval Linear Bilevel Programming Problems

Table 3

Values of and corresponding to the best and the worst results.

Number		Best	Worst
Example 1		(1.72, 1.39)	(−0.35, 2.59)
		(1, 4, 2)	(1, 4, 2)
Example 2		(3.13, −1.63)	(2.01, −2.10)
		(1, 4, 2)	(1, 4, 2)
Example 3		(0.58, 1.35)	(−0.32, 1)
		(1.05, 5.58, 2.10)	(0.63, 6.00, 2.68)
Example 4		(2, −1)	(2, −3)
		(0.5, 6, 1)	(0.5, 6, 3)
Example 5		(0.5, 1.5, 3)	(1.5, 0.5, 3)
		(1.5, 1.5, 1.5)	(0.5, 0.5, 0.5)
Example 6		(−1.5, −0.5)	(−0.99, −1.07)
		(1.5, 1.5)	(1.02, 1.35)
Example 7		(1.5)	(0.5)
		(−1.5, 0, 18, 2)	(−1.5, 0, 6, 2)