Here‎, ‎we aim to develop a new algorithm for solving a multiobjective linear programming problem‎. ‎The algorithm is to obtain a solution which approximately meets the decision maker's preferences‎. ‎It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution‎. ‎Numerical examples and a simulation study are used to illu...

The identification of hidden conducting permeable objects from measurements the perturbed magnetic field taken over a range low frequencies is important in metal detection. Applications include identifying threat items security screening at transport hubs, location unexploded ordnance, and antipersonnel landmines areas former conflict, searching for archeological significance recycling valuable...

The estimation of the price of different kinds of options plays a very important role in the development of strategies on financial and stock markets. There many books and various papers which are devoted to the exist mathematical theory of option pricing. Merton and Scholes became winners of a Nobel Prize in economy who described the basic concepts of the mathematical theory development. In th...

In this paper, we study a combinatorial problem encountered in monetary systems. The problem concerned is to find an optimal solution R(k, n) of a combinatorial problem for some positive integers k and n. To the authors’ knowledge, there is no efficient solutions for this problem in the literatures so far. We first show how to find an efficient recursive construction algorithm based on the back...

Direct factorization methods for the solution of large, sparse linear systems that arise from PDE discretizations are robust, but typically show poor time and memory scalability for large systems. In this paper, we describe an efficient sparse, rank-structured Cholesky algorithm for solution of the positive definite linear system Ax = b when A comes from a discretized partial-differential equat...