فهرست مطالب

Industrial Mathematics - Volume:10 Issue: 4, Autumn 2018

International Journal of Industrial Mathematics
Volume:10 Issue: 4, Autumn 2018

  • تاریخ انتشار: 1397/09/10
  • تعداد عناوین: 8
|
  • E. Haghi * Pages 315-329
    A three-level relief chain including a number of suppliers in fixed locations, candidate distribution centers and affected areas at certain points are considered. A mixed integer nonlinear programming model is proposed for open transportation location routing problem by considering split delivery of demand. To solve a realistic problem, foregoing parameters are considered as fuzzy in our proposed mode and for the problem of the proposed model, fuzzy multi-objective planning used.
    Keywords: Emergency logistics, location-routing problem, Split delivery, Fuzzy possibilistic programming
  • S. Sadri, M. Rostamy Malkhalifeh *, N. Shoja Pages 331-338
    Undesirable Output such as pollution and waste may occasionally occur in the production process, which should be reduced to improve efficiency. In the present study, cost efficiency model is presented in the presence of undesirable output by Inverse Linear Programming, and the desirable cost is calculated in order to achieve cost efficiency for units that are technically efficient but not cost-‎efficient.‎
    Keywords: Data Envelopment Analysis, Undesirable Output, Cost efficiency, Inverse linear programming
  • A. Ghomashi *, M. Abbasi Pages 339-347
    In this paper we present an improved neural network to solve strictly convex quadratic programming(QP) problem. The proposed model is derived based on a piecewise equation correspond to optimality condition of convex (QP) problem and has a lower structure complexity respect to the other existing neural network model for solving such problems. In theoretical aspect, stability and global convergence of the proposed neural network is proved.
    Keywords: Dynamical system, Strictly convex quadratic programming, stability, Global convergence, Recurrent neural network
  • A. Alvandi, M. Paripour * Pages 349-358
    ‎This paper presents the numerical solution for a class of fractional differential equations. The fractional derivatives are described in the Caputo \cite{1} sense. We developed a reproducing kernel method (RKM) to solve fractional differential equations in reproducing kernel Hilbert space. This method cannot be used directly to solve these equations, so an equivalent transformation is made by using Taylor series. Some numerical examples are studied to demonstrate the accuracy of the given ‎method.‎
    Keywords: Kennel, Reproducing kernel, Fractional differential equation, Taylor series
  • M. Salami *, F. Movahedi Sobhani , M. S. Ghazizadeh Pages 359-374
    Assessment of the electricity market shows that, electricity market data can be considered "big data". this data has been analyzed by both conventional and modern data mining methods. The predicted variables of supply and demand are considered to be the input of a defined multi-objective for predicting electricity price, which is the result of the defined model. This shows the advantage of applying the new algorithms for big data mining.
    Keywords: big data, Electricity price, Electricity market, SVMGA algorithm, Multi-Objectives Model
  • R. Taheri *, A. Tehranien Pages 375-383
    Let $R$ be a commutative ring and $mathbb{A}(R)$ be the set of all ideals with non-zero annihilators. Assume that $mathbb{A}^*(R)=mathbb{A}(R)diagdown {0}$ and $mathbb{F}(R)$ denote the set of all finitely generated ideals of $R$. In this paper, we introduce and investigate the {it finitely generated subgraph} of the annihilating-ideal graph of $R$, denoted by $mathbb{AG}_F(R)$. It is the (undirected) graph with vertices $mathbb{A}_F(R)=mathbb{A}^*(R)cap mathbb{F}(R)$ and two distinct vertices $I$ and $J$ are adjacent if and only if $IJ=(0)$. First, we study some basic properties of $mathbb{AG}_F(R)$. For instance, it is shown that if $R$ is not a domain, then $mathbb{AG}_F(R)$ has ascending chain condition (respectively, descending chain condition) on vertices if and only if $R$ is Noetherian (respectively, Artinian). We characterize all rings for which $mathbb{AG}_F(R)$ is a finite, complete, star or bipartite graph. Next, we study diameter and girth of $mathbb{AG}_F(R)$. It is proved that ${rm diam}(mathbb{AG}_F(R))leqslant {rm diam}(mathbb{AG}(R))$ and ${rm gr}(mathbb{AG}_F(R))={rm gr}(mathbb{AG}(R)).$
    Keywords: Commutative rings, Annihilating-ideal, Finitely generated ideal, Graph
  • A. R. Amirteimoori *, M. Maghbouli Pages 385-395
    Conventional data envelopment analysis (DEA) models normally assume all inputs and outputs are real valued and continuous. However in problems some inputs and outputs can only take integer values, also, both desirable and undesirable outputs can be generated . In this paper the effect of undesirable outputs in integer DEA model is discussed. The proposed model distinguishes weak disposability of outputs imposing non-uniform abatement factor.
    Keywords: Data Envelopment Analysis (DEA), Weak -disposability, Undesirable factors, Integer-valued data
  • V. Ambethkar *, M. Srivastava, A. Chamkha Pages 397-410
    In this paper, we have used a control volume method to investigate the problem of a fully coupled fluid flow with heat transfer in a rectangular domain with slip wall boundary conditions. We have used this method to solve the governing equations and thereby to compute the convective and diffusive fluxes at the cell faces of the control volumes considered around the grid points of computational domain.
    Keywords: Control volume method, Isotherms, Reynolds number, SIMPLE algorithm, Stream lines