906 resultados para Weights and Measures.
Resumo:
Mode of access: Internet.
Resumo:
"Issued August 1980."
Resumo:
Includes bibliographical references.
Resumo:
World textile abstracts
Resumo:
Microform.
Resumo:
Several parts have separate title pages.
Resumo:
Mode of access: Internet.
Resumo:
Part II (p. 99-112) deals with the scat, or ancient land-tax levied in the Shetland Islands.
Resumo:
Goldsmiths'-Kress no. 26736.10.
Resumo:
A dialogue between a Democrat and a Whig.
Resumo:
The last edition published in this form. The next edition issued in three separate volumes: Meteorological tables, 1893; Geographical tables, 1899; Physical tables, 1896.
Resumo:
Vol. for 1914 has supplement (publ. 1917).
Resumo:
Imprint varies: Washington, D.C., 1984-19 ; Gaithersburg, MD <1996->
Resumo:
This paper re-assesses three independently developed approaches that are aimed at solving the problem of zero-weights or non-zero slacks in Data Envelopment Analysis (DEA). The methods are weights restricted, non-radial and extended facet DEA models. Weights restricted DEA models are dual to envelopment DEA models with restrictions on the dual variables (DEA weights) aimed at avoiding zero values for those weights; non-radial DEA models are envelopment models which avoid non-zero slacks in the input-output constraints. Finally, extended facet DEA models recognize that only projections on facets of full dimension correspond to well defined rates of substitution/transformation between all inputs/outputs which in turn correspond to non-zero weights in the multiplier version of the DEA model. We demonstrate how these methods are equivalent, not only in their aim but also in the solutions they yield. In addition, we show that the aforementioned methods modify the production frontier by extending existing facets or creating unobserved facets. Further we propose a new approach that uses weight restrictions to extend existing facets. This approach has some advantages in computational terms, because extended facet models normally make use of mixed integer programming models, which are computationally demanding.