A note on a linear bilevel programming algorithm based on bicriteria programming

From MaRDI portal





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 \textit{G. Ünlü} [Comput. Oper. Res. 14, 173-179 (1987; Zbl 0626.90086)] and \textit{J. F. Bard} [Oper. Res. 31, 670-684 (1983; Zbl 0525.90086)]. We also propose a sufficient condition to use the bicriteria programming algorithm for solving a bilevel programming problem.




Cited in
(24)








This page was built for publication: A note on a linear bilevel programming algorithm based on bicriteria programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1112732)