Please use this identifier to cite or link to this item: http://hdl.handle.net/10316/10700
Title: Generating quadratic bilevel programming test problems
Authors: Calamai, Paul H. 
Vicente, Luís N. 
Keywords: Algorithms; Performance; Bilevel programming; Quadratic separable programs; Test problems
Issue Date: Mar-1994
Publisher: Association for Computing Machinery
Citation: ACM Transactions on Mathematical Software. 20:1 (1994) 103-119
Abstract: This paper describes a technique for generating sparse or dense quadratic bilevel programming problems with a selectable number of known global and local solutions. The technique described here does not require the solution of any subproblems. In addition, since most techniques for solving these problems begin by solving the corresponding relaxed quadratic program, the global solutions are constructed to be different than the global solution of this relaxed problem in a selectable number of upper- and lower-level variables. Finally, the problems that are generated satisfy the requirements imposed by all of the solution techniques known to the authors.
URI: http://hdl.handle.net/10316/10700
ISSN: 0098-3500
DOI: 10.1145/174603.174411
Rights: openAccess
Appears in Collections:FCTUC Matemática - Artigos em Revistas Internacionais

Files in This Item:
File Description SizeFormat
Generating quadratic bilevel programming test problems.pdf703.77 kBAdobe PDFView/Open
Show full item record

SCOPUSTM   
Citations

36
checked on May 29, 2020

WEB OF SCIENCETM
Citations 5

33
checked on Jul 2, 2022

Page view(s) 50

435
checked on Aug 11, 2022

Download(s)

236
checked on Aug 11, 2022

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.