Data envelopment analysis (DEA) measures the efficiency score of a set homogeneous decision-making units (DMUs) based on observed input and output. Considering input-oriented, inverse DEA models find required level for producing given amount production in current level. This article proposes new form model considering income (for planning) budget finance budgeting) constraints. In contrast with classical model, both output levels are variable proposed to meet (or budget) Proposed help...

In this paper, we apply the minimum information theory to uncapacitated p-median facility location problem determine most probable allocation solution. Indeed, investigate bi-level model introduced by [TRANSPORT RES B-METH. 123 (2019) 1–20] in case that facilities have unlimited capacities. At upper level, minimizing cost of establishing and allocating demands is considered, while solution customers' point view determined through lower level. By adding Karush-Kuhn-Tucker optimality...

In the classical p-median problem, we want to find a set Y containing p points in given graph G such that sum of weighted distances from all vertices V is minimised. this paper, consider 1-median and 2-median problems on tree with fuzzy weights. We show majority property holds for problem tree. Then based proposed ranking function property, algorithm presented median Finally, extended solve trees.

Let G be a bipartite graph. In this paper we consider the two kind of location problems namely p-center and p-median on graphs. The asks to find subset vertices cardinality p, so that respectively maximum sum distances from set all other in is minimized. For each case present some properties exact solutions.

We investigate the<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M2"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math>-median problem with fuzzy variables and weights of vertices. The equalities inequalities transform to crisp cases by using some technique used in linear programming. show that the objective function also can be replaced functions. Therefore an auxiliary programming model is obtained for fuzzy<mml:math...

&lt;p style='text-indent:20px;'&gt;We introduce a case of inverse single facility location problem on tree where by minimum modifying in the length edges, difference distances between farthest and nearest clients to given is minimized. Two cases are considered: bounded unbounded nonnegative edge lengths. In case, we show can be reduced solve star graph. Then an &lt;inline-formula&gt;&lt;tex-math id="M1"&gt;\begin{document}$ O(nlogn) $\end{document}&lt;/tex-math&gt;&lt;/inline-formula&gt;...

In basic inverse DEA problems, the goal is to find least number of inputs produce desired outputs with current efficiency level (input oriented) or optimal output for amount input (output oriented). paper, we propose new models problems when prices are available. We consider not only technical and cost simultaneously but also income production units. comparison existing model including cost-revenue based models, have more flexibility in terms determining levels our models. utilise proposed...

In this paper we study the problem of locating multiple facilities in convex sets with fuzzy parameters. This asks to find location new given such that sum weighted distances between and existing is minimized. We present a linear programming model for block norms, then use it problems data. also do rectilinear infinity norms as special cases norms.

Let weighted points be given in the plane . For each point a radius is which expected ideal distance from this to new facility. We want find location of facility such that sum errors between existing and minimized. This fact nonconvex optimization problem. show optimal solution lies an extended rectangular hull points. Based on finding then efficient big square small (BSSS) procedure proposed.