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 fuzzy approach for bi-level integer non-linear programming problem. (English) Zbl 1169.90408
Summary: Bi-level programming, a tool for modeling decentralized decisions, consists of the objective of the leader at its first level and that is of the follower at the second level. Integer programming deals with the mathematical programming problems in which some or all the variables are to be integer. This paper studies a bi-level integer non-linear programming problem with linear or non-linear constraints, and in which the non-linear objective function at each level are to maximized. The bi-level integer non-linear programming (BLI-NLP) problem can be thought as a static version of the Stackelberg strategy, which is used leader-follower game in which a Stackelberg strategy is used by the leader, or the higher-level decision-maker (HLDM), given the rational reaction of the follower, or the lower-level decision-maker (LLDM). This paper proposes a two-planner integer model and a solution method for solving this problem. This method uses the concept of tolerance membership function and the branch and bound technique to develop a fuzzy Max-Min decision model for generating Pareto optimal solution for this problem; an illustrative numerical example is given to demonstrate the obtained results.
MSC:
90C10Integer programming
90C70Fuzzy programming