In the past decade, corporate firms have globally increasingly adopted social responsibility (CSR) practices; however, so far less is known about how productivity change in presence of socially responsible and undesirable output can be evaluated. This paper develops a framework that integrates CSR dynamic by-production technology which captures transformation multiple inputs into marketed outpu...

In this paper, we introduce and study the system of generalized vector quasi-variational-like inequalities in Hausdorff topological vector spaces. By means of fixed point theorem, we obtain existence theorem for the system of generalized vector quasi-variational-like inequalities and also derive the existence result of solutions for the generalized vector quasi-variational-like inequalities. Ke...

We provide fuzzy quasi-metric versions of a fixed point theorem ofGregori and Sapena for fuzzy contractive mappings in G-complete fuzzy metricspaces and apply the results to obtain fixed points for contractive mappingsin the domain of words.

In this paper, we give a new fixed point theorem forWeakly quasi-contraction maps in metric spaces. Our results extend and improve some fixed point and theorems in literature.    

The system of fixed elements of a projectivity contains with any two points the line connecting them and with any two lines their intersection. It is, therefore, in its structure very much like a subplane of the plane under consideration ; and thus one may expect the structure of the projectivity to be dominated by the structure of the system of its fixed elements, provided this system is not "...

resource allocation and optimal leveling are among the top challenges in project management. this paper presents a dea-based procedure for determining an optimal level of inputs to produce a fixed level of outputs. to achieve this goal, we assume that the levels of outputs can be forecasted in the next season and the procedure will determine optimal level of inputs for all dmus. such as some of...

Q-reducibility is a natural generalization of many-one reducibility (m-reducibility): if A ≤m B via a computable function f(x), then A ≤Q B via the computable function g(x) such that Wg(x) = {f(x)}. Also this reducibility is connected with enumeration reducibility (e-reducibility) as follows: if A ≤Q B via a computable function g(x), then ω −A ≤e ω −B via the c. e. set W = {〈x, 2y〉 | x ∈ ω, y ∈...