Measuring efficiency in data envelopment analysis under conditional convexity
From MaRDI portal
Cites work
- A survey on mixed-integer programming techniques in bilevel optimization
- A well-defined composite indicator: an application to corporate social responsibility
- Bilevel programming data envelopment analysis with constrained resource
- Convex input and output projections of nonconvex production possibility sets
- Data Envelopment Analysis on a Relaxed Set of Assumptions
- DEA on Relaxed Convexity Assumptions
- DEA with efficiency classification preserving conditional convexity
- How to deal with non-convex frontiers in data envelopment analysis
- scientific article; zbMATH DE number 5368431 (Why is no real title available?)
- Improving finite sample approximation by central limit theorems for estimates from data envelopment analysis
- Maintaining the regular ultra passum law in data envelopment analysis
- Mathematical Programs with Optimization Problems in the Constraints
- Measuring the efficiency of decision making units
- Modelling weak disposability in data envelopment analysis under relaxed convexity assumptions
- Non-convex technologies and cost functions: definitions, duality and nonparametric tests of convexity
- Nonparametric production technologies with weakly disposable inputs
- Profit, directional distance functions, and Nerlovian efficiency
- Selective convexity in DEA models
- Setting closer targets based on non-dominated convex combinations of Pareto-efficient units: a bi-level linear programming approach in data envelopment analysis
- Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
This page was built for publication: Measuring efficiency in data envelopment analysis under conditional convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6995576)
