eng
Science and Research Branch, Islamic Azad University, Tehran, Iran
International Journal of Industrial Mathematics
2008-5621
2008-563X
2014-12-01
6
1
1
17
2244
مقاله پژوهشی
Review of the methods for evaluating congestion in DEA and computing output losses due to congestion
H. Zare Haghighi
zarehaghighi.srbiau@gmail.com
1
M. Khodabakhshi
2
G. R. Jahanshahloo
3
Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran
Department of Mathematics, Faculty of Mathematical Sciences, Shahid Beheshti University, G.C., Tehran, Iran.
Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran
Data Envelopment Analysis (DEA) is a branch of management, concerned with evaluating the performances of homogeneous Decision Making Units (DMUs). The performances of DMUs are affected by the amount of sources that DMUs used. Usually increases in inputs cause increases in outputs. However, there are situations where increase in one or more inputs generate a reduction in one or more outputs. In such situations there is congestion in inputs or production process. In this study, we review the approaches that are available in the DEA literature for evaluating congestion. Also we introduce a model to compute output losses due to congestion. Then, we present the results of the mentioned models on an empirical example and interpret the results.
http://ijim.srbiau.ac.ir/article_2244_b7197ef5ce43b1977455f06be184b523.pdf
Data envelopment analysis
congestion
Inefficiency
Decision Making Unit
eng
Science and Research Branch, Islamic Azad University, Tehran, Iran
International Journal of Industrial Mathematics
2008-5621
2008-563X
2014-12-01
6
1
19
26
2173
مقاله پژوهشی
Solving fully fuzzy linear programming
M. Otadi
mahmoodotadi@yahoo.com
1
Department of Mathematics, Firoozkooh Branch, Islamic Azad University, Firoozkooh, Iran
In this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear programming (abbreviated to FFLP) problems. Also, we employ linear programming (LP) with equality constraints to find a nonegative fuzzy number vector x which satisfies Ax =b, where A is a fuzzy number matrix. Then we investigate the existence of a positive solution of fully fuzzy linear system (FFLS).
http://ijim.srbiau.ac.ir/article_2173_6314de305bf54f155f154476e2ea48a1.pdf
fuzzy sets
Linear Programming
Fully fuzzy linear system
eng
Science and Research Branch, Islamic Azad University, Tehran, Iran
International Journal of Industrial Mathematics
2008-5621
2008-563X
2014-12-01
6
1
27
35
2174
مقاله پژوهشی
Numerical solution of the system of Volterra integral equations of the first kind
A. Armand
atefeh.armand@ymail.com
1
Z. Gouyandeh
2
Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran
Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran
This paper presents a comparison between variational iteration method (VIM) and modfied variational iteration method (MVIM) for approximate solution a system of Volterra integral equation of the first kind. We convert a system of Volterra integral equations to a system of Volterra integro-di®erential equations that use VIM and MVIM to approximate solution of this system and hence obtain an approximation for system of Volterra integral equations. Some examples are given to show the pertinent features of this methods.
http://ijim.srbiau.ac.ir/article_2174_12bb92568aaa8856adac5200c600e283.pdf
Volterra integral equation of the first kind
Variational iteration method
Modified variational iteration method
eng
Science and Research Branch, Islamic Azad University, Tehran, Iran
International Journal of Industrial Mathematics
2008-5621
2008-563X
2014-12-01
6
1
37
40
2177
مقاله پژوهشی
A Random Walk with Exponential Travel Times
R. Kazemi
kazemi@ikiu.ac.ir
1
Department of Statistics, Imam Khomeini International University, Qazvin, Iran
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log N as Np is large.
http://ijim.srbiau.ac.ir/article_2177_c1c3b1dd3edcb3eaff35d8fff1232ae7.pdf
Smallest path
Random Walk
Pure birth process
Random recursive trees
eng
Science and Research Branch, Islamic Azad University, Tehran, Iran
International Journal of Industrial Mathematics
2008-5621
2008-563X
2014-12-01
6
1
41
48
2190
مقاله پژوهشی
Approximate solution of the stochastic Volterra integral equations via expansion method
M. Khodabin
m-khodabin@kiau.ac.ir
1
K. Maleknejad
2
T. Damercheli
3
Department of Mathematics, Karaj Branch, Islamic Azad University, Karaj, Iran
Department of Mathematics, Karaj Branch, Islamic Azad University, Karaj, Iran
Department of Mathematics, Karaj Branch, Islamic Azad University, Karaj, Iran
In this paper, we present an efficient method for determining the solution of the stochastic second kind Volterra integral equations (SVIE) by using the Taylor expansion method. This method transforms the SVIE to a linear stochastic ordinary differential equation which needs specified boundary conditions. For determining boundary conditions, we use the integration technique. This technique gives an approximate simple and closed form solution for the SVIE. Expectation of the approximating process is computed. Some numerical examples are used to illustrate the accuracy of the method.
http://ijim.srbiau.ac.ir/article_2190_7ffd88dd1660182ee8c073da8c329be4.pdf
Taylor series expansion
Stochastic Volterra integral equation
Itˆo integral
eng
Science and Research Branch, Islamic Azad University, Tehran, Iran
International Journal of Industrial Mathematics
2008-5621
2008-563X
2013-12-01
6
1
49
57
2285
مقاله پژوهشی
FGP approach to multi objective quadratic fractional programming problem
K. Lachhwani
kailashclachhwani@yahoo.com
1
Department of Mathematics, Government Engineering College, Bikaner- 334004, India.
Multi objective quadratic fractional programming (MOQFP) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the objective functions is non-zero in the constraint set. In this paper, we extend the procedure as suggested by Lachhwani (Proc. Nat. Acad. Sci. India, 82(4), 317-322) based on fuzzy goal programming approach for the solution of multi objective quadratic fractional programming (MOQFP) problem. The proposed technique is simple, ecient and requires less computational work. In the proposed FGP model formulation, corresponding objectives of equivalent multi objective programming problem are transformed into fuzzy goals membership functions) by means of assigning an aspiration level to each of them and suitable membership function is defined for each objectives. Then achievement of the highest membership value of each of fuzzy goals is formulated by minimizing the sum of negative deviational variables. The proposed methodology is illustrated with numerical example in order to support the proposed methodology.
http://ijim.srbiau.ac.ir/article_2285_c2ceebb88aca066952e9e2992839e04e.pdf
Multiple objective quadratic fractional programming
Fuzzy Goal programming
membership function
Negative deviational variable
eng
Science and Research Branch, Islamic Azad University, Tehran, Iran
International Journal of Industrial Mathematics
2008-5621
2008-563X
2014-01-01
6
1
59
64
2181
مقاله پژوهشی
On edge Co-PI indices
A. Arjomandfar
1
O. Khormali
2
Islamic Azad University, Shahr-e Rey Branch, Tehran, Iran.
Mathematics and Informatics Research Group, ACECR, Tarbiat Modares University, B.O. Box: 14115- 343, Tehran, Iran.
In this paper, at first we mention to some results related to PI and vertex Co-PI indices and then we introduce the edge versions of Co-PI indices. Then, we obtain some properties about these new indices.
http://ijim.srbiau.ac.ir/article_2181_dae253baa149fb463b3f67719b7cb1bb.pdf
Vertex-PI index- Edge-PI indices
Molecular graph
Vertex Co-PI indices
eng
Science and Research Branch, Islamic Azad University, Tehran, Iran
International Journal of Industrial Mathematics
2008-5621
2008-563X
2014-01-01
6
1
65
71
2182
مقاله پژوهشی
Efficiency Measurement in Two-Stage Network Structures Considering Undesirable Outputs
A. Amirteimoori
1
A. Toloie-Eshlaghi
2
M. Homayoonfar
3
Department of mathematics, Islamic Azad University, Rasht branch, Rasht, Iran
Department of Management and Economics, Islamic Azad University, Science and Research Branch, Tehran, Iran
Department of Management and Economics, Islamic Azad University, Science and Research Branch, Tehran, Iran
Since data envelopment analysis (DEA) introduced in 1970s, it has been widely applied to measure the efficiency of a wide variety of production and operation systems. Recently DEA has been extended to examine the efficiency of decision making units (DMUs) with two-stage network structures or processes, where the outputs from the first stage are intermediate measures that make up the inputs of the second stage. Many researchers developed several DEA based models for evaluating the efficiencies of such systems. This paper considers evaluation of the general two-stage network structures, while each stage may produce undesirable output, in addition to desirable ones. The developed model is applied to Green Hen poultry chain in Guilan province, Iran.
http://ijim.srbiau.ac.ir/article_2182_da45b83ac49de238b5061fbb14e99f3b.pdf
Two-Stage Network
Data envelopment analysis
Undesirable output
Efficiency Evaluation
Decision Making Unit
eng
Science and Research Branch, Islamic Azad University, Tehran, Iran
International Journal of Industrial Mathematics
2008-5621
2008-563X
2014-01-01
6
1
73
78
2199
مقاله پژوهشی
Dynamical System and Semi-Hereditarily Hypercyclic Property
K. Jahedi
mjahedi80@yahoo.com
1
Department of Mathematics,
Shiraz Branch, Islamic Azad University, Shiraz, Iran
In this paper we give conditions for a tuple of commutative bounded linear operators which holds in the property of the Hypercyclicity Criterion. We characterize topological transitivity and semi-hereiditarily of a dynamical system given by an n-tuple of operators acting on a separable infinite dimensional Banach space .
http://ijim.srbiau.ac.ir/article_2199_93275ee912c5733e3bf43d73a61d80f9.pdf
Tuple
Hypercyclic vector
Hypercyclicity Criterion
Hereditarily hypercyclicity
Hynamical system
Periodic point
eng
Science and Research Branch, Islamic Azad University, Tehran, Iran
International Journal of Industrial Mathematics
2008-5621
2008-563X
2014-01-01
6
1
79
84
2294
مقاله پژوهشی
Optical properties of silicon nano layers by using Kramers- Kronig method
H. Kangarlou
h.kangarlou@iaurmia.ac.ir
1
Department of Physics, Urmia Branch, Islamic Azad
University, Urmia, Iran.
Silicon thin layers are deposited on glass substrates with the thickness of 103 nm, 147 nm and 197 nm. The layers are produced with electron gun evaporation method under ultra-high vacuum condition. The optical Reectance and the Transmittance of produced layers were measured by using spectrophotometer. The optical functions such as, real and imaginary part of refractive index, real and imaginary part of dielectric constant, real and imaginary part of conductivity, absorption coeficient and optical band gap energy are calculated basing on the Kramers-Kronig relations. The void fractions of the silicon lms are calculated by using Aspnes theorem. The effect of layer thickness on optical properties of silicon thin lms is investigated.
http://ijim.srbiau.ac.ir/article_2294_75cb5018150ff9550efad774b71b6e4b.pdf
Silicon
Optical properties
Kramers-Kronig relations
Thin films