In this paper, the efficient multi-step differential transform method (EMsDTM) is applied to get the accurate approximate solutions for strongly nonlinear duffing oscillator. The main improvement of EMsDTM which is to reduce the number of arithmetic operations, is thoroughly investigated and compared with the classic multi-step differential transform method (MsDTM). To illustrate the applicabil...

Abstract The necessarily optimal solution is known as the most reasonable to linear programming problems with interval/fuzzy objective function coefficients. As it remains against certain fluctuations of coefficients, can be seen a robust solution. In this paper, we demonstrate that necessary optimality degree non-degenerate basic feasible obtained easily by utilizing tolerance approach. evalua...

In the context of information technology, efficient and reliable logistics are a key factor for the economic success of online shops, This necessarily requires an effective way to plan goods delivery to improve efficient and speed, the most important and widely studied combinatorial optimization problems, which continue to draw attention from researchers is the vehicle routing problem, which ca...

We present some complexity results on checking necessary efficiency in interval multiobjective linear programming. Supposing that objective function coefficients perturb within prescribed intervals, a feasible point x is called necessarily efficient if it is efficient for all instances of interval data. We show that the problem of checking necessary efficiency is co-NP-complete even for the cas...

In many occasions, the text describing an algorithmic task may entail a rather intuitive, operational solution scheme. Yet, such a scheme may not necessarily be efficient or correct. Nevertheless, novices demonstrate tendencies to hastily design their solutions that way, and avoid seeking insightful patterns, which may yield better solutions. In this paper, we name and shed light on this theme,...

Estimation of consistent initial conditions is very crucial for the successful solution of differential–algebraic equation (DAE) systems that arise in many fields of science and engineering. In this paper, an efficient perturbation approach for initialization of DAE systems of index-1 is proposed and implemented for DAE models governing batteries. In addition, different existing solvers are com...

Nous pr esentons un algorithme parall ele d eterministe pour la r esolution d'un syst eme d' equations lin eaires Ax = b sur un corps de caract eristique nulle. Cet algorithme s'ex ecute en temps O(log 2 n) et utilise O(M(n)) processeurs arithm etiques si M(n) est le nombre de processeurs requis pour le produit de matrices en temps O(log n). Abstract. We present a deterministic parallel algorit...

We present eecient algorithms for solving Legendre equations over Q (equivalently, for nding rational points on rational conics) and parametriz-ing all solutions. Unlike existing algorithms, no integer factorization is required , provided that the prime factors of the discriminant are known.

In this paper we provide a generalization of Feynmac–Kac formula under volatility uncertainty in presence linear term the PDE due to discounting. We state our result different hypothesis with respect derivation given by Hu et al. (2014), where Lipschitz continuity some functionals is assumed which not necessarily satisfied setting. particular, show that G-conditional expectation discounted payo...