Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2012, Article ID 471952, 14 pages
http://dx.doi.org/10.1155/2012/471952
Research Article

An Evolutionary Algorithm for Solving Bilevel Programming Problems Using Duality Conditions

1Department of Mathematics, Key Laboratory of Tibetan Information Processing of Ministry of Education, Qinghai Normal University, Xining 810008, China
2Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China
3Business School, Nankai University, Tianjin 300071, China

Received 31 March 2012; Accepted 12 September 2012

Academic Editor: Yuping Wang

Copyright © 2012 Hecheng Li and Lei Fang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. F. Bard, Practical Bilevel Optimization, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998. View at Zentralblatt MATH
  2. B. Colson, P. Marcotte, and G. Savard, “Bilevel programming: a survey,” Journal of Operations Research, vol. 3, no. 2, pp. 87–107, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  3. M. Zhao and Z. Gao, “A globally convergent algorithm for solving the bilevel linear programming problem,” OR Transacton, vol. 9, no. 2, pp. 57–62, 2005. View at Google Scholar
  4. L. D. Muu and N. V. Quy, “A global optimization method for solving convex quadratic bilevel programming problems,” Journal of Global Optimization, vol. 26, no. 2, pp. 199–219, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  5. J. B. E. Etoa, “Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm,” Journal of Global Optimization, vol. 47, no. 4, pp. 615–637, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. B. Colson, P. Marcotte, and G. Savard, “A trust-region method for nonlinear bilevel programming: algorithm and computational experience,” Computational Optimization and Applications, vol. 30, no. 3, pp. 211–227, 2005. View at Publisher · View at Google Scholar
  7. K.-M. Lan, U.-P. Wen, H.-S. Shih, and E. S. Lee, “A hybrid neural network approach to bilevel programming problems,” Applied Mathematics Letters, vol. 20, no. 8, pp. 880–884, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  8. Y. Wang, Y. C. Jiao, and H. Li, “An evolutionary algorithm for solving nonlinear bilevel programming based on a new constraint-handling scheme,” IEEE Transactions on Systems, Man and Cybernetics Part C, vol. 35, no. 2, pp. 221–232, 2005. View at Publisher · View at Google Scholar · View at Scopus
  9. B. Liu, “Stackelberg-Nash equilibrium for multilevel programming with multiple followers using genetic algorithms,” Computers & Mathematics with Applications, vol. 36, no. 7, pp. 79–89, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  10. S. K. Suneja and B. Kohli, “Optimality and duality results for bilevel programming problem using convexifactors,” Journal of Optimization Theory and Applications, vol. 150, no. 1, pp. 1–19, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  11. J. Glackin, J. G. Ecker, and M. Kupferschmid, “Solving bilevel linear programs using multiple objective linear programming,” Journal of Optimization Theory and Applications, vol. 140, no. 2, pp. 197–212, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  12. Z. Wan, G. Wang, and Y. Lv, “A dual-relax penalty function approach for solving nonlinear bilevel programming with linear lower level problem,” Acta Mathematica Scientia. Series B, vol. 31, no. 2, pp. 652–660, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  13. H. I. Calvete, C. Galé, S. Dempe, and S. Lohse, “Bilevel problems over polyhedra with extreme point optimal solutions,” Journal of Global Optimization, vol. 53, no. 3, pp. 573–586, 2012. View at Publisher · View at Google Scholar
  14. U. P. Wen and S. T. Hsu, “Linear bi-level programming problems. A review,” Journal of the Operational Research Society, vol. 42, no. 2, pp. 125–133, 1991. View at Google Scholar · View at Scopus
  15. A. G. Mersha and S. Dempe, “Linear bilevel programming with upper level constraints depending on the lower level solution,” Applied Mathematics and Computation, vol. 180, no. 1, pp. 247–254, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  16. C. Shi, J. Lu, G. Zhang, and H. Zhou, “An extended branch and bound algorithm for linear bilevel programming,” Applied Mathematics and Computation, vol. 180, no. 2, pp. 529–537, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  17. R. J. Kuo and C. C. Huang, “Application of particle swarm optimization algorithm for solving bi-level linear programming problem,” Computers & Mathematics with Applications, vol. 58, no. 4, pp. 678–685, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  18. Y. Wang, H. Li, and C. Dang, “A new evolutionary algorithm for a class of nonlinear bilevel programming problems and its global convergence,” INFORMS Journal on Computing, vol. 23, no. 4, pp. 618–629, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  19. K. Deb and S. Sinha, “An efficient and accurate solution methodology for bilevel multi-objective programming problems using a hybrid evolutionary-local-search algorithm,” Journal Evolutionary Computation, vol. 18, no. 3, pp. 403–449, 2010. View at Google Scholar
  20. H. I. Calvete, C. Galé, and P. M. Mateo, “A new approach for solving linear bilevel problems using genetic algorithms,” European Journal of Operational Research, vol. 188, no. 1, pp. 14–28, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  21. T. Hu, B. Huang, and X. Zhang, “A neural network approach for solving linear bilevel programming problem,” in Proceedings of the 6th ISNN Conference, vol. 56, pp. 649–658, AISC, 2009.