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

Table 1

Best optimal solutions provided by EA-DBES.

Number
Example 1				(0, 0, 0)
Example 2				(0, 0, 0.5)
Example 3				(0, 0, 0)	≤0
Example 4				(0, 0, 0.25)	≤0.5
Example 5				(0, 1.35, 0, 0.9, 0.6)	≤−29.2
Example 6				(0, 1.5, 0)	≤−1000
Example 7				(5.4, 7.1)	≤−12