All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 47 Next

Displaying 921 – 940 of 1566

Showing per page

Numerical solutions of the mass transfer problem

Serge Dubuc, Issa Kagabo (2006)

RAIRO - Operations Research

Let μ and ν be two probability measures on the real line and let c be a lower semicontinuous function on the plane. The mass transfer problem consists in determining a measure ξ whose marginals coincide with μ and ν, and whose total cost ∫∫ c(x,y)dξ(x,y) is minimum. In this paper we present three algorithms to solve numerically this Monge-Kantorovitch problem when the commodity being shipped is one-dimensional and not necessarily confined to a bounded interval. We illustrate these numerical...

On a discrete modified M / G I / c / ∞ queue

Anatolij Dvurečenskij (1987)

Aplikace matematiky

The busy period distribution of a discrete modified queue M / G I / c / ∞ , with finitely or infinitely many severs , and with different distribution functions of customer service times is derived.

On a dual network exterior point simplex type algorithm and its computational behavior

George Geranis, Konstantinos Paparrizos, Angelo Sifaleras (2012)

RAIRO - Operations Research - Recherche Opérationnelle

The minimum cost network flow problem, (MCNFP) constitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex type” category. Similar to the classical dual network simplex algorithm (DNSA), this algorithm starts with a dual feasible tree-solution and after a number of iterations, it produces a solution that is both primal and dual feasible, i.e....

On a dual network exterior point simplex type algorithm and its computational behavior∗

George Geranis, Konstantinos Paparrizos, Angelo Sifaleras (2012)

RAIRO - Operations Research

The minimum cost network flow problem, (MCNFP) constitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex type” category. Similar to the classical dual network simplex algorithm (DNSA), this algorithm starts with a dual feasible tree-solution and after a number of iterations, it produces a...

On a non-Markovian queueing problem under a control operating policy and start-up times

Arun Borthakur, Ruby Gohain (1982)

Aplikace matematiky

A non-Markovian queueing system with Poisson input is studied under a modified operating rule called “control operating policy” in which the server begins “start-up” only when the queue length reaches a fixed number n ( ≥ 1 ) . By using the supplementary variable technique, the distribution of the queue length (excluding those being served) in the form of a generating function is obtained. As a special case, a Markovian queueing system with exponential start-up is discussed in detail to analyse the economic...

Currently displaying 921 – 940 of 1566