2001
DOI: 10.1016/s0377-2217(00)00155-7
|View full text |Cite
|
Sign up to set email alerts
|

DEA with efficiency classification preserving conditional convexity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
3
0

Year Published

2003
2003
2024
2024

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 54 publications
(6 citation statements)
references
References 38 publications
0
3
0
Order By: Relevance
“…When inputs have zero shadow prices, the calculation of the quantile shadow-price Fisher index will be challenged. To model nonconvexity in the estimation of quantile func-tions, one possibility is to consider conditional convexity, which leads to a piece-wise linear function (see, e.g., Kuosmanen, 2001). We leave it for future work to develop alternative CQR preserving conditional convexity.…”
Section: Proof See Appendix a ■mentioning
confidence: 99%
“…When inputs have zero shadow prices, the calculation of the quantile shadow-price Fisher index will be challenged. To model nonconvexity in the estimation of quantile func-tions, one possibility is to consider conditional convexity, which leads to a piece-wise linear function (see, e.g., Kuosmanen, 2001). We leave it for future work to develop alternative CQR preserving conditional convexity.…”
Section: Proof See Appendix a ■mentioning
confidence: 99%
“…The statement (7) of technology T WID 1 is nonlinear. Using substitution (5) and implementing the linearization technique employed by Kuosmanen (2001), it is straightforward to show that T WID 1 can be restated in the following equivalent form:…”
Section: The Wid Technology With Convex Input Setsmentioning
confidence: 99%
“…There are many other approaches to modelling nonconvex production technologies developed in the literature, including those ofBogetoft et al (2000),Kuosmanen (2001),Briec et al (2004),Agrell et al (2005),Podinovski (2005) andMehdiloozad et al (2014), to name a few. In our paper, we limit our investigation only to the three cases identified above.4 Using a more general approach based on directional distance functions(Chambers et al, 1998) also results in a linear program.…”
mentioning
confidence: 99%
“…Next, Bogetoft (1996), Chang (1999), Dekker and Post (2001) and Post (2001b, 2001c) have considered convexity of either input sets or output sets. Finally, Post (2001c), and Kuosmanen (2001) replaced convexity by the modified properties of ‘ transconvexity ’ and ‘ conditional convexity ’ respectively.…”
Section: Graph Convexity (Gc)mentioning
confidence: 99%