Estimating Upper and Lower Bounds For Industry Efficiency With Unknown Technology
Authors
Abstract:
With a brief review of the studies on the industry in Data Envelopment Analysis (DEA) framework, the present paper proposes inner and outer technologies when only some basic information is available about the technology. Furthermore, applying Linear Programming techniques, it also determines lower and upper bounds for directional distance function (DDF) measure, overall and allocative efficiency in industry level. Finally, the results are illustrated using a Cobb-Douglas function.
similar resources
Upper and lower bounds for numerical radii of block shifts
For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...
full textUpper and lower bounds of symmetric division deg index
Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...
full textupper and lower bounds for numerical radii of block shifts
for an n-by-n complex matrix a in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of a. in this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...
full textLower Bounds and Upper Bounds for MaxSAT
This paper presents several ways to compute lower and upper bounds for MaxSAT based on calling a complete SAT solver. Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the search of MaxSAT solvers on some benchmarks, and (iii) the upper bounds computed by a Stochastic Local Search procedure (SLS) can be substantially improved when its search is init...
full textUpper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures
The main goal of this thesis is to investigate the complexity of a variety of problems related to text indexing and text searching. We present new data structures that can be used as building blocks for full-text indices which occupies minute space (FM-indexes) and wavelet trees. These data structures also can be used to represent labeled trees and posting lists. Labeled trees are applied in XM...
full textUpper and lower bounds for Fv(4,4;5)
In this note we give a computer assisted proof showing that the unique (5, 3)Ramsey graph is the unique K5-free graph of order 13 giving Fv(3, 4; 5) 6 13, then we prove that 17 6 Fv(2, 2, 2, 4; 5) 6 Fv(4, 4; 5) 6 23. This improves the previous best bounds 16 6 Fv(4, 4; 5) 6 25 provided by Nenov and Kolev.
full textMy Resources
Journal title
volume 10 issue 3
pages 247- 259
publication date 2018-08-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023