A variety of well-known facility location and location-allocation models are shown to be equivalent to, and therefore solvable as, generalized assignment problems (GAP's). (The GAP is a 0-1 programming model in which it is desired to minimize the cost of assigning n tasks to a subset of m...

We present a new interactive algorithm for multiple criteria optimization. The algorithm is of the branch-and-bound type, and differs from previous interactive algorithms in several ways. First, the field of application is wider because it applies to two important classes of multiple criteria...

Public lotteries form an important source of revenue for many national and state governments, but little quantitative effort has been applied to their efficient operation. We here formulate a model in which the net revenue per unit time from the operation of a lottery depends upon the prizes...

Multi-level fixed-charge problems are mathematical optimization problems in which the separable portion of the objective function is the sum of piecewise continuous functions of a single variable. This paper describes a branch-and-bound algorithm that will find a global solution to this type of...

Statistical decision models are formulated for a decision situation involving a decision maker who is a broker, a person engaged in bringing together sellers and buyers to make transactions. The objective of the analysis is the determination of a plan in accordance with the broker's subjective...

We extend a previous algorithm in order to solve mathematical programming problems of the form: Find x = (x₁, ..., x_n) to minimize \sum \varphi _i0(x_i) subject to x \in G, l \leqq x \leqq L and \sum \varphi _ij(x_i) \leqq 0, j = 1, ..., m. Each \varphi _ij is assumed to be lower semicontinuous,...

In this paper we present an algorithm for solving mathematical programming problems of the form: Find x - (x₁,..., x_n) to minimize \sum \varphi _i(x_i) subject to x \in G and l < x < L. Each \varphi _i is assumed to be lower semicontinuous, possibly nonconvex, and G is assumed to be closed. The algorithm is of the...</x>