Many nonlinear programming algorithms utilize a one-dimensional search along directions generated by the algorithm. This paper describes a method for performing this search. The method finds 3 points which bracket the minimum, fits a quadratic through them to yield a fourth point, then fits...

This study focuses on allocation problems that have some of their constraints defined in terms of Leontief input-output matrices, known as Z-matrices. A few properties of these matrices are discussed and then applied to achieve a possible reduction in the dimensionality of the resource...

In this study we derive the order of convergence of some line search techniques based on fitting polynomials; using function values only. It is shown that the order of convergence increases with the degree of the polynomial. If viewed as a sequence, the orders approach the Golden Section Ratio...

This paper extends the static single facility location problem to a model that permits location changes within a planning horizon of r periods. An algorithm is developed to optimize the sequence of locations in order to meet changes in costs, volumes and locations of destinations.

This note deals with the one-dimensional facility location model in which the weights, which can represent either demand volumes or demands and costs combined, are known only probabilistically. The demand points themselves, or at least the "feeder" routes to the demand points, for the facility...

Rejoinder to the previous note (Erlenkotter, D. 1974. Note--Dynamic facility location and simple network models. Management Sci. 20 (9) 1311.).

A dynamic or multiperiod location-allocation formulation is developed from the static problem of locating G facilities among M possible sites to serve N demand points. This dynamic model provides a tool for analyzing tradeoffs among present values of static distribution costs in each period and...

This paper extends recent work on finding the stochastic queue median (SQM) on a network. The SQM is the optimal location of a single mobile server, when idle, who travels to customers in response to requests for service. Customer demands are limited to the nodes of the network and their...

We define a high volume factory to be a connected network of workstations, at which assigned workers process work-in-progress that flows at high rates through the workstations. A high rate usually implies that each worker processes many pieces per hour, enough so that work can be described as a...

A new approach to the solution of the facilities layout problem on the plane is presented in this paper. A simple procedure that can replace the dispersion phase of DISCON is constructed. The result of the new method is a scatter diagram of the facilities on the plane that can be used by...