2018
8
4
32
0
A Study on State Dependent Accessible and Second Optional Service Queue with Impatient and Feedback Customers
2
2
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 birthdeath 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.
1

207
216


Vijaya Laxmi
Pikkala
university
university
Iran
vijaya_iit2003@yahoo.co.in


Girija Bhavani
Edadasari
Department of Applied Mathematics, Research Scholar, Andhra University, Visakhapatnam, India
Department of Applied Mathematics, Research
Iran
girijabhavaniedadasari@gmail.com
Queue
First essential service
Second optional service
Reneging
Feedback
Compare Adomian Decomposition Method and Laplace Decomposition Method for Burger'sHuxley and Burger'sFisher equations
2
2
In this paper, Adomian decomposition method (ADM) and Laplace decomposition method (LDM) used to obtain series solutions of BurgersHuxley and BurgersFisher 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.
1

217
226


seyyed mahmood
mirzaei
Islamic Azad University, Minoodasht Branch, Iran
Islamic Azad University, Minoodasht Branch,
Iran
s.mahmoodmirzaei@gmail.com
ADM
LDM
Burger'sHuxley Equation
Burger'sFisher Equation
A stable iteration to the matrix inversion
2
2
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.
1

227
238


Amir
Sadeghi
Department of Mathematics, Robat Karim Branch, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Robat Karim Branch,
Iran
drsadeghi.iau@gmail.com
Matrix inversion
Iterative methods
convergence
Stability
Coupled recursion
Optimal Control of Hand, Foot and Mouth Disease Model using Variational Iteration Method
2
2
In this paper, the optimal control of transmission dynamics of hand, foot and mouth disease (HFMD), formulated by a compartmental deterministic SEIPR (SusceptibleIncubation (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 nonlinear Hamilton equations derived from the Pontryagin's maximum principle theory. These equations constitute a twopoint 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.
1

239
254


Devipriya
Ganeshan
Department of Mathematics,
Stella Maris College,
Chennai  600 086
Department of Mathematics,
Stella Maris
Iran
devipriyaganeshan@gmail.com


L. Jane
Darne
Department of Mathematics,
Stella Maris College,
chennai  600086
Department of Mathematics,
Stella Maris College,
c
Iran
janedarne96@gmail.com
hand
Foot and Mouth Disease
Nonlinear System of Differential Equations
Optimal Control
Variational Iteration Method
Numerical Solution
An Efficient Neurodynamic Scheme for Solving a Class of Nonconvex Nonlinear Optimization Problems
2
2
By ppower (or partial ppower) 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 onetoone 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.
1

255
258


Mohammad
Moghaddas
Department of Mathematics, Central Tehran Branch, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Central Tehran
Iran
moh.moghaddas.sci@iauctb.ac.ir


Ghasem
Tohidi
Department of Mathematics, Central Tehran Branch, Islamic Azad University, Tehran, Iran.
Department of Mathematics, Central Tehran
Iran
gh_tohidi@iauctb.ac.ir
Neural network
Nonconvex optimization
ppower convexification method
NCP function
Lagrangian function
An Approximation Method for Fuzzy FixedCharge Transportation Problem
2
2
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 fixedcharge transportation problem. This method obtains a lower and upper bounds both on the fuzzy optimal value of the fuzzy fixedcharge 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.
1

259
267


Ali
Mahmoodirad
Department of Mathematics, Masjed Soleiman Branch, Islamic Azad University, Masjed Soleiman, Iran
Department of Mathematics, Masjed Soleiman
Iran
alimahmoodirad@gmail.com


Masoud
Sanei
Department of Mathematics, Islamic Azad University, Central Tehran Branch, Iran.
Department of Mathematics, Islamic Azad University
Iran
masoudsanei49@yahoo.com
Fixed charge Transportation problem
fuzzy numbers
Transportation problem
Approximation