Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs
From MaRDI portal
Publication:1584813
Recommendations
- A method for solving 0-1 multiple objective programming problem, using data envelopment analysis technique
- A METHOD FOR SOLVING 0-1 MULTIPLE OBJECTIVE LINEAR PROGRAMMING PROBLEM USING DEA
- Resource allocation problem based on the DEA model
- Comparing multiobjective mathematical programming methods in the light of data envelopment analysis
- Multicriteria allocation model of additional resources based on DEA: MOILP-DEA
Cites work
- A multi-objective constrained resource information system project selection method
- A Network Optimization Model for Budget Planning in Multi-Objective Hierarchical Systems
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- Efficiency analysis by production frontiers. The nonparametric approach
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 3427111 (Why is no real title available?)
- scientific article; zbMATH DE number 3083088 (Why is no real title available?)
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- 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
- Solving zero-one multiple objective programs through implicit enumeration
- Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
- Theory and algorithms for linear multiple objective programs with zero–one variables
Cited in
(16)- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- Efficiency status of a feasible solution in the multi-objective integer linear programming problems: a DEA methodology
- Integrating multiple criteria decision analysis and production theory for performance evaluation: framework and review
- A novel mixed Spider's web initial solution and data envelopment analysis for solving multi-objective optimization problems
- 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 method for generating all efficient solutions of 0-1 multi-objective linear programming problem
- A comparison of stochastic dominance and stochastic DEA for vendor evaluation
- scientific article; zbMATH DE number 1071795 (Why is no real title available?)
- A METHOD FOR SOLVING 0-1 MULTIPLE OBJECTIVE LINEAR PROGRAMMING PROBLEM USING DEA
- 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
- Connections between multiple-objective programming and weight restricted data envelopment analysis: the role of the ordering cone
- A method for finding efficient DMUs in DEA using 0-1 linear programming
- A method for solving 0-1 multiple objective programming problem, using data envelopment analysis technique
- Exact algorithm for bi-objective 0-1 knapsack problem
This page was built for publication: Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584813)
