ORIGINAL_ARTICLE
A Study on State Dependent Accessible and Second Optional Service Queue with Impatient and Feedback Customers
In this paper, we study a single server Markovian queue with state dependent accessible services, reneging and feedback of customers. The server can accommodate at the most $d$ customers in the service station, after which the new arrivals have to wait in the primary queue of infinite waiting space. All arrivals demand First Essential Service (FES), after completing FES, customers decide to join the second optional Service (SOS) with a probability. The services occur singly according to first come first served service discipline and service times in FES and SOS are exponentially distributed. A customer waiting in the primary queue may get impatient and renege from the queue. However, after completing SOS, if the customer is not satisfied with the service quality, he may join the queue again (feedback). The system is analyzed by a quasi birth-death process and the steady state probabilities of the model are obtained using matrix geometric method. Some performance measures and numerical illustrations are also provided. An optimization of the cost function is performed to find the optimal service rate that minimizes the total cost.
http://ijm2c.iauctb.ac.ir/article_665695_9ceabc31812bc15de9dc8cbf466bff3b.pdf
2018-11-01T11:23:20
2020-04-10T11:23:20
207
216
Queue
First essential service
Second optional service
Reneging
Feedback
Vijaya Laxmi
Pikkala
vijaya_iit2003@yahoo.co.in
true
1
university
university
university
LEAD_AUTHOR
Girija Bhavani
Edadasari
girijabhavaniedadasari@gmail.com
true
2
Department of Applied Mathematics, Research Scholar, Andhra University, Visakhapatnam, India
Department of Applied Mathematics, Research Scholar, Andhra University, Visakhapatnam, India
Department of Applied Mathematics, Research Scholar, Andhra University, Visakhapatnam, India
AUTHOR
ORIGINAL_ARTICLE
Compare Adomian Decomposition Method and Laplace Decomposition Method for Burger's-Huxley and Burger's-Fisher equations
In this paper, Adomian decomposition method (ADM) and Laplace decomposition method (LDM) used to obtain series solutions of Burgers-Huxley and Burgers-Fisher Equations. In ADM the algorithm is illustrated by studying an initial value problem and LDM is based on the application of Laplace transform to nonlinear partial differential equations. In ADM only few terms of the expansion are required to obtain the approximate solution which is found to be accurate and effcient and in LDM does not need linearization, weak nonlinearity assumptions, or perturbation theory. These methods are used to solve the examples and the results are presented in the tables.
http://ijm2c.iauctb.ac.ir/article_663827_70a56f84cd78712c14271bbf1b4d7a53.pdf
2018-11-01T11:23:20
2020-04-10T11:23:20
217
226
ADM
LDM
Burger's-Huxley Equation
Burger's-Fisher Equation
seyyed mahmood
mirzaei
s.mahmoodmirzaei@gmail.com
true
1
Islamic Azad University, Minoodasht Branch, Iran
Islamic Azad University, Minoodasht Branch, Iran
Islamic Azad University, Minoodasht Branch, Iran
LEAD_AUTHOR
ORIGINAL_ARTICLE
A stable iteration to the matrix inversion
The matrix inversion plays a signifcant role in engineering and sciences. Any nonsingular square matrix has a unique inverse which can readily be evaluated via numerical techniques such as direct methods, decomposition scheme, iterative methods, etc. In this research article, first of all an algorithm which has fourth order rate of convergency with conditional stability will be proposed. Then, for solving stability issue, we introduce a coupled stable scheme that can evaluate the matrix inversion with very acceptable accuracy. Furthermore, the convergence and stability properties of the proposed schemes will be analyzed in details. Numerical experiments are adopted to illustrate the properties of the modified methods.
http://ijm2c.iauctb.ac.ir/article_663845_811bb7c7568c5d1de5b205be69721298.pdf
2018-11-01T11:23:20
2020-04-10T11:23:20
227
238
Matrix inversion
Iterative methods
convergence
Stability
Coupled recursion
Amir
Sadeghi
drsadeghi.iau@gmail.com
true
1
Department of Mathematics, Robat Karim Branch, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Robat Karim Branch, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Robat Karim Branch, Islamic Azad University, Tehran, Iran.
LEAD_AUTHOR
ORIGINAL_ARTICLE
Optimal Control of Hand, Foot and Mouth Disease Model using Variational Iteration Method
In this paper, the optimal control of transmission dynamics of hand, foot and mouth disease (HFMD), formulated by a compartmental deterministic SEIPR (Susceptible-Incubation (Exposed)- Infected - Post infection virus shedding - Recovered) model with vaccination and treatment as control parameters is considered. The objective function is based on the combination of minimizing the number of infected individuals and the cost involved in the interventions of vaccination given to the susceptible population and treatment given to the infected population. The existence for the optimal control pair is proved and the characterization of the optimal control pair is obtained by applying the Pontryagin's maximum principle. The variational iteration method is adopted to solve the non-linear Hamilton equations derived from the Pontryagin's maximum principle theory. These equations constitute a two-point boundary value problem. By considering the correction functionals of the Hamilton equations, the Lagrange multipliers are easily identified and practical iteration formulas are derived. An algorithm is developed, based on this formulas, to determine iteratively the solutions of the Hamilton equations with a desired accuracy. With the aid of solutions obtained, the optimal control law can be easily deduced. The results were analyzed and interpreted graphically using Maple.
http://ijm2c.iauctb.ac.ir/article_665696_ddab09654d35f1f3d518aac03de0aa19.pdf
2018-11-01T11:23:20
2020-04-10T11:23:20
239
254
hand
Foot and Mouth Disease
Nonlinear System of Differential Equations
Optimal Control
Variational Iteration Method
Numerical Solution
Devipriya
Ganeshan
devipriyaganeshan@gmail.com
true
1
Department of Mathematics,
Stella Maris College,
Chennai - 600 086
Department of Mathematics,
Stella Maris College,
Chennai - 600 086
Department of Mathematics,
Stella Maris College,
Chennai - 600 086
LEAD_AUTHOR
L. Jane
Darne
janedarne96@gmail.com
true
2
Department of Mathematics,
Stella Maris College,
chennai - 600086
Department of Mathematics,
Stella Maris College,
chennai - 600086
Department of Mathematics,
Stella Maris College,
chennai - 600086
AUTHOR
ORIGINAL_ARTICLE
An Efficient Neurodynamic Scheme for Solving a Class of Nonconvex Nonlinear Optimization Problems
By p-power (or partial p-power) transformation, the Lagrangian function in nonconvex optimization problem becomes locally convex. In this paper, we present a neural network based on an NCP function for solving the nonconvex optimization problem. An important feature of this neural network is the one-to-one correspondence between its equilibria and KKT points of the nonconvex optimization problem. the proposed neural network is proved to be stable and convergent to an optimal solution of the original problem. Finally, an examples is provided to show the applicability of the proposed neural network.
http://ijm2c.iauctb.ac.ir/article_665697_977ba3cdc5b5bd9cdaf3af7c4c341f40.pdf
2018-11-01T11:23:20
2020-04-10T11:23:20
255
258
Neural network
Nonconvex optimization
p-power convexification method
NCP function
Lagrangian function
Mohammad
Moghaddas
moh.moghaddas.sci@iauctb.ac.ir
true
1
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.
LEAD_AUTHOR
Ghasem
Tohidi
gh_tohidi@iauctb.ac.ir
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
ORIGINAL_ARTICLE
An Approximation Method for Fuzzy Fixed-Charge Transportation Problem
In this paper, we develop the fuzzy fixed charge transportation problem when the costs are the fuzzy numbers. The first step it transform into the classical fuzzy transportation problem. The next, we obtain the best approximation fuzzy on the optimal value of the fuzzy fixed-charge transportation problem. This method obtains a lower and upper bounds both on the fuzzy optimal value of the fuzzy fixed-charge transportation problem which can be easily obtained by using the approximation solution. Finally, the results of this paper have been illustrated by a numerical example.
http://ijm2c.iauctb.ac.ir/article_663826_f63821306187d9661694012a0790cf2d.pdf
2018-11-01T11:23:20
2020-04-10T11:23:20
259
267
Fixed charge Transportation problem
fuzzy numbers
Transportation problem
Approximation
Ali
Mahmoodirad
alimahmoodirad@gmail.com
true
1
Department of Mathematics, Masjed- Soleiman Branch, Islamic Azad University, Masjed -Soleiman, Iran
Department of Mathematics, Masjed- Soleiman Branch, Islamic Azad University, Masjed -Soleiman, Iran
Department of Mathematics, Masjed- Soleiman Branch, Islamic Azad University, Masjed -Soleiman, Iran
LEAD_AUTHOR
Masoud
Sanei
masoudsanei49@yahoo.com
true
2
Department of Mathematics, Islamic Azad University, Central Tehran Branch, Iran.
Department of Mathematics, Islamic Azad University, Central Tehran Branch, Iran.
Department of Mathematics, Islamic Azad University, Central Tehran Branch, Iran.
AUTHOR