Integrated data envelopment analysis: global vs. local optimum
From MaRDI portal
Recommendations
- Integrated data envelopment analysis: linear vs. nonlinear model
- A conic relaxation model for searching for the global optimum of network data envelopment analysis
- Composite network data envelopment analysis model
- scientific article; zbMATH DE number 5846256
- Solving data envelopment analysis models with sum-of-fractional objectives: a global optimal approach based on the multiparametric disaggregation technique
Cites work
- scientific article; zbMATH DE number 192992 (Why is no real title available?)
- A joint measurement of efficiency and effectiveness for non-storable commodities: integrated data envelopment analysis approaches
- Additive efficiency decomposition in two-stage DEA
- DEA models for supply chain efficiency evaluation
- DEA models for two-stage processes: Game approach and efficiency decomposition
- Efficiency decomposition in two-stage data envelopment analysis: an application to non-life insurance companies in Taiwan
- Measuring the efficiency of decision making units
- Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
Cited in
(15)- Regional division and reduction algorithm for minimizing the sum of linear fractional functions
- The network data envelopment analysis models for non-homogenous decision making units based on the Sun network structure
- A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem
- A game theoretic approach to modeling undesirable outputs and efficiency decomposition in data envelopment analysis
- Integrated data envelopment analysis: linear vs. nonlinear model
- Network data envelopment analysis: a review
- Dynamic network data envelopment analysis based upon technology changes
- A conic relaxation model for searching for the global optimum of network data envelopment analysis
- A practicable branch and bound algorithm for sum of linear ratios problem
- An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem
- Decomposition weights and overall efficiency in two-stage additive network DEA
- A practicable contraction approach for the sum of the generalized polynomial ratios problem
- Concurrent estimation of efficiency, effectiveness and returns to scale
- Equivalent solutions to additive two-stage network data envelopment analysis
- Multi-choice conic goal programming model-based network data envelopment analysis
This page was built for publication: Integrated data envelopment analysis: global vs. local optimum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355846)