Optimization Online


Genetic Algorithm for Solving Convex Quadratic Bilevel Programming Problem

Guang-Min Wang (wgm97***at***163.com)
Zhong-Ping Wan (zpwan***at***public.wh.hb.cn)
Xian-Jia Wang (xjwang***at***s1000e.wuhee.edu.cn)
Zhong-Hua An (zhan***at***public.wh.hb.cn)

Abstract: This paper presents a genetic algorithm method for solving convex quadratic bilevel programming problem. Bilevel programming problems arise when one optimization problem, the upper problem, is constrained by another optimization, the lower problem. In this paper, the bilevel convex quadratic problem is transformed into a single level problem by applying Kuhn-Tucker conditions, and then an efficient method based on genetic algorithm has been proposed for solving the transformed problem. By some rule, we simplify the transformed problem, so we can search the optimum solution in the feasible region, and reduce greatly the searching space. Numerical experiments on several literature problems show that the new algorithm is effective in practice.

Keywords: Quadratic bilevel programming problem, genetic algorithm, optimal solution.

Category 1: Nonlinear Optimization

Category 2: Nonlinear Optimization (Other )

Citation: Report 5

Download: [Postscript][Compressed Postscript][PDF]

Entry Submitted: 06/12/2003
Entry Accepted: 06/12/2003
Entry Last Modified: 12/17/2003

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society