Relationships between Pareto optimality in multi-objective 0-1 linear programming and DEA efficiency

DOI10.1016/j.ejor.2006.10.026zbMath1169.90447OpenAlexW2143111734MaRDI QIDQ2371350

Jacob W. Yougbaré, Jacques jun. Teghem

Publication date: 4 July 2007

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.10.026

zbMATH Keywords

Pareto optimaldeaBCC efficientmultiple-objective 0-1 linear programs

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear programming (90C05) Boolean programming (90C09)

Related Items (3)

Multicriteria allocation model of additional resources based on DEA: MOILP-DEA ⋮ 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

Cites Work

• Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
• Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs
• Finding the efficiency score and RTS characteristic of DMUs by means of identifying the efficient frontier in DEA
• Using DEA as a tool for MCDM: some remarks
• Multi‐objective combinatorial optimization problems: A survey

This page was built for publication: Relationships between Pareto optimality in multi-objective 0-1 linear programming and DEA efficiency