Optimization Online


A Bilevel Direct Search Method for Leader-Follower Optimization Problems and Applications

Dali Zhang (dali.zhang.ustc***at***gmail.com)
Gui-Hua Lin (lin_g_h***at***yahoo.com.cn)

Abstract: In the paper, we propose a bilevel direct search method for solving a type of leader-follower problems with each decision maker's objective being a "black-box" function. First, we give a description for a leader-follower optimization problem. Then, we investigate a bilevel direct search method including two algorithms for combinatorially solving the upper and lower level problems, and explore the convergence properties of this bilevel method. Finally, we apply our method to a health insurance problem and carry out several numerical examples to illustrate how the method performs when solving leader-follower problems. In the numerical experiments, we broaden the implementation of the bilevel method in which the direct search algorithm for the lower level problem is replaced by a trust region algorithm.

Keywords: Leader-follower Stackelberg competition, direct search method, stationary points, convergence analysis, health insurance

Category 1: Other Topics (Game Theory )

Category 2: Stochastic Programming

Category 3: Other Topics (Other )


Download: [PDF]

Entry Submitted: 06/04/2011
Entry Accepted: 06/04/2011
Entry Last Modified: 02/12/2012

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 Optimization Society