X hits on this document





7 / 8


The Conclusion

The paper proposes the GA of the BLPP of which the optimal solution of the lower-level problem is dependent on the upper-level problem. The numerical results show the method is feasible and efficient. Compared with the traditional methods, the method has the following characters:

  • 1.

    The method has no special requirement for the characters of the function and overcome the difficulty discussing the conditions and the algorithms of the optimal solution with the definition of the differentiability of the function.

  • 2.

    This GA avoids the use of penalty function to deal with the constraints, by changing the randomly generated initial population into an initial population satisfying the constraints in order to improve the ability of the GA to deal with the constraints.


[1] W.F.Bialas and M.H.Karwan, Two-level linear programming. Management Science. 30, 1004- 1020 (1984)

[2] J.F.Bard, Some properties of the bilevel linear programming. Journal of Optimization Theory and Applications. 68, 371-378 (1991)

[3] O. Ben-Ayed and C.E.Blair, Computational difficulties of bilevel linear programming. Opera- tions Research. 38, 556-560 (1990)

[4] P. Hansen, B.Jaumard and G. Savard, New branch-and-bound rules for linear bilevel program- ming. SIAM Journal on Science and Statistical Computing. 13(5), 1194-1217 (1992)

[5] L. Vicente, G. Savard and J. Judice. Descent approaches for quadratic bilevel programming. Journal of Optimization Theory and Applications. 81(2), 379 399 (1994)

[6] J.F.Bard. Practical Practical Bilevel Optimization Algorithms and Applications, Kluwer Aca- demic Publishers. (1998)

[7] W.F.Bialas and M.H.Karwa. On two-level optimization. IEEE Transactions Automatic Con- rrol. 27(1), 211-214 (1982)

[8] Wen,U.P. and W.F.Bialas. The hybrid algorithm for solving the three-level linear programming problem.Computers and Operations Research. 13(4), 367-377 (1986)

[9] J.F.Bard. A grid search algorithm for the linear bilevel programming problem.in 14th Annual Meeting of the American Institute for Decision Science,San Francisco,CA. 2, 256-258 (1982)

[10] J.F.Bard. An efficient point algorithm for a linear two-stage optimization problem. Operations Research. 31,670-684 (1983)

[11] J.J.Judice and A.M.Faustino. n expetimental investigation of enumerative methods for the linear complementarity problem.Computers and Operations Research. 15(5), 417-426 (1988)

[12] J.J.Judice and A.M.Faustino. A sequential lcp method for bilevel linear programming.Annals of Operations Researc. 34, 89-106 (1992)

[13] W.Candler and R.Townsley. A linear two-level programming problem. Computers and Oper- ations Reseatch. 9, 59-76 (1982)

[14] H.Onal. A modi ed simplex approach for solving bilevel programming problems.European Journal of Operational Research. 67(1), 126-135 (1993)


Document info
Document views42
Page views42
Page last viewedFri Dec 16 10:35:59 UTC 2016