On computational search for optimistic solutions in bilevel problems

  • Authors:
  • Alexander S. Strekalovsky;Andrey V. Orlov;Anton V. Malyshev

  • Affiliations:
  • ISDCT SB RAS, Irkutsk, Russia;ISDCT SB RAS, Irkutsk, Russia;ISDCT SB RAS, Irkutsk, Russia

  • Venue:
  • Journal of Global Optimization
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The linear-linear and quadratic-linear bilevel programming problems are considered. Their optimistic statement is reduced to a nonconvex mathematical programming problem with the bilinear structure. Approximate algorithms of local and global search in the obtained problems are proposed. The results of computational solving randomly generated test problems are given and analyzed.