ORIGINAL_ARTICLE
Performance evaluation of efficiency change and productivity growth in Supply Chain Management
The performance of a supply chain can be evaluated in either a cross-sectional or a time series manner, and data envelopment analysis is a useful method for both types of evaluation. In this paper we develop an index and indicator of productivity change that can be used with radial and non-radial models for supply chain malmquist index. The supply chain malmquist productivity index (SCMPI) can be decomposed into two components: one is measuring the technical change (TC) and the other measuring technical efficiency change (TEC). So that we propose a supply chain DEA models that have supplier-manufacturer structures.
http://ijim.srbiau.ac.ir/article_6482_388c235ffe1b511b8c57878e185a4bd4.pdf
2015-04-01T11:23:20
2018-12-12T11:23:20
121
127
Supply Chain Management
Data Envelopment Analysis
Productivity Malmquist index
M.
Fallah Jelodar
m.fallahjelodar@iauamol.ac.ir
true
1
Department of Mathematics, Ayatollah Amoli Branch, Islamic Azad University, Amol, Iran.
Department of Mathematics, Ayatollah Amoli Branch, Islamic Azad University, Amol, Iran.
Department of Mathematics, Ayatollah Amoli Branch, Islamic Azad University, Amol, Iran.
LEAD_AUTHOR
M.
Sanei
true
2
Department of Mathematics, Central Tehran Branch, Islamic Azad University, Tehran,Iran.
Department of Mathematics, Central Tehran Branch, Islamic Azad University, Tehran,Iran.
Department of Mathematics, Central Tehran Branch, Islamic Azad University, Tehran,Iran.
AUTHOR
S.
Mamizadeh-Chatghayeh
true
3
Young Researchers and Elite club, Central Tehran Branch, Islamic Azad University, Tehran, Iran.
Young Researchers and Elite club, Central Tehran Branch, Islamic Azad University, Tehran, Iran.
Young Researchers and Elite club, Central Tehran Branch, Islamic Azad University, Tehran, Iran.
AUTHOR
ORIGINAL_ARTICLE
Linear optimization of fuzzy relation inequalities with max-Lukasiewicz composition
In this paper, we study the finitely many constraints of fuzzy relation inequalities problem and optimize the linear objective function on this region which is defined with fuzzy max-Lukasiewicz operator. In fact Lukasiewicz t-norm is one of the four basic t-norms. A new simplification technique is given to accelerate the resolution of the problem by removing the components having no effect on the solution process. Also, an algorithm and one numerical example are offered to abbreviate and illustrate the steps of the problem resolution process.
http://ijim.srbiau.ac.ir/article_6483_fd2968eda12dd69820f836c504b7ad50.pdf
2015-04-01T11:23:20
2018-12-12T11:23:20
129
138
Linear objective function optimization
Fuzzy relation equations
Fuzzy relation inequalities
max-Lukasiewicz composition
E.
Shivanian
shivanian@sci.ikiu.ac.ir
true
1
Department of Mathematics, Imam Khomeini International University, Qazvin, 34149-16818, Iran.
Department of Mathematics, Imam Khomeini International University, Qazvin, 34149-16818, Iran.
Department of Mathematics, Imam Khomeini International University, Qazvin, 34149-16818, Iran.
LEAD_AUTHOR
ORIGINAL_ARTICLE
A new multi-mode and multi-product hub covering problem: A priority M/M/c queue approach
One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to the transport volume and related traffic, a new priority M/M/c queuing system is considered, in which products with high priority are selected for service ahead of those with low priority. The objectives of this model minimize the total transportation cost and total time. Besides, because of the computational complexity, a multi-objective parallel simulated annealing (MOPSA) algorithm is proposed and some computational experiments are provided to illustrate the efficiency of the presented model and proposed MOPSA algorithm. The performance of this algorithm is compared with two well-known multi-objective evolutionary algorithms, namely non-dominated sorting genetic algorithm (NSGA-II) and Pareto archive evolution strategy (PAES).
http://ijim.srbiau.ac.ir/article_6484_69c2ac76fac791a531d7fd1219697d1f.pdf
2015-04-01T11:23:20
2018-12-12T11:23:20
139
148
Multi-objective hub covering problem
Priority queuing model
Multi modes
Parallel simulated annealing
S.
Sedehzadeh
true
1
School of Industrial Engineering, South Tehran Branch, Islamic Azad University, Tehran, Iran.
School of Industrial Engineering, South Tehran Branch, Islamic Azad University, Tehran, Iran.
School of Industrial Engineering, South Tehran Branch, Islamic Azad University, Tehran, Iran.
AUTHOR
R.
Tavakkoli-Moghaddam
tavakoli@ut.ac.ir
true
2
School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran.
School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran.
School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran.
LEAD_AUTHOR
F.
Jolai
true
3
School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran.
School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran.
School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran.
AUTHOR
ORIGINAL_ARTICLE
Numerical solution of the one dimensional non-linear Burgers equation using the Adomian decomposition method and the comparison between the modified Local Crank-Nicolson method and the VIM exact solution
The Burgersâ€™ equation is a simplified form of the Navier-Stokes equations that very well represents their non-linear features. In this paper, numerical methods of the Adomian decomposition and the Modified Crank â€“ Nicholson, used for solving the one-dimensional Burgersâ€™ equation, have been compared. These numerical methods have also been compared with the analytical method. In contrast to the conventional Crank-Nicolson method, the MLCN method is an explicit and unconditionally stable method. The Adomian decomposition method includes the unknown function U (x), in which each equation is defined and solved by an infinite series of unbounded functions. Velocity parameters u in the direction of the X axis, are examined at different times with different Reynolds numbers over a fixed time step. Also the accuracy of the Adomian and the Crank-Nicolson methods at different Reynolds numbers have been studied using two examples with different initial conditions, and the Adomian decomposition method is closer to the analytical method.
http://ijim.srbiau.ac.ir/article_6485_201632671e6b8ec4e873d5927942c78a.pdf
2015-04-01T11:23:20
2018-12-12T11:23:20
149
159
Non-linear Burgers equation
Adomian method
the modified Local Crank-Nicolson method.
AR.
Haghighi
ah.haghighi@gmail.com
true
1
Department of Mathematics, Urmia University of Technology, Urmia, Iran.
Department of Mathematics, Urmia University of Technology, Urmia, Iran.
Department of Mathematics, Urmia University of Technology, Urmia, Iran.
LEAD_AUTHOR
M.
Shojaeifard
true
2
Department of Mathematics, Urmia University of Technology, Urmia, Iran.
Department of Mathematics, Urmia University of Technology, Urmia, Iran.
Department of Mathematics, Urmia University of Technology, Urmia, Iran.
AUTHOR
ORIGINAL_ARTICLE
A two-stage model for ranking DMUs using DEA/AHP
In this paper, we present a two-stage model for ranking of decision making units (DMUs) using interval analytic hierarchy process (AHP). Since the efficiency score of unity is assigned to the efficient units, we evaluate the efficiency of each DMU by basic DEA models and calculate the weights of the criteria using proposed model. In the first stage, the proposed model evaluates decision making units, and in the second stage it establishes pair-wise comparison matrix then ranks all DMUs by AHP. Finally, a numerical example and an application of the proposed model in 23 universities are provided.
http://ijim.srbiau.ac.ir/article_6486_8bcdc03fb26348aeefcd0cec3b3196ed.pdf
2015-04-01T11:23:20
2018-12-12T11:23:20
161
169
Data envelopment analysis
Analytic hierarchy process
Ranking
T.
Rezaeitaziani
true
1
Department of Mathematics, Islamic Azad University, Bandar Abbas Branch, Bandar Abbas, Iran.
Department of Mathematics, Islamic Azad University, Bandar Abbas Branch, Bandar Abbas, Iran.
Department of Mathematics, Islamic Azad University, Bandar Abbas Branch, Bandar Abbas, Iran.
AUTHOR
M.
Barkhordariahmadi
barkhordarim@yahoo.com
true
2
Department of Mathematics, Islamic Azad University, Bandar Abbas Branch, Bandar Abbas, Iran.
Department of Mathematics, Islamic Azad University, Bandar Abbas Branch, Bandar Abbas, Iran.
Department of Mathematics, Islamic Azad University, Bandar Abbas Branch, Bandar Abbas, Iran.
LEAD_AUTHOR
ORIGINAL_ARTICLE
Barrier options pricing of fractional version of the Black-Scholes model
In this paper two different methods are presented to approximate the solution of the fractional Black-Scholes equation for valuation of barrier option. Also, the two schemes need less computational work in comparison with the traditional methods. In this work, we propose a new generalization of the two-dimensional differential transform method and decomposition method that will extend the application of this methods for pricing barrier options of fractional version of the Black-Scholes model. Undoubtedly this model is the most well known model for pricing financial derivatives. This methods finds the analytical solution without any discretization or additive assumption. the approximate analytic solution is calculated in the form of convergent series with easily computable components, to solve the fractional Black-Scholes equation.
http://ijim.srbiau.ac.ir/article_6543_37ec3f9714f1e9eec7591800a3220d5c.pdf
2015-04-01T11:23:20
2018-12-12T11:23:20
171
178
Fractional Black-Scholes equations
Barrier option pricing problem
Analytical solution
M. A.
Mohebbi Ghandehari
mohammadalimohebbi@yahoo.com
true
1
Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran.
Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran.
Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran.
LEAD_AUTHOR
M.
Ranjbar
true
2
Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran.
Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran.
Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran.
AUTHOR
ORIGINAL_ARTICLE
Positive-additive functional equations in non-Archimedean $C^*$-algebras
Hensel [K. Hensel, Deutsch. Math. Verein, {6} (1897), 83-88.] discovered the $p$-adic number as a number theoretical analogue of power series in complex analysis. Fix a prime number $p$. for any nonzero rational number $x$, there exists a unique integer $n_x \in\mathbb{Z}$ such that $x = \frac{a}{b}p^{n_x}$, where $a$ and $b$ are integers not divisible by $p$. Then $|x|_p := p^{-n_x}$ defines a non-Archimedean norm on $\mathbb{Q}$. The completion of $\mathbb{Q}$ with respect to metric $d(x, y)=|x- y|_p$, which is denoted by $\mathbb{Q}_p$, is called {\it $p$-adic number field}. In fact, $\mathbb{Q}_p$ is the set of all formal series $x = \sum_{k\geq n_x}^{\infty}a_{k}p^{k}$, where $|a_{k}| \le p-1$ are integers. The addition and multiplication between any two elements of $\mathbb{Q}_p$ are defined naturally. The norm $\Big|\sum_{k\geq n_x}^{\infty}a_{k}p^{k}\Big|_p = p^{-n_x}$ is a non-Archimedean norm on $\mathbb{Q}_p$ and it makes $\mathbb{Q}_p$ a locally compact field. In this paper, we consider non-Archimedean $C^*$-algebras and, using the fixed point method, we provide an approximation of the positive-additive functional equations in non-Archimedean $C^*$-algebras.
http://ijim.srbiau.ac.ir/article_6544_d5f01b92870430010c6f0f384321b364.pdf
2015-04-01T11:23:20
2018-12-12T11:23:20
179
185
Functional equation
fixed point
Positive-additive functional equation
Linear mapping
Non-Archimedean $C^*$-algebra
R.
Saadati
rsaadati@iust.ac.ir
true
1
Department of Mathematics, Iran University of Science and Technology, Tehran, Iran.
Department of Mathematics, Iran University of Science and Technology, Tehran, Iran.
Department of Mathematics, Iran University of Science and Technology, Tehran, Iran.
LEAD_AUTHOR
ORIGINAL_ARTICLE
New model for ranking DMUs in DDEA as a special case
The purpose of this paper is to offer the equitable method for ranking Decision Making Units(DMUs) based on the Dynamic Data Envelopment Analysis (DDEA) concept, where quasi-fixed inputs or intermediate products are the source of inter-temporal dependence between consecutive periods. In fact, this paper originally makes the use of an approach extending the ranking of DMUs in DEA by Khodabakhshi and Aryavash into the Dynamic DEA framework. Hence, firstly, we compute minimum and maximum efficiency values of each DMUs in dynamic state, under the assumption that the sum of efficiency values of all DMUs in dynamic state is equal to unity. Thus, with the combination of its minimum and maximum efficiency values, the rank of each DMUs is determined.
http://ijim.srbiau.ac.ir/article_6837_c6d79150d589df55883a7caf2eec0a6a.pdf
2015-04-01T11:23:20
2018-12-12T11:23:20
187
192
Data Envelopment Analysis (DEA)
Decision Making Units(DMU)
Efficiency
Ranking
Dynamic DEA (DDEA).
J.
Pourmahmoud
pourmahmoud@azaruniv.ac.ir
true
1
Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran.
Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran.
Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran.
LEAD_AUTHOR