We consider a multidimensional extremal problem formulated in terms of tropical mathematics. The problem is to minimize a nonlinear objective function, which is defined on a finite-dimensional semimodule over an idempotent semifield, subject to linear inequality constraints. An efficient solution approach is developed which reduces the problem to that of… (More)
Serial and parallel algorithms for simulation of tandem queueing systems with infinite buffers are presented, and their performance is examined. It is shown that the algorithms which are based on a simple computational procedure involve low time and memory requirements.
A class of queueing networks which may have an arbitrary topology, and consist of single-server fork-join nodes with both infinite and finite buffers is examined to derive a representation of the network dynamics in terms of max-plus algebra. For the networks , we present a common dynamic state equation which relates the departure epochs of customers from… (More)
Multidimensional minimax single facility location problems with Chebyshev distance are examined within the framework of idempotent algebra. A new algebraic solution based on an extremal property of the eigenvalues of irreducible matrices is given. The solution reduces both unconstrained and constrained location problems to evaluation of the eigenvalue and… (More)
A linear vector equation is considered defined in terms of idempotent mathematics. To solve the equation, we apply an approach that is based on the analysis of distances between vectors in idempotent vector spaces and reduces the solution of the equation to that of a tropical optimization problem. Based on the approach, existence and uniqueness conditions… (More)
Max-algebra models of tandem single-server queueing systems with both finite and infinite buffers are developed. The dynamics of each system is described by a linear vector state equation similar to those in the conventional linear systems theory, and it is determined by a transition matrix inherent in the system. The departure epochs of a customer from the… (More)
Simple lower and upper bounds on mean cycle time in stochas-tic acyclic fork-join queueing networks are derived using a (max, +)-algebra based representation of network dynamics. The behaviour of the bounds under various assumptions concerning the service times in the networks is discussed, and related numerical examples are presented .
We consider a constrained minimax single facility location problem on the plane with rectilinear distance. The feasible set of location points is restricted to rectangles with sides oriented at a 45 degrees angle to the axes of Cartesian coordinates. To solve the problem, an algebraic approach based on an extremal property of eigenvalues of irreducible… (More)
A class of queueing networks which consist of single-server fork-join nodes with infinite buffers is examined to derive a representation of the network dynamics in terms of max-plus algebra. For the networks, we present a common dynamic state equation which relates the departure epochs of customers from the network nodes in an explicit vector form… (More)
The problem of evaluation of Lyapunov exponent in queueing network analysis is considered based on models and methods of idem-potent algebra. General existence conditions for Lyapunov exponent to exist in generalized linear stochastic dynamic systems are given, and examples of evaluation of the exponent for systems with matrices of particular types are… (More)