Technical efficiency and distance to a reverse convex set
From MaRDI portal
Publication:1809835
DOI10.1016/S0377-2217(98)00089-7zbMath0944.90018MaRDI QIDQ1809835
Publication date: 25 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
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
Non-Convex feasibility problems and proximal point methods, A formula on the conjugate of the max of a convex functions and a concave function, 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 well-defined efficiency measure for dealing with closest targets in DEA, 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 spaces1
- Duality in Reverse Convex Optimization
- Convex Analysis
- Optimization over the efficient set
