An algorithm is proposed in this paper for solving two-dimensional bi-level linear programming problems without making a graph. Based on the classification of constraints, algorithm removes all redundant constraints, which eliminate the possibility of cycling and the solution of the problem is reached in a finite number of steps. Example to illustrate the method is also included in the paper.
References
[1]
Bracken, J. and McGill, J. (1973) Mathematical Programs with Optimization Problems in the Constraints. Operation Research, 21, 37-44.
https://doi.org/10.1287/opre.21.1.37
[2]
Candler, W. and Norton, R. (1977) Multilevel Programming and Development Policy. Technical Report 258, Word Bank Staff, Washington DC.
[3]
Wen, U. and Hsu, S. (1992) Efficient Solution for the Linear Bilevel Programming Problems. European Journal of Operation Research, 62, 354-362.
[4]
Jan, R. and Chern, M. (1994) Nonlinear Integer Bilevel Programming. European Journal of Operation Research, 72, 574-587.
[5]
Liu, Y. and hart, S. (1994) Characterizing an Optimal Solution to the Linear Bilevel Programming Problem. European Journal of Operation Research, 73, 164-166.
[6]
Liu, Y. and Spencert, T. (1995) Solving a Bilevel Linear Program When the Inner Decision Maker Controls Few Variables. European Journal of Operation Research, 81, 644-651.
[7]
Stackelberg, H. (1952) The Theory of Market Economy. Oxford University Press, Oxford.
[8]
Bialas, W.F. and Karwan, M.H. (1982) On Tow-Level Linear Optimization. IEEE Transactions on Automatic Control, AC-27, 211-214.
[9]
Bard, J.F. and Falk, J.E. (1982) An Explicit Solution to the Multi-Level Programming Problem. Computers and Operations Research, 9, 77-100.
[10]
Bialas, W.F. and Karwan, M.H. (1984) Two-Level Linear Programming. Management Science, 30, 1004-1020. https://doi.org/10.1287/mnsc.30.8.1004
[11]
Bard, J. (1985) Geometric and Algorithm Development for Hierarchical Planning Problem. European Journal of Operation Research, 19, 372-383.
[12]
Mishra, V.N. (2007) Some Problems on Approximations of Functions in Banach Spaces. PhD Thesis, Indian Institute of Technology, Roorkee, 247-667.
[13]
Hansen, P., Jaumard, B. and Sarvard, G. (1992) New Branch-and-Bound Rules for Linear Bilevel Programming. SIAM Journal of Scientific and Statistical Computing, 13, 1194-1217. https://doi.org/10.1137/0913069
[14]
Judice, J. and Faustino, A. (1994) The Linear Quadratic Bi-Level Programming Problem. INFOR, 32, 87-98. https://doi.org/10.1080/03155986.1994.11732240
[15]
Ben-Ayed, O. (1993) Bilevel Linear Programming. Computers and Operation Research, 20, 485-501.
[16]
Haurie, A., Savard, G. and White, J.C. (1990) A Note on an Efficient Point Algorithm for a Linear Two-Stage Optimization Problem. Operation Research, 38, 553-555. https://doi.org/10.1287/opre.38.3.553
[17]
Onal, H. (1993) A Modified Simplex Approach for Solving Bilevel Linear Programming Problems. European Journal of Operation Research, 67, 126-135.
[18]
Husain, S., Gupta, S. and Mishra, V.N. (2013) An Existence Theorem of Solutions for the System of Generalized Vector Quasi-Variational Inequalities. American Journal of Operations Research, 3, 329-336. https://doi.org/10.4236/ajor.2013.33029
[19]
Gupta, S., Dalal, U.D. and Mishra, V.N. (2014) Novel Analytical Approach of Non Conventional Mapping Scheme with Discrete Hartley Transform in OFDM System. American Journal of Operations Research, 4, 281-292.
https://doi.org/10.4236/ajor.2014.45027
[20]
Ahmad, I., Mishra, V.N., Ahmad, R. and Rahaman, M. (2016) An Iterative Algorithm for a System of Generalized Implicit Variational Inclusions. Springer Plus, 5, 1283. https://doi.org/10.1186/s40064-016-2916-8
