Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs

DOI10.1016/S0377-2217(99)00279-9zbMath0970.90093MaRDI QIDQ1584813

Yu-Lee Yen, Fuh-Hwa Franklin Liu, Chueng Chiu Huang

Publication date: 11 January 2001

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

zbMATH Keywords

data envelopment analysismulti-objective mathematical programming0-1 linear programming

Mathematics Subject Classification ID

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

Related Items (11)

On efficient solutions of 0-1 multi-objective linear programming problems ⋮ Relationships between Pareto optimality in multi-objective 0-1 linear programming and DEA efficiency ⋮ A comparison of stochastic dominance and stochastic DEA for vendor evaluation ⋮ A METHOD FOR GENERATING ALL THE EFFICIENT SOLUTIONS OF A 0-1 MULTI-OBJECTIVE LINEAR PROGRAMMING PROBLEM ⋮ Evolving a multiobjective obstacle avoidance skill of a seven-link manipulator subject to constraints ⋮ Efficiency status of a feasible solution in the multi-objective integer linear programming problems: a DEA methodology ⋮ Exact algorithm for bi-objective 0-1 knapsack problem ⋮ A novel mixed Spider's web initial solution and data envelopment analysis for solving multi-objective optimization problems ⋮ Integrating multiple criteria decision analysis and production theory for performance evaluation: framework and review ⋮ A method for finding the set of non-dominated vectors for multiple objective integer linear programs ⋮ A method for generating all efficient solutions of 0-1 multi-objective linear programming problem

Cites Work

• 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
• On the choice of step size in subgradient optimization
• Recent developments in screening methods for nondominated solutions in multiobjective optimization
• A multi-objective constrained resource information system project selection method
• Solving zero-one multiple objective programs through implicit enumeration
• Efficiency analysis by production frontiers. The nonparametric approach
• An Overview of Techniques for Solving Multiobjective Mathematical Programs
• Theory and algorithms for linear multiple objective programs with zero–one variables
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A Network Optimization Model for Budget Planning in Multi-Objective Hierarchical Systems

This page was built for publication: Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs