In this paper we consider a loss system where the arrivals can be classified into different groups according to their arrival rate and expected service time. While the standard admission policy consists of rejecting only those customers who arrive when all servers are busy, we address the...

We present an algorithm for solving the Weber problem when the set of feasible locations is the union of a finite number of convex polygons.

A major problem in foundries is to select scrap alloys and pure metals in order to produce at minimum cost alloy of specified composition. We show that such problems, of realistic size, can be solved optimally by mixed-integer programming. Constraints are that the content of the alloys in...

The pooling problem, which is fundamental to the petroleum industry, describes a situation in which products possessing different attribute qualities are mixed in a series of pools in such a way that the attribute qualities of the blended products of the end pools must satisfy given...

Given a spatial system of clients' demand functions, this paper proposes solution methods to determine the price(s), the number, the locations, the sizes, and the market areas of the plants supplying the clients in order to maximize the profit of the firm. Three alternative spatial price...