We introduce in this paper a new starting mechanism for multiple-objective linear programming (MOLP) algorithms. This makes it possible to start an algorithm from any solution in objective space. The original problem is first augmented in such a way that a given starting solution is feasible. The augmentation is explicitly or implicitly controlled by one parameter during the search process, whi...

In this paper, we focus on hierarchical multiobjective linear programming problems where multiple decision makers in a hierarchical organization have their own multiple objective linear functions together with common linear constraints, and propose a fuzzy approach to obtain a satisfactory solution which reflects not only the hierarchical relationships between multiple decision makers but also ...

in this research, both resource allocation and reactive resource allocation problems in multi-server dynamic pert networks are analytically modeled, where new projects are expected to arrive according to a poisson process, and activity durations are also known as independent random variables with exponential distributions. such system is represented as a queuing network, where multi servers at ...

in this paper, using the value efficiency in dea pattern by taking decisive obtain. generally, non-radial model of ve and use proper weight to reduce input and output gain are the appropriate pattern. this paper introduces a multi-objective linear programming problem and efficiency determines the value of inefficient units. use interactive methods to solve molp proposed and applied. in conclusi...

A characteristic of data envelopment analysis (DEA) is to allow individual decision making units (DMUs) to select the factor weights that are the most advantages for them in calculating their efficiency scores. This flexibility in selecting the weights, on the other hand, deters the comparison among DMUs on a common base. For dealing with this difficulty and assessing all the DMUs on the same s...