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

Table 2

Worst optimal solutions provided by EA-DBES.

Number
Example 1				(0, 2, 0)
Example 2				(0, 1, 2)
Example 3				(0, 3, 0)	≥0
Example 4				(0, 1.8, 3)	≥0.5
Example 5				(0, 0.45, 0, 0.3, 0.2)	≥−29.2
Example 6				(1, 0, 1.3)	≥−1000
Example 7				(0.5, 1)	≥−12