Upper and lower bounds for the optimal values of the interval bilevel linear programming problem

0Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we will investigate the interval bilevel linear programming (IBLP) problem. Recently, Calvete et al. have proposed two algorithms to find the worst and the best (upper and lower bounds) optimal values of the leader objective function in the bilevel linear programming (BLP) problem when the coefficients of the leader and the follower objective functions are interval. Through some examples, we will first show that the algorithm to find the worst optimal value of the leader objective function does not always yield a correct solution. Then, after investigating its drawbacks, we will propose a revised algorithm with which the previous examples will yield correct solutions. Finally, it will be extended to the general BLP problem wherein all the coefficients are interval. It is, of course, possible to easily find the upper and the lower bounds for the lower level objective function too.

Cite

CITATION STYLE

APA

Mishmast Nehi, H., & Hamidi, F. (2015). Upper and lower bounds for the optimal values of the interval bilevel linear programming problem. Applied Mathematical Modelling, 39(5–6), 1650–1664. https://doi.org/10.1016/j.apm.2014.09.021

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free