Abstract
In this note the relationship between linear bilevel and bicriteria programming problems is clarified. This paper points out that the bicriteria programming algorithm is not suitable for all bilevel programming problems in searching for optimal solutions. A counterexample is given to demonstrate the shortcomings of the results by Ünlü [1, Comput. Opns Res. 14, 173-179 (1987)] and Bard [2, Opns Res. 31, 670-684 (1983)]. We also propose a sufficient condition to use the bicriteria programming algorithm for solving a bilevel programming problem. © 1989.