in this paper, presenting two simple methods for ranking of efficient dmus in dea models that included to add one virtual dmu as ideal dmu and is using the additive model. note that, we use an ideal point just for comparing efficient dmus with. although these methods are simple, they have ability for ranking all efficient dmus, extreme points and the others, also they are capable of ranking the...

This paper introduces two virtual Decision Making Units (DMUs) called ideal point and anti-ideal point, Then calculates distances of each DMU to the ideal and anti-ideal point. The two distinctive distances are combined to form a comprehensive index called the relative closeness (RC) just like the TOPSIS approach. The RC index is used as an overall ranking for all the DMUs. Then, this method co...

Many real world search problems involve different objectives, usually in conflict. In these cases the cost of a transition is given by a cost vector. This paper presents IPID, a new exact algorithm based on iterative deepening, that finds the set of all Paretooptimal paths for a search problem in a graph with vectorial costs. Formal proofs of the admissibility of IPID are presented, as well as ...

in this paper, we introduce a method by which we can find a close connection between the set of prime $z$-ideals of $c(x)$ and the same of $c(y)$, for some special subset $y$ of $x$. for instance, if $y=coz(f)$ for some $fin c(x)$, then there exists a one-to-one correspondence between the set of prime $z$-ideals of $c(y)$ and the set of prime $z$-ideals of $c(x)$ not containing $f$. moreover, c...

  In this paper, presenting two simple methods for ranking of efficient DMUs in DEA models that included to add one virtual DMU as ideal DMU and is using the additive model. Note that, we use an ideal point just for comparing efficient DMUs with. Although these methods are simple, they have ability for ranking all efficient DMUs, extreme points and the others, also they are capable of ranking t...

We develop a model of issue-specific voting behavior. This model can be used to explore lawmakers’ personal voting patterns of voting by issue area, providing an exploratory window into how the language of the law is correlated with political support. We derive approximate posterior inference algorithms based on variational methods. Across 12 years of legislative data, we demonstrate both impro...

The ideal probabilistic forecast for a random variable Y based on an information set F is the conditional distribution of given F. In context point forecasts aiming to specify functional T such as mean, quantile or risk measure, respective applied distribution. This paper provides theoretical justification why this actually forecast, that is, F-measurable variable. To end, appropriate notion me...

Computing the exact ideal and nadir criterion values is a very ‎important subject in ‎multi-‎objective linear programming (MOLP) ‎problems‎‎. In fact‎, ‎these values define the ideal and nadir points as lower and ‎upper bounds on the nondominated points‎. ‎Whereas determining the ‎ideal point is an easy work‎, ‎because it is equivalent to optimize a ‎convex function (linear function) over a con...