Relationships between Pareto optimality in multi-objective 0-1 linear programming and DEA efficiency
From MaRDI portal
Publication:2371350
Recommendations
- Relationship between Pareto optimality in MOILP and DEA
- A method for solving 0-1 multiple objective programming problem, using data envelopment analysis technique
- Structural comparison of data envelopment analysis and multiple objective linear programming
- A METHOD FOR SOLVING 0-1 MULTIPLE OBJECTIVE LINEAR PROGRAMMING PROBLEM USING DEA
- Efficiency status of a feasible solution in the multi-objective integer linear programming problems: a DEA methodology
Cites work
- Finding the efficiency score and RTS characteristic of DMUs by means of identifying the efficient frontier in DEA
- Multi‐objective combinatorial optimization problems: A survey
- Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
- Using DEA as a tool for MCDM: some remarks
- Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs
Cited in
(6)- Efficiency status of a feasible solution in the multi-objective integer linear programming problems: a DEA methodology
- A novel mixed Spider's web initial solution and data envelopment analysis for solving multi-objective optimization problems
- Multicriteria allocation model of additional resources based on DEA: MOILP-DEA
- Relationship between Pareto optimality in MOILP and DEA
- Aggregate objective functions and Pareto frontiers: required relationships and practical implications
- A method for finding efficient DMUs in DEA using 0-1 linear programming
This page was built for publication: Relationships between Pareto optimality in multi-objective 0-1 linear programming and DEA efficiency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2371350)