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)
Some properties of the bilevel programming problem. (English) Zbl 0696.90086
The purpose of this paper is to elaborate on the difficulties accompanying the development of efficient algorithms for solving the bilevel programming problem (BLPP). We begin with a pair of examples showing that, even under the best of circumstances, solutions may not exist. This is followed by a proof that the BLPP is NP-hard.
Reviewer: J.F.Bard
MSC:
90C99Mathematical programming
91A052-person games
90C60Abstract computational complexity for mathematical programming problems
93A13Hierarchical systems
References:
[1]Bard, J. F.,Optimality Conditions for the Bilevel Programming Problem, Naval Research Logistics Quarterly, Vol. 31, pp. 13-26, 1984. · Zbl 0537.90087 · doi:10.1002/nav.3800310104
[2]Hasen, P., Jaumard, B., andSavard, G.,A Variable Elimination Algorithm for Bilevel Programming, RUTCOR Research Report RRR-17-89, Rutgers University, New Brunswick, New Jersey, 1989.
[3]Jeroslow, R. G.,The Polynomial Hierarchy and a Simple Model for Competitive Analysis, Mathematical Programming, Vol. 32, pp. 146-164, 1985. · Zbl 0588.90053 · doi:10.1007/BF01586088
[4]Hogan, W. W.,Point-to-Set Maps in Mathematical Programming, SIAM Review, Vol. 15, pp. 591-603, 1973. · Zbl 0256.90042 · doi:10.1137/1015073
[5]Garey, M. R. andJohnson, D. S.,Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, New York, New York, 1979.
[6]Ben-Ayed, O., andBlair, C. E.,Computational Difficulties of Bilevel Programming, Working Paper WP-1432, College of Commerce and Business Administration, University of Illinois, Urbana, Illinois, 1988.