Let A be a nonempty finite subset of the plane representing the geographical coordinates of a set of demand points (towns, …), to be served by a facility, whose location within a given region S is sought. Assuming that the unit cost for a∈A if the facility is located at x∈S is proportional...

Multi-class service systems are of increasing importance in the practical modelling world but present a significant challenge for analysis. Most results to date concerning the optimal dynamic control of such systems have assumed holding cost rates to be linear in the number of customers present....

This paper presents an unifying approach to the theory of degeneracy of basic feasible solutions, vertices, faces, and all subsets of polyhedra. It is a generalization of the usual concept of degeneracy defined for basic feasible solutions of an LP-problem. We use the concept of degeneracy...

We consider the model of cooperative games in which the agents can restrict the communication, because agents are sometimes divided into subgroups in a natural way, for example by their political affinities or by the companies that employ them. More particularly we focus on cooperative games...

A polynomial algorithm is proposed for two scheduling problems for which the complexity status was open. A set of jobs with unit processing times, release dates and outtree precedence relations has to be processed on parallel identical machines such that the total completion time ∑ C <Subscript>j</Subscript> is...</subscript>

The Order-Value Optimization (OVO) problem is a generalization of the classical Minimax problem. Instead of the maximum of a set functions, the functional value that ranks in the p-th place is minimized. The problem seeks the application to (non-pessimistic) decision making and to model fitting...

This note concerns Markov decision chains with finite state and action sets. The decision maker is assumed to be risk-averse with constant risk sensitive coefficient λ, and the performance of a control policy is measured by the risk-sensitive average cost criterion. In their seminal paper...

We consider a switching model for a Markov chain x <Subscript> t </Subscript> with a transition probability p(x|B). The goal of a controller is to maximize the average gain by selecting a sequence of stopping times, in which the controller gets rewards and pays costs (depending on x <Subscript> t </Subscript>) in an alternating order. We...</subscript></subscript>

We consider two locations in tandem of an inventory model, so-called the buffer and the store. The content levels in both locations are controlled simultaneously by transferring inventory from the buffer location to the store location. Under a certain cost function that takes into account the...

The paper is a generalization of [4], [5] for arbitrary distributions of coefficients. It is supposed that the coefficients of the objective function and the constraint of the knapsack problem are independent identically distributed random variables having a density with support [0, 1], and the...