Technical efficiency and distance to a reverse convex set

DOI10.1016/S0377-2217(98)00089-7zbMath0944.90018WikidataQ127360842 ScholiaQ127360842MaRDI QIDQ1809835

Yanyan Li

Publication date: 25 November 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00089-7

zbMATH Keywords

linear programming; production; efficiency; duality; reverse convex

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C46: Optimality conditions and duality in mathematical programming

90C05: Linear programming

49J50: Fréchet and Gateaux differentiability in optimization

90B30: Production models

49N15: Duality theory (optimization)

Related Items

New Models for Computing the Distance of DMUs to the Weak Efficient Boundary of Convex and Nonconvex PPSs in DEA, Non-Convex feasibility problems and proximal point methods, Directional Distance Functions in DEA with Optimal Endogenous Directions, A formula on the conjugate of the max of a convex functions and a concave function, Exponential distance function and duality theory, Strong, weak and Farrell efficient frontiers of technologies satisfying different production assumptions, Closest targets in the slacks-based measure of efficiency for production units with multi-period data, Closest reference point on the strong efficient frontier in data envelopment analysis, Generalised commensurability properties of efficiency measures: implications for productivity indicators, Determining closest targets on the extended facet production possibility set in data envelopment analysis: modeling and computational aspects, Benchmarking in data envelopment analysis: an approach based on genetic algorithms and parallel programming, Measurements of simultaneous scale and mix changes in inputs and outputs using DEA facets and RTS, A cross-bargaining game approach for direction selection in the directional distance function, A well-defined efficiency measure for dealing with closest targets in DEA, Decomposing economic efficiency into technical and allocative components: an essential property, USING THE MINIMUM DISTANCE OF DMUs FROM THE FRONTIER OF THE PPS FOR EVALUATING GROUP PERFORMANCE OF DMUs IN DEA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
• Measuring the efficiency of decision making units
• Minimization of a quasi-concave function over an efficient set
• Continuity of measures of technical efficiency
• An algorithm for optimizing over the weakly-efficient set
• Approximation in multiobjective optimization
• Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
• Generalized Directional Derivatives and Subgradients of Nonconvex Functions
• Minimization of continuous convex functional on complements of convex subsets of locally convex spaces¹
• Duality in Reverse Convex Optimization
• Convex Analysis
• Optimization over the efficient set