zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
A hybrid tabu-ascent algorithm for the linear bilevel programming problem. (English) Zbl 0859.90097
Summary: The linear Bilevel Programming Problem (BLP) is an instance of a linear hirarchical decision process where the lower level constraint set is dependent on decisions taken at the upper level. In this paper, we propose to solve this NP-hard problem using an adaptive search method related to the Tabu Search metaheuristic. Numerical results on large scale linear BLPs are presented.

MSC:
90C05Linear programming
90C27Combinatorial optimization
93A13Hierarchical systems
References:
[1]Anandalingam, G. and White, D.J., A solution method for the linear static Stackelberg problem using penalty functions, IEEE Transactions on Automatic Control, 35 (1990), pp. 1170-1173. · Zbl 0721.90098 · doi:10.1109/9.58565
[2]Bard, J.F. and Falk, J.E., An explicit solution to the multi-level programming problem, Computers and Operations Research, 9 (1982), pp. 77-100. · doi:10.1016/0305-0548(82)90007-7
[3]Bard, J. F., An efficient point algorithm for linear two-stage optimization problem, Operations Research, 31 (1983), pp. 670-684. · Zbl 0525.90086 · doi:10.1287/opre.31.4.670
[4]Bard, J. F. and Moore, J.T., A branch and bound algorithm for the bilevel programming problem, SIAM Journal on Scientific and Statistical Computing, 11(2) (1990), pp. 281-292. · Zbl 0702.65060 · doi:10.1137/0911017
[5]Bialas, W.F. and Karwan, M.H., On two-level linear optimization, IEEE Transactions on Automatic Control, AC-27(1) (1982), pp. 211-214. · Zbl 0487.90005 · doi:10.1109/TAC.1982.1102880
[6]Candler, W. and Townsley, R., A linear two-level programming problem, Computers and Operations Research, 9 (1982), 59-76. · doi:10.1016/0305-0548(82)90006-5
[7]Glover, F., Tabu Search, Part I, ORSA Journal on Computing 1 (1990), pp. 190-206.
[8]Glover, F., Tabu Search, Part II, ORSA Journal on Computing 2 (1990), pp. 4-32.
[9]Hansen, P., The steepest ascent mildest descent heuristic for combinatorial programming, Congress on Numerical Methods in Combinatorial Optimization, Capri, 1986.
[10]Hansen, P., Jaumard, B. and Savard, G., New branch-and-bound rules for linear bilevel programming, SIAM Journal on Scientific and Statistical Computing 13 (1992), pp. 1194-1217. · Zbl 0760.65063 · doi:10.1137/0913069
[11]Haurie, A., Savard, G. and White, D. J., A note on: An efficient point algorithm for a linear two-stage optimization problem, Operations Research, 38 (1990), pp. 553-555. · Zbl 0708.90051 · doi:10.1287/opre.38.3.553
[12]Jeroslow, R.G., The polynomial hierarchy and a simple model for competitive analysis, Mathematical Programming, 32 (1985), pp. 146-164. · Zbl 0588.90053 · doi:10.1007/BF01586088
[13]Júdice, J. and Faustino, A., A sequential LCP method for bilevel linear programming, Annals of Operations Research, 34 (1992), pp. 89-106. · Zbl 0749.90049 · doi:10.1007/BF02098174
[14]Marsten, R.E., The design of the XMP linear programming library, Transactions on Mathematical Software, 7(4) (1981), pp. 481-497. · doi:10.1145/355972.355976
[15]Mathieu, R., Pittard, L. and Anandalingam, G., Genetic algorithm based approach to bi-level linear programming, R.A.I.R.O. Recherche Opérationnelle, 28 (1994), pp. 1-21
[16]Marcotte, P. and Savard, G., Novel approaches to the discrimination problem, Zeitschrift für Operations Research, 36 (1992), pp. 517-545.
[17]Savard, G. and Gauvin, J., The steepest descent direction for the nonlinear bilevel programming Problem, Operations Research Letters, 15 (1994), pp. 265-272. · Zbl 0816.90122 · doi:10.1016/0167-6377(94)90086-8
[18]Vicente, L.N. and Calamai, P.H., Bilevel and multilevel programming: A bibliography review, forthcoming in Journal of Global Optimization.
[19]Vicente, L., Savard, G. and Júdice, J., Descent Approaches for Quadratic Bilevel Programming, Journal of Optimization Theory and Applications, 81 (1994), pp. 379-399. · Zbl 0819.90076 · doi:10.1007/BF02191670