scientific article; zbMATH DE number 7312765
From MaRDI portal
Publication:4963438
Recommendations
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- A new representation of efficient point sets and its applications in DEA
- A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
- scientific article; zbMATH DE number 6002249
- scientific article; zbMATH DE number 1530351
- A DEA approach to rank all efficient extreme and non extreme DMUs
- Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
- An epsilon-free approach for finding the most efficient unit in DEA
- Efficiency analysis, generating an efficient extreme point for an MOLP, and some comparisons
Cites work
- A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
- A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
- A Successive Underestimation Method for Concave Minimization Problems
- A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
- Admissible points of a convex polyhedron
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
- An Interactive MOLP Procedure for the Extension of DEA to Effectiveness Analysis
- An MOLP based procedure for finding efficient units in DEA models
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- Analysis of the objective space in multiple objective linear programming
- Constructing the set of efficient objective values in multiple objective linear programs
- Convex Analysis
- Equivalence and implementation of alternative methods for determining returns to scale in data envelopment analysis
- Finding DEA-efficient hyperplanes using MOLP efficient faces
- Finding strong defining hyperplanes of production possibility set
- Finding the piecewise linear frontier production function in data envelopment analysis
- Generating the efficient outcome set in multiple objective linear programs: The bicriteria case
- scientific article; zbMATH DE number 3936913 (Why is no real title available?)
- scientific article; zbMATH DE number 3945836 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- Influential observations in frontier models, a robust non-oriented approach to the water sector
- Integrating DEA-oriented performance assessment and target setting using interactive MOLP methods
- Linear multiobjective programming
- Measuring the efficiency of decision making units
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- Multiobjective programming and planning
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- Solving multiple objective linear programs in objective space
- Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
- Structural comparison of data envelopment analysis and multiple objective linear programming
- Target setting in data envelopment analysis using MOLP
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- Theory and algorithms for linear multiple objective programs with zero–one variables
- Theory of multiobjective optimization
- Time dependency in multiple objective dynamic programming
- Towards finding global representations of the efficient set in multiple objective mathematical programming
- Using interactive multiobjective methods to solve DEA problems with value judgements
- Vector maximization with two objective functions
- Weights restrictions and value judgements in data envelopment analysis: Evolution, development and future directions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4963438)
