• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1533-1539
• /
• 2011

In this paper, a class of nonlinear bilevel programs, i.e. the lower level problem is linear programs, is considered. Aiming at this special structure, we append the duality gap of the lower level problem to the upper level objective with a penalty and obtain a penalized problem. Using the penalty method, we give an existence theorem of solution and propose an algorithm. Then, a numerical example is given to illustrate the algorithm.