scientific article; zbMATH DE number 7312765

zbMath1460.90165MaRDI QIDQ4963438

Javad Gerami

Publication date: 18 February 2021

Full work available at URL: https://www.ijmex.com/index.php/ijmex/article/view/564

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear programmingouter approximationdata envelopment analysismultiple objective

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Management decision making, including multiple objectives (90B50)

Uses Software

• ADBASE

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
• Finding DEA-efficient hyperplanes using MOLP efficient faces
• Target setting in data envelopment analysis using MOLP
• Solving multiple objective linear programs in objective space
• Finding strong defining hyperplanes of production possibility set
• Constructing the set of efficient objective values in multiple objective linear programs
• Using interactive multiobjective methods to solve DEA problems with value judgements
• An MOLP based procedure for finding efficient units in DEA models
• Theory of multiobjective optimization
• Analysis of the objective space in multiple objective linear programming
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
• A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
• Multiobjective programming and planning
• Admissible points of a convex polyhedron
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Linear multiobjective programming
• Vector maximization with two objective functions
• An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
• A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
• Equivalence and implementation of alternative methods for determining returns to scale in data envelopment analysis
• On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
• Weights restrictions and value judgements in data envelopment analysis: Evolution, development and future directions
• Generating the efficient outcome set in multiple objective linear programs: The bicriteria case
• A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
• Finding the piecewise linear frontier production function in data envelopment analysis
• A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
• Time dependency in multiple objective dynamic programming
• Integrating DEA-oriented performance assessment and target setting using interactive MOLP methods
• Influential observations in frontier models, a robust non-oriented approach to the water sector
• An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
• Structural Comparison of Data Envelopment Analysis and Multiple Objective Linear Programming
• An Overview of Techniques for Solving Multiobjective Mathematical Programs
• An Interactive MOLP Procedure for the Extension of DEA to Effectiveness Analysis
• Theory and algorithms for linear multiple objective programs with zero–one variables
• Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
• A Successive Underestimation Method for Concave Minimization Problems
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• Towards finding global representations of the efficient set in multiple objective mathematical programming
• Convex Analysis

This page was built for publication: