Chance constrained programming approaches to congestion in stochastic data envelopment analysis

The models described in this paper for treating congestion in DEA are extended by according them chance constrained programming formulations. The usual route used in chance constrained programming is followed here by replacing these stochastic models with their “deterministic equivalents.” This lead...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 155; číslo 2; s. 487 - 501
Hlavní autoři: Cooper, William W., Deng, H., Huang, Zhimin, Li, Susan X.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.06.2004
Elsevier
Elsevier Sequoia S.A
Edice:European Journal of Operational Research
Témata:
Chance constrained programming
Congestion
Data envelopment analysis
DEA (data envelopment analysis)
Inefficiency
Nonlinear programming
Studies
Inefficiency
Congestion
DEA (data envelopment analysis)
Chance constrained programming
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The models described in this paper for treating congestion in DEA are extended by according them chance constrained programming formulations. The usual route used in chance constrained programming is followed here by replacing these stochastic models with their “deterministic equivalents.” This leads to a class of non-linear problems. However, it is shown to be possible to avoid some of the need for dealing with these non-linear problems by identifying conditions under which they can be replaced by ordinary (deterministic) DEA models. Examples which illustrate possible uses of these approaches are also supplied in an Appendix A.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(02)00901-3