Abstract In this paper, by using Data Envelopment Analysis (DEA) technique a method is proposed to find efficient solutions of 0-1 Multiple Objective Linear Programming (MOLP) problem. In this method from a feasible solution of 0-1 MOLP problem, a Decision Making Unit (DMU) without input vector is constructed in which output vector for DMU is the values of objective functions. The method consis...

In this paper we discuss the question: among a group of decision making units (DMUs), if a DMU changes some of its input (output) levels, to what extent should the unit change outputs (inputs) such that its efficiency index remains unchanged? In order to solve this question we propose a solving method based on Data Envelopment Analysis (DEA) and Multiple Objective Linear Programming (MOLP). In ...

Jie Lu, Fengjie Wu, Guangquan Zhang Faculty of Information Technology, University of Technology, Sydney, PO Box 123, Broadway, NSW 2007, Australia E-mail: [email protected] Abstract Many organizational decision problems can be formulated by multi-objective linear programming (MOLP) models. Referring to the imprecision inherent in human judgments, uncertainty may be incorporated in the paramet...

Providing an efficient production plan that integrates the procurement and distribution plans into a unified framework is critical to achieving competitive advantage. In this paper,we consider a supply chainmaster planningmodel consisting ofmultiple suppliers, one manufacturer andmultiple distribution centers.Wefirst propose a newmulti-objective possibilisticmixed integer linear programming mod...

The multiple objective simplex algorithm and its variants work in the decision variable space to find set of all efficient extreme points linear programming (MOLP). Other approaches problem either entire solutions or a subset them also return corresponding values (nondominated points). This paper presents an extension multiobjective (MSA) generate nondominated no redundant ones. extended versio...

Many business decisions can be modeled as multiple objective linear programming (MOLP) problems. When formulating a MOLP problem, objective functions and constraints involve many parameters which possible values are assigned by the experts who are often imprecisely or ambiguously known. So, it would be certainly more appropriate to interpret the experts’ understanding of the parameters as fuzzy...

Multiplicative programming problems (MPPs) are global optimisation problems known to be NP-hard. In this paper, we employ algorithms developed to compute the entire set of nondominated points of multi-objective linear programming (MOLP) problems to solve linear MPPs. First, we improve our own objective space cut and bound algorithm for convex MPPs in the special case of linear MPPs by only solv...

Data envelopment analysis (DEA) is a performance measurement tool that was initially developed without consideration of the decision maker (DM)’s preference structures. Ever since, there has been a wide literature incorporating DEA with value judgements such as the goal and target setting models. However, most of these models require prior judgements on target or weight setting. This paper will...