Nikolai K. Krivulin

Learn More
A dynamical system which is described in terms of an idempotent algebra by means of a vector equation with random irreducible matrix is considered. An approach based on approximation of the matrix of the system by means of matrices of simple structure is applied to evaluate bounds on the mean rate of growth of the state vector of the system. The process of(More)
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)
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 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)
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 stochastic 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. Key-Words:(More)