ISSN:
1573-2916
Keywords:
Bilevel programming problem
;
nonconvex programming
;
test problems
;
global optimization
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract A method of constructing test problems for linear bilevel programming problems is presented. The method selects a vertex of the feasible region, ‘far away’ from the solution of the relaxed linear programming problem, as the global solution of the bilevel problem. A predetermined number of constraints are systematically selected to be assigned to the lower problem. The proposed method requires only local vertex search and solutions to linear programs.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00121267
Permalink