zbMATH — the first resource for mathematics

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.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
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)
Bilevel programming data envelopment analysis with constrained resource. (English) Zbl 1205.90165
Summary: A new BiLevel programming Data Envelopment Analysis (DEA) approach is created to provide valuable managerial insights when assessing the performance of a system with Stackelberg-game relationships. This new approach allows us to evaluate the firm performance in decentralized decisions, which consist of the objective(s) of the leader at its first level and that is of the follower at the second level. This approach can help decentralized companies to optimize their performance using multiple inputs to produce multiples outputs in a cost-effective way, where both the system “black-box” and subsystem performance are exposed in details. We show the algorithms and solutions to our new models. We illustrate and validate the proposed new approach using two case studies: a banking chain and a manufacturing supply chain. The computation shows that subsystem being efficient at all levels results in an overall efficiency achievement in a decentralized BiLevel structure.
90B50Management decision making, including multiple objectives
90C05Linear programming
91A65Hierarchical games
[1]Bard, J.: An efficient point algorithm for a linear two-stage optimization problem, Operations research 31, 670-684 (1983) · Zbl 0525.90086 · doi:10.1287/opre.31.4.670
[2]Bard, J.: Convex two-level optimization mathematical programming, Mathematical programming 40, 15-27 (1988) · Zbl 0655.90060 · doi:10.1007/BF01580720
[3]Bard, J.; Falk, J.: An explicit solution to the multi-level programming problem, Computers and operations research 9, 77-100 (1982)
[4]Bard, J.; Moore, J. T.: A branch and bound algorithm for the bilevel programming problem, SIAM journal on scientific and statistical computing 11, 281-292 (1990) · Zbl 0702.65060 · doi:10.1137/0911017
[5]Berger, A. N.; Humphrey, D. B.: Megamergers in banking and the use of cost efficiency as an antitrust defense, Antitrust bulletin 37, No. 3, 541-600 (1992)
[6]Berger, A. N.; Hancock, D.; Humphrey, D. B.: Bank efficiency derived from the profit function, Journal of banking and finance 17, No. 2/3, 317-348 (1993)
[7]Charnes, A.; Cooper, W. W.; Rhodes, E. L.: Measuring the efficiency of decision making units, European journal of operational research 2, No. 6, 429-444 (1978) · Zbl 0416.90080 · doi:10.1016/0377-2217(78)90138-8
[8]Clark, J. A.: Economic cost, scale efficiency, and competitive viability in banking, Journal of money, banking and credit 28, No. 3, 342-364 (1996)
[9]Cooper, W. W.; Seiford, L. M.; Tone, K.: Data envelopment analysis: A comprehensive text with models, applications, references, (2000)
[10]Dempe, S.: Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints, Optimization 52, 333-359 (2003) · Zbl 1140.90493 · doi:10.1080/0233193031000149894
[11]Ryu, J. H.; Dua, V.; Pistikopoulos, E. N.: A bilevel programming framework for enterprise-wide process networks under uncertainty, Computers and chemical engineering 28, No. 6 – 7, 1121-1129 (2004)
[12]Shi, C.; Zhang, G.; Lu, J.; Zhou, H.: An extended branch and bound algorithm for linear bilevel programming, Applied mathematics and computation 180, 529-537 (2006) · Zbl 1102.65071 · doi:10.1016/j.amc.2005.12.039
[13]Visweswaran, V.; Floudas, C. A.; Ierapatritou, M. G.; Pistikopoulos, E. N.: A decomposition-based global optimization approach for solving bilevel linear and quadratic programs, State of the art in global optimization (1996)
[14]Wang, C. H.; Gopal, R.; Zionts, S.: Use of data envelopment analysis in assessing information technology impact on firm performance, Annals of operations research 73, 191-213 (1997) · Zbl 0891.90018 · doi:10.1023/A:1018977111455
[15]Wu, D.; Yang, Z.; Liang, L.: Using DEA-neural network approach to evaluate branch efficiency of a large canadian bank, Expert systems with applications 31, No. 1, 108-115 (2006)
[16]Wu, D.; Yang, Z.; Vela, S.; Liang, L.: Simultaneous analysis of production and investment performance of canadian life & health insurance companies using DEA, Computers and operations research 2, No. 34, 429-444 (2007)
[17]Wu, D.: Performance evaluation: an integrated method using data envelopment analysis and fuzzy preference relations, European journal of operational research. 1, No. 194, 227-235 (2009) · Zbl 1158.90005 · doi:10.1016/j.ejor.2007.10.009