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>

The ´Portfolio Selection Problem´ is traditionally viewed as selecting a mix of investment opportunities that maximizes the expected return subject to a bound on risk. However, in reality, portfolios are made up of a few ´asset classes´ that consist of similar opportunities. The asset...

This paper presents an algorithm for determining the minimum cost schedule of tasks in a critical path network in which task cost-time curves may be concave. A computer program for the case of cost-time curves that are piecewise linear in two segments is described, and a numerical example is...