Abstract: A modified Kth-best approach was presented for linear bilevel programming with no upperlevel constraint. We proved that this modified Kthbest approach obtained via the theoretical proof and example can solve effectively linear bilevel programming with no upperlevel constraint without the assumption of original Kth-best approach.

Key words: linear bilevel programming, Kth-best approach, global optimization solution, no upper-level constraint