Search

Highlights • The new algorithm is the second-order accurate, unconditionally stable (L-stable) and self-starting. • The new algorithm shares the identical effective stiffness matrices inside two sub-steps. • The new method does not involve any artificial parameters and additional variable, such as the Lagrange multipliers. • The new scheme achieves the same numerical properties as the Bathe algorithm, but requires less matrix-vector operations. Abstract This paper presents a new composite sub-steps algorithm for solving reliable numerical responses in structural dynamics. The newly developed algorithm is a two sub-steps, second-order accurate and unconditionally stable implicit algorithm with the same numerical properties as the Bathe algorithm. The detailed analysis of the stability and numerical accuracy is presented for the new algorithm, which shows that its numerical characteristics are identical to those of the Bathe algorithm. Hence, the new sub-steps scheme could be considered as an alternative to the Bathe algorithm. Meanwhile, the new algorithm possesses the following properties: (a) it produces the same accurate solutions as the Bathe algorithm for solving linear and nonlinear problems; (b) it does not involve any artificial parameters and additional variables, such as the Lagrange multipliers; (c) The identical effective stiffness matrices can be obtained inside two sub-steps; (d) it is a self-starting algorithm. Some numerical experiments are given to show the superiority of the new algorithm and the Bathe algorithm over the dissipative CH- α algorithm and the non-dissipative trapezoidal rule. [ABSTRACT FROM AUTHOR]

In this paper, we significantly extend the applicability of state-of-the-art ELDP (equations for linearizing discrete product terms) method by providing a new linearization to handle more complicated non-linear terms involving both of discrete and bounded continuous variables. A general class of “representable programming problems” is formally proposed for a much wider range of engineering applications. Moreover, by exploiting the logarithmic feature embedded in the discrete structure, we present an enhanced linear reformulation model which requires half an order fewer equations than the original ELDP. Computational experiments on various engineering design problems support the superior computational efficiency of the proposed linearization reformulation in solving engineering optimization problems with discrete and bounded continuous variables. [ABSTRACT FROM AUTHOR]

Surrogate-models have proven to be an effective strategy for structural systems with expensive-to-evaluate simulations and are very useful for structural reliability analysis. Many kriging model based adaptive sequential sampling methods have been developed recently for efficient reliability analysis. In this paper, a new learning function based on cross-validation is proposed as the guideline to adaptively select new training points at each iteration for reliability analysis. The epistemic uncertainty of the surrogate models and the effects of the aleatory uncertainty of the random variables are considered simultaneously in the proposed new learning function. Three goals can be achieved using the proposed new learning function, i.e., most of the selected new training sample points (1) are selected from the desired regions to improve computational efficiency; (2) reside around the limit-sate functions and in the regions with high reliability sensitivity; and (3) tend to be far away from existing training points in the current design to avoid the clustering problem. The proposed learning function is partly linked to the probability of failure. The proposed method is easy to code and understand as well as implement. Five numerical examples are finally used to validate the accuracy and efficiency as well as applicability of the proposed method. [ABSTRACT FROM AUTHOR]

Abstract: New modified open Newton Cotes integrators are introduced in this paper. For the new proposed integrators the connection between these new algorithms, differential methods and symplectic integrators is studied. Much research has been done on one step symplectic integrators and several of them have obtained based on symplectic geometry. However, the research on multistep symplectic integrators is very poor. Zhu et al. [1] studied the well known open Newton Cotes differential methods and they presented them as multilayer symplectic integrators. Chiou and Wu [2] studied the development of multistep symplectic integrators based on the open Newton Cotes integration methods. In this paper we introduce a new open modified numerical method of Newton Cotes type and we present it as symplectic multilayer structure. The new obtained symplectic schemes are applied for the solution of Hamilton’s equations of motion which are linear in position and momentum. An important remark is that the Hamiltonian energy of the system remains almost constant as integration proceeds. We have applied also efficiently the new proposed method to a nonlinear orbital problem and an almost periodic orbital problem. [Copyright &y& Elsevier]

Abstract: This paper proposes a sequential approach to determine the unknown parameters for inverse heat conduction problems which have multiple time-dependent heat sources. There are two main aims in this study, one is to derive an inverse algorithm that can estimate the unknown conditions effectively, and the other is to bring up a theoretical sensitivity analysis to discuss what causes the growth of errors. This paper has three major achievements with regard to the literature on IHCPs, as follows: (1) proposing an efficient sequential inverse algorithm that can simultaneously determine several unknown time-dependent parameters; (2) exploring why the sequential function specification method can provide a stable but inaccurate estimation when tackling problems with larger measurement errors; and (3) discussing the sensitivity problem and analyzing what factors cause the growth in error sensitivity. Three examples are applied to demonstrate the performance of the proposed method, and the numerical results show that the accurate estimations can be obtained by alleviating the error sensitivity when the measurement error is considered. [Copyright &y& Elsevier]

Abstract: Previous studies in the issue of inventory models with imperfect quality assumed the defectives could be sold in a batch by the end of the inspection process and the manufacturing systems were push systems. However, the above assumptions may not be true in the pull system in which buyer is powerful. Therefore, in this paper, we develop a new inventory model for items with imperfect quality and quantity discounts where buyer has exerted power over its supplier. Based on the concept of powerful buyer, there are three considerations included in this new model: (1) the order quantity is manufactured at one setup and is shipped over multiple deliveries, (2) the defectives are screened out by a 100% inspection for each shipment but sold in a batch by the end of inspection at the last shipment of each cycle, and (3) the supplier offers quantity discounts to response the request of the powerful buyer. Further, an algorithm is developed to help the powerful buyer to determine the optimal order policy accurately and quickly. Two numerical examples are available in this paper to illustrate the proposed model and algorithm. Besides, based on the numerical examples, a sensitivity analysis is made to investigate the effects of four important parameters (the inspection rate, the defective rate, the receiving cost, and the ordering cost) on the optimal solution. [Copyright &y& Elsevier]

The aim of this paper is to establish the existence, uniqueness and asymptotic behaviour of a strong regular solution for a class of nonlinear equations of reaction–diffusion nonlocal type with moving boundaries: u t - a ∫ Ω t u ( x , t ) dx u xx = f ( x , t ) , ( x , t ) ∈ Q t , u ( α ( t ) , t ) = u ( β ( t ) , t ) = 0 , t > 0 , u ( x , 0 ) = u 0 ( x ) , x ∈ Ω 0 = ] α ( 0 ) , β ( 0 ) [ , where Q t is a bounded non-cylindrical domain defined by Q t = ( x , t ) ∈ R 2 : α ( t ) < x < β ( t ) , for all 0 < t < T . Moreover, we study the properties of the solution and implement a numerical algorithm based on the Moving Finite Element Method (MFEM) with polynomial approximations of any degree, to solve this class of problems. Some numerical tests are investigated to evaluate the performance of our Matlab code based on the MFEM and illustrate the exponential decay of the solution. [ABSTRACT FROM AUTHOR]

In this paper, a new numerical algorithm to solve the linear and nonlinear fractional differential equations (FDE) is introduced. Fractional calculus and fractional differential equations have many applications in physics, chemistry, engineering, finance, and other sciences. The proposed approach is based on the first kind of Bessel functions collocation method. The first kind of Bessel function is an infinite series, which is convergent for any x ∈ R. In this method, we reduce the solution of a nonlinear fractional problem to the solution of a system of the nonlinear algebraic equations. To illustrate the reliability of this method, we solve some important equations of fractional order, and present numerical results of the present method to show convergence rate, applicability and reliability of this method. [ABSTRACT FROM AUTHOR]

Abstract: Group decision making through the AHP has received significant attention in contemporary research, the primary focus of which has been on the issues of consistency and consensus building. In this paper, we concentrate on the latter and present a two-phase algorithm based on the optimal clustering of decision makers (members of a group) into sub groups followed by consensus building both within sub groups and between sub groups. Two-dimensional Sammon’s mapping is proposed as a tool for generating an approximate visualization of sub groups identified in multidimensional vector space, while the consensus convergence model is suggested for reaching agreement amongst individuals in and between sub groups. As a given, all decision makers evaluate the same decision elements within the AHP framework and produce individual scores of these decision elements. The consensual scores are obtained through the iterative procedure and the final scores are declared as the group decision. The results of two selected numerical examples are compared with two sets of results: the results obtained by the commonly used geometric mean aggregation method and also the results obtained if the consensus convergence model is applied directly without the prior clustering of the decision makers. The comparisons indicated the expected differences among the aggregation schemes and the final group scores. The matrices of respect values in the consensus convergence model, obtained for cases when the decision makers are optimally clustered and when they are not, show that in the latter case the decision makers receive lower weights of respect from other members in the group. Various tests showed that our approach is efficient in cases when no clusters can be visually and undoubtedly identified, especially if the number of group members is high. [Copyright &y& Elsevier]

Abstract: This paper proposes an approach for deriving the priority vector from an inconsistent pair-wise comparison matrix through the nearest consistent matrix and experts judgments, which enables balancing the consistency and experts judgments. The developed algorithm for achieving a nearest consistent matrix is based on a logarithmic transformation of the pair-wise comparison matrix, and follows an iterative feedback process that identifies an acceptable level of consistency while complying with experts preferences. Three numerical examples are examined to illustrate applications and advantages of the developed approach. [Copyright &y& Elsevier]

Abstract: We revisit in this paper the theory of axisymmetric vortex rings in an ideal fluid. The boundary separating the vortex ring from the external (potential) flow is assumed of elliptic shape. For a given distribution of vorticity in the vortex core, we theoretically put into evidence the critical parameter for the existence of non-trivial solutions, thus confirming the numerical observation of Durst et al. [ZAMP 32 (1981) 156]. A sharp estimation of the critical threshold is analytically derived. Theoretical predictions are confirmed by numerical simulations using finite elements. A new numerical algorithm is presented and shown to display better performances compared to previous published algorithms using finite differences. The convergence of the iterative algorithm is proved using the theory of elliptic partial differential equations with discontinuous nonlinearities. [Copyright &y& Elsevier]

Abstract: Price-dependence is an important characteristic for some inventory problems. This paper proposes a newsvendor model with fuzzy price-dependent demand, and discusses the conditions to determine the optimal pricing and inventory decisions jointly so that the expected profit could be maximized. Then an algorithm combining the method of ranking fuzzy numbers is developed to tackle the problem. Furthermore, comparison is made between the fuzzy model and the deterministic model to study the effect of the uncertain price-dependent demand, and the sensitivity properties of the joint optimal decisions are illustrated through numerical examples. [Copyright &y& Elsevier]

Abstract: This paper concerns mathematical and numerical modeling of thermal phenomena accompanying single laser and laser-arc hybrid butt welding of steel sheets. Coupled heat transfer and fluid flow in the fusion zone were described respectively by transient heat transfer equation and Navier–Stokes equation. Laser beam and electric arc heat sources were modeled using different heat source power distributions. Latent heat associated with the material’s state changes, buoyancy forces and liquid material flow through a porous medium were taken into account in considerations. Differential governing equations were numerically solved using projection method combined with finite volume method. Elaborated solution algorithm was implemented into computer solver used for simulation of heat transfer and fluid flow during welding. The geometry of the weld and heat affected zone as well as cooling rates were estimated on the basis of numerically obtained temperature field. [Copyright &y& Elsevier]

Abstract: Model updating should be correlated with experimental data to ensure that it models the dynamics of the real structure and the updated model predicts the dynamics of a structure more accurately. Considering that the iterative methods for model updating have aroused little public attention, this paper studies an iterative algorithm for quadratic model updating problems which can incorporate the measured modal data into the finite element model to produce an adjusted finite element model on the mass, gyroscopic and stiffness matrices that closely match the experimental modal data. By this method, the best approximation symmetric and skew-symmetric solutions can be obtained by choosing a convergence factor. Numerical example shows that the introduced iterative algorithm is quite efficient. [Copyright &y& Elsevier]

Abstract: Diffusion wave equation describes the flood wave propagation which is used in solving overland and open channel flow problems. Therefore, it is important to understand and solve the diffusion wave equations accurately. For this purpose, researchers have previously developed several analytical and numerical methods for the solution of the partial differential equation of diffusion waves. The solution derived by Kazezyılmaz-Alhan and Medina (2007) can be used to solve overland flow problems during rainfall events with both constant and variable rainfall intensity, and with constant hydraulic diffusivity and wave celerity. In this paper, this method is improved by employing the De Hoog algorithm instead of Stehfest algorithm for Laplace inversion and adapting the solution to variable hydraulic diffusivity and wave celerity. In addition, the performances of the Stehfest and the De Hoog algorithms are compared. Synthetic examples are solved by using both Stehfest and De Hoog algorithms incorporated into the existing analytical solution to present the accuracy of the De Hoog algorithm over the Stehfest algorithm. The examples are also solved by using the new method in order to demonstrate the improvement over the existing method. [Copyright &y& Elsevier]

Abstract: In this paper, an inexact secant algorithm in association with nonmonotone technique and filter is proposed for solving the large scale nonlinear systems of equalities and inequalities. The systems are transformed into a continuous constrained optimization solved by inexact secant algorithm. Global convergence of the proposed algorithm is established under the reasonable conditions. Numerical results validate the effectiveness of our approach. [Copyright &y& Elsevier]

Abstract: This paper proposes analytical Fourier series solutions (based on the Airy stress function) for the local deflection and subsurface stress field of a two-dimensional graded elastic solid loaded by a pre-determined pressure distribution. We present a selection of numerical results for a simple sinusoidal pressure which indicates how the inhomogeneity of the solid affects its behaviour. The model is then adapted and used to derive an iterative algorithm which may be used to solve for the contact half width and pressure induced from contact with a rigid punch. Finally, the contact of a rigid cylindrical stamp is studied and our results compared to those predicted by Hertzian theory. It is found that solids with a slowly varying elastic modulus produce results in good agreement with those of Hertz whilst more quickly varying elastic moduli which correspond to solids that become stiffer below the surface give rise to larger maximum pressures and stresses whilst the contact pressure is found to act over a smaller area. [Copyright &y& Elsevier]

Abstract: Quadratic knapsack problem has a central role in integer and nonlinear optimization, which has been intensively studied due to its immediate applications in many fields and theoretical reasons. Although quadratic knapsack problem can be solved using traditional nonlinear optimization methods, specialized algorithms are much faster and more reliable than the nonlinear programming solvers. In this paper, we study a mixed linear and quadratic knapsack with a convex separable objective function subject to a single linear constraint and box constraints. We investigate the structural properties of the studied problem, and develop a simple method for solving the continuous version of the problem based on bi-section search, and then we present heuristics for solving the integer version of the problem. Numerical experiments are conducted to show the effectiveness of the proposed solution methods by comparing our methods with some state of the art linear and quadratic convex solvers. [Copyright &y& Elsevier]

Abstract: This paper considers parameter identification problems for a fermentation process. Since the fermentation process is nonlinear, it is difficult to use a single-model for describing such a process and thus we use the multiple model technique to study the identification methods. The basic idea is to establish the model of the fermentation process at each operation point by means of the least squares principle, to obtain multiple models with different points, and then use the weighting functions or interpolation methods to compute the total model or the global model. Finally, a numerical example is provided to test the effectiveness of the proposed algorithm. [Copyright &y& Elsevier]

Abstract: Implementing efficient inspection policies is much important for the organizations to reduce quality related costs. In this paper, a particle swarm optimization (PSO) algorithm is proposed to determine the optimal inspection policy in serial multi-stage processes. The policy consists of three decision parameters to be optimized; i.e. the stages in which inspection occurs, tolerance of inspection, and size of sample to inspect. Total inspection cost is adopted as the performance measure of the algorithm. A numerical example is investigated in two phases, i.e. fixed sample size and sample size as a decision parameter, to ensure the practicality and validity of the proposed PSO algorithm. It is shown that PSO gives better results in comparison with two other algorithms proposed by earlier works. [Copyright &y& Elsevier]

Abstract: This paper considers bi-criteria scheduling on a single parallel-batch machine to minimizing two regular scheduling criteria that are non-decreasing in the job completion times. For minimizing the total weighted completion time and the makespan simultaneously, we prove that the problem is NP-hard in the ordinary sense and possesses a fully polynomial-time approximation scheme. For minimizing the weighted total number of tardy jobs and the makespan simultaneously, we provide a pseudo-polynomial-time algorithm and a fully polynomial-time approximation scheme. Furthermore, we identify that all Pareto-optimal solutions for and can be found in pseudo-polynomial time, respectively. [Copyright &y& Elsevier]

Abstract: In this paper, a modified Holling–Tanner predator–prey model with time delay is considered. By regarding the delay as the bifurcation parameter, the local asymptotic stability of the positive equilibrium is investigated. Meanwhile, we find that the system can also undergo a Hopf bifurcation of nonconstant periodic solution at the positive equilibrium when the delay crosses through a sequence of critical values. In particular, we study the direction of Hopf bifurcation and the stability of bifurcated periodic solutions, an explicit algorithm is given by applying the normal form theory and the center manifold reduction for functional differential equations. Finally, numerical simulations supporting the theoretical analysis are also included. [Copyright &y& Elsevier]

Abstract: This paper is concerned with the shape reconstruction of a bounded domain with a viscous incompressible fluid driven by the Oseen equations. For the approximate solution of the ill-posed and nonlinear problem we propose a regularized Gauss–Newton method. A theoretical foundation for the method is given by establishing the differentiability of the boundary value problem with respect to the boundary in the sense of the domain derivative. The results of several numerical experiments show that our theory is useful for practical purpose, and the proposed algorithm is feasible. [Copyright &y& Elsevier]

Abstract: The FVM–LES-acoustic analogy method (FVM–LES-AAM), which is a hybrid prediction technique for the acoustical property computation, is presented and performed in this paper. The FVM–LES-AAM was developed by combining the finite volume method (FVM), the large eddy simulation (LES), and the Ffowcs Williams-Hawkings analogy algorithm (FWH-AA). To predict the acoustical properties of induction cookers, the FVM is used for discretizing the calculation field and building numerical equations, and the LES and FWH-AA are performed for computing the sound sources and predicting the far-field sound, respectively. Using the FVM with the unstructured grids method to discretize the control equation of Navier–Stokes was introduced for illuminating the above numerical simulation procedure. To prove the FVM–LES-AAM method is feasible for predicting the acoustical property of induction cookers, the simulated results were compared with some measured experimental data. The comparisons suggest that the hybrid method is accurate and reliable for the aeroacoustics analysis of induction cookers. Considering the temperature performance, furthermore, some new configurations for the noise reduction of induction cookers were designed, simulated, and discussed. The FVM–LES-AAM prediction technique shows promise as a feasible and computationally affordable approach for not only noise analysis of induction cookers, but also for other aeroacoustics problems in engineering. [Copyright &y& Elsevier]

Abstract: In view of the simplex-type algorithm, the assignment problem is inherently highly degenerate. It may be the optimal basis has changed, but the optimal assignment is unchanged when parameter variation occurs. Degeneracy then makes sensitivity analysis difficult, as well as makes the classical Type I range, which identifies the range the optimal basis unchanged, impractical. In this paper, a labeling algorithm is proposed to identify two other sensitivity ranges – Type II range and Type III range. The algorithm uses the reduced cost matrix, provided in the final results of most solution algorithms for AP, to determine the Type II range which reflects the stability of the current optimal assignment. Thus, the algorithm generates a streamlined situation from searching the optimal solution until performing the sensitivity analysis of the assignment problem. The Type III range, reflecting the flexibility of optimal decision making, can be obtained immediately after the Type II range is determined. Numerical examples are presented to demonstrate the algorithm. [Copyright &y& Elsevier]

Abstract: The multiple attribute group decision making (MAGDM) problem with intuitionistic fuzzy information investigated in this paper is very useful for solving complicated decision problems under uncertain circumstances. Since experts have their own characteristics, they are familiar with some of the attributes, but not others, the weights of the decision makers to different attributes should be different. We derive the weights of the decision makers by aggregating the individual intuitionistic fuzzy decision matrices into a collective intuitionistic fuzzy decision matrix. The expert has a big weight if his evaluation value is close to the mean value and has a small weight if his evaluation value is far from the mean value. For the incomplete attribute weight information, we establish some optimization models to determine the attribute weights. Furthermore, we develop several algorithms for ranking alternatives under different situations, and then extend the developed models and algorithms to the MAGDM problem with interval-valued intuitionistic fuzzy information. Numerical results finally illustrate the practicality and efficiency of our new algorithms. [Copyright &y& Elsevier]

Abstract: This paper presents a non-homogeneous age-usage semi-Markov model with a measurable state space. Several probability functions useful to assess the system’s reliability are investigated. They satisfy the same family of equations we call indexed Markov renewal equations. Sufficient conditions to assure the existence and uniqueness of their solutions are provided. The numerical analysis of these equations is executed through the construction of a process discrete in time and space, which is shown to converge to the continuous one in the Skorohod topology. An algorithm useful for solving the discretized system of equations is presented by using a matrix representation. [Copyright &y& Elsevier]

Abstract: In this paper, an active set limited BFGS algorithm is proposed for bound constrained optimization. The global convergence will be established under some suitable conditions. Numerical results show that the given method is effective. [Copyright &y& Elsevier]

Abstract: This paper is concerned with new algorithms which provide the sharp bounds that are guaranteed to contain the exact solutions of nonlinear Volterra integral equations. We develop new enclosure algorithms based on the interval methods which was first introduced by Moore in together with the Taylor polynomials to improve the accuracy of the scheme by reducing the width of interval solutions. The modified methods calculate a priori bound automatically in parallel with the computation of solutions of integral equations. We will show that the accuracy of the proposed algorithms is dependent on the number of interval subdivisions. Some numerical experiments are also included to demonstrate the validity and applicability of the scheme and showing a marked improvement in comparison with the recent existing numerical results. [Copyright &y& Elsevier]

Abstract: The consecutive k-out-of-r-from-n: F system was generalized to multi-state case. This system consists of n linearly ordered components which are at state below j if and only if at least k j components out of any r consecutive are in state below j. In this paper we suggest bounds of increasing multi-state consecutive-k-out-of-r-from-n: F system (k 1 ⩽ k 2 ⩽⋯⩽ k M ) by applying second order Boole–Bonferroni bounds and applying Hunter–Worsley upper bound. Also numerical results are given. The programs in V.B.6 of the algorithms are available upon request from the authors. [ABSTRACT FROM AUTHOR]

Abstract: This paper considers an infinite-capacity M/M/c queueing system with modified Bernoulli vacation under a single vacation policy. At each service completion of a server, the server may go for a vacation or may continue to serve the next customer, if any in the queue. The system is analyzed as a quasi-birth-and-death (QBD) process and the necessary and sufficient condition of system equilibrium is obtained. The explicit closed-form of the rate matrix is derived and the useful formula for computing stationary probabilities is developed by using matrix analytic approach. System performance measures are explicitly developed in terms of computable forms. A cost model is derived to determine the optimal values of the number of servers, service rate and vacation rate simultaneously at the minimum total expected cost per unit time. Illustrative numerical examples demonstrate the optimization approach as well as the effect of various parameters on system performance measures. [ABSTRACT FROM AUTHOR]

Abstract: Finite source retrial G-queues are good mathematical models of communication systems and networks, so their investigation is important for theory and applications. In this paper, we analyze the MAP/PH/N retrial queue with finite number of sources and MAP arrivals of negative customers operating in a finite state Markovian random environment. The arrival of a negative customer with equal probability goes to any busy server to remove the customer being in service. The multi-dimensional Markov chain describing the behavior of the system is investigated. The algorithms for calculating the stationary state probabilities are elaborated. Main performance measures are obtained. Illustrative numerical examples are presented. [ABSTRACT FROM AUTHOR]

Abstract: This paper is concerned with solutions to the so-called coupled Sylveter-conjugate matrix equations, which include the generalized Sylvester matrix equation and coupled Lyapunov matrix equation as special cases. An iterative algorithm is constructed to solve this kind of matrix equations. By using the proposed algorithm, the existence of a solution to a coupled Sylvester-conjugate matrix equation can be determined automatically. When the considered matrix equation is consistent, it is proven by using a real inner product in complex matrix spaces as a tool that a solution can be obtained within finite iteration steps for any initial values in the absence of round-off errors. Another feature of the proposed algorithm is that it can be implemented by using original coefficient matrices, and does not require to transform the coefficient matrices into any canonical forms. The algorithm is also generalized to solve a more general case. Two numerical examples are given to illustrate the effectiveness of the proposed methods. [ABSTRACT FROM AUTHOR]

Abstract: This paper presents a new approach to boundary extraction. We represent the object boundary by a level set model that is embedded in several scalar functions. The motion of the dynamic interface is governed by a p-Laplace equation. Such level set models are flexible in handling complex topological changes and are concise in extracting object boundaries despite of deep depression. Furthermore, a relatively smooth evolution can be maintained without re-initialization. The cost of this method is moderate. The accuracy and efficiency of the proposed algorithm are illustrated by several numerical examples. [Copyright &y& Elsevier]

Abstract: In this paper, two new algorithms are presented to solve multi-level multi-objective linear programming (ML-MOLP) problems through the fuzzy goal programming (FGP) approach. The membership functions for the defined fuzzy goals of all objective functions at all levels are developed in the model formulation of the problem; so also are the membership functions for vectors of fuzzy goals of the decision variables, controlled by decision makers at the top levels. Then the fuzzy goal programming approach is used to achieve the highest degree of each of the membership goals by minimizing their deviational variables and thereby obtain the most satisfactory solution for all decision makers. The first suggested algorithm groups the membership functions for the defined fuzzy goals of the objective functions at all levels and the decision variables for each level except the lower level of the multi-level problem. The second proposed algorithm lexicographically solves MOLP problems of the ML-MOLP problem by taking into consideration the decisions of the MOLP problems for the upper levels. An illustrative numerical example is given to demonstrate the algorithms. [Copyright &y& Elsevier]

Abstract: In this paper, a new feasible primal–dual interior point algorithm for solving inequality constrained optimization problems is presented. At each iteration, the algorithm solves only two or three reduced systems of linear equations with the same coefficient matrix. The searching direction is feasible and the object function is monotone decreasing. The proposed algorithm is proved to possess global and superlinear convergence under mild conditions. Finally, some numerical experiments with the algorithm are reported. [Copyright &y& Elsevier]

Abstract: This study discusses a mixture inventory model with back orders and lost sales in which the order quantity, reorder point, lead time and setup cost are decision variables. It is assumed that an arrival order lot may contain some defective items and the number of defective items is a random variable. There are two inventory models proposed in this paper, one with normally distributed demand and another with distribution free demand. Finally we develop two computational algorithms to obtain the optimal ordering policy. A computer code using the software Matlab is developed to derive the optimal solution and present numerical examples to illustrate the models. Additionally, sensitivity analysis is conducted with respect to the various system parameters. [Copyright &y& Elsevier]

Abstract: In this paper, we consider the age-structured model of a single species living in two identical patches derived in So et al. [J.W.-H. So, J. Wu, X. Zou, Structured population on two patches: modeling dispersal and delay, J. Math. Biol. 43 (2001) 37–51]. We chose a birth function that is frequently used but different from the one used in So et al. which leads to a different structure of the homogeneous equilibria. We investigate the stability of these equilibria and Hopf bifurcations by analyzing the distribution of the roots of associated characteristic equation. By the theory of normal form and center manifold, an explicit algorithm for determining the direction of the Hopf bifurcation and stability of the bifurcating periodic solutions are derived. Finally, some numerical simulations are carried out for supporting the analytic results. [Copyright &y& Elsevier]

Abstract: This paper investigates some issues in physical modeling of metal inert gas/metal active gas (MIG/MAG) welding process in the short arc mode. In this mode, a metal supply is molten in the arc state and then transferred to the weld pool during the short-circuit state. A hybrid model having two distinct continuous states whose switchings are controlled by two guard conditions is proposed. Due to the complexity of the physical phenomena involved in the welding process, simplifications are used to obtain a model accounting for the main physical contributions but simple enough to yield an efficient, fast and numerically tractable simulator which can be used intensively for evaluating different control strategies. In an attempt to validate the proposed model, different measurements have been made including supply voltage and current sampled synchronously with high speed digital video. In order to extract some relevant quantities representative of the metal transfer from image sequences, an active contour algorithm is developed and tested. The effectiveness of the proposed model in the prediction of major tendencies of a welding process, especially in the arc state, is shown using experimental data. Some limitations of the model during the metal transfer are also stressed and possible remedies are then proposed. [Copyright &y& Elsevier]

Abstract: Back analysis is commonly used in identifying geomechanical parameters based on the monitored displacements. Conventional back analysis method is not capable of recognizing non-linear relationship involving displacements and mechanical parameters effectively. The new intelligent displacement back analysis method proposed in this paper is the combination of support vector machine, particle swarm optimization, and numerical analysis techniques. The non-linear relationship is efficiently represented by support vector machine. Numerical analysis is used to create training and testing samples for recognition of SVMs. Then, a global optimum search on the obtained SVMs by particle swarm optimization can lead to the geomechanical parameters identification effectively. [Copyright &y& Elsevier]

Abstract: The filled function method is an effective approach to find a global minimizer for a general class of nonsmooth programming problems with a closed bounded domain. This paper gives a new definition for the filled function, which overcomes some drawbacks of the previous definition. It proposes a two-parameter filled function and a one-parameter filled function to improve the efficiency of numerical computation. Based on these analyses, two corresponding filled function algorithms are presented. They are global optimization methods which modify the objective function as a filled function, and which find a better local minimizer gradually by optimizing the filled function constructed on the minimizer previously found. Numerical results obtained indicate the efficiency and reliability of the proposed filled function methods. [Copyright &y& Elsevier]

Abstract: This paper deals with a recently proposed algorithm for obtaining all weak efficient and efficient solutions in a multi objective linear programming (MOLP) problem. The algorithm is based on solving some weighted sum problems, and presents an easy and clear solution structure. We first present an example to show that the algorithm may fail when at least one of these weighted sum problems has not a finite optimal solution. Then, the algorithm is modified to overcome this problem. The modified algorithm determines whether an efficient solution exists for a given MOLP and generates the solution set correctly (if exists) without any change in the complexity. [Copyright &y& Elsevier]

Abstract: This paper presents an efficient numerical algorithm for approximate solutions of a fractional population growth model in a closed system. The time-fractional derivative is considered in the Caputo sense. The algorithm is based on Adomian’s decomposition approach and the solutions are calculated in the form of a convergent series with easily computable components. Then the Padé approximants are effectively used in the analysis to capture the essential behavior of the population u(t) of identical individuals. [Copyright &y& Elsevier]

Abstract: In this paper, we consider a regulated logistic growth model. We first consider the linear stability and the existence of a Hopf bifurcation. We show that Hopf bifurcations occur as the delay τ passes through critical values. Then, using the normal form theory and center manifold reduction, we derive the explicit algorithm determining the direction of Hopf bifurcations and the stability of the bifurcating periodic solutions. Finally, numerical simulation results are given to support the theoretical predictions. [Copyright &y& Elsevier]