A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...

in this paper, a multi-product continues review inventory control problem within batch arrival queuing approach (mqr/m/1) is modeled to find the optimal quantities of maximum inventory. the objective function is to minimize summation of ordering, holding and shortage costs under warehouse space, service level, and expected lost-sales shortage cost constraints from retailer and warehouse viewpoi...

in this paper, we consider portfolio selection problem in which security returns are regarded as fuzzy variables rather than random variables. we first introduce a concept of absolute deviation for fuzzy variables and prove some useful properties, which imply that absolute deviation may be used to measure risk well. then we propose two mean-absolute deviation models by defining risk as abs...

in the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. in the second part we discuss some recent developments concurring the simplex algorithm. we describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.

in this paper, the capacitated location-routing problem with fuzzy demands (clrp-fd) is considered. the clrp-fd is composed of two well-known problems: facility location problem and vehicle routing problem. the problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. in clrp-fd, a set of c...

Genetic Algorithm Schema Theory Read/Download A central problem in the theory of genetic algorithms is the characterization of problems Schemas. This note argues this popular approach appears unlikely. Presentation on theme: "Genetic Algorithms IntroductionIntroduction Representing The Schema Theory Can we characterize mathematically the evolution. The schema I envisage is based on the genetic ...

a new class of nonlinear set-valued variationalinclusions involving $(a,eta)$-monotone mappings in a banachspace setting is introduced, and then based on the generalizedresolvent operator technique associated with$(a,eta)$-monotonicity, the existence and approximationsolvability of solutions using an iterative algorithm and fixedpint theory is investigated.