Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission. JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact
We consider an important class of mathematical programs, in which the vector variable can be partitioned into two subvectors corresponding to independent constraint sets. Necessary and sufficient conditions for optimal solutions are developed, and two approaches for obtaining solutions are reviewed. We present an enumeration approach, reducing the problem to a finite number of subproblems, and show that duality makes the solution of many of the subproblems unnecessary. Next, we develop an alternating approach, wherein the problem is solved for one of the subvectors while the other is held constant, and then the subvector roles are reversed. This procedure is observed to converge to partial optimum solutions. A widely applicable subclass of problems includes a linear program in one of the subvectors. For this subclass a sufficient condition for local optimality is determined. The condition is easily testable and fails to hold, in many cases, only if a better solution is obtained. Also, this condition shows that partial optimum solutions are almost always local optima.
This paper explores the nature of optimal solutions to a plant-location problem on a plane under general distance measures. It develops conditions that guarantee an optimal location of a facility to lie in the convex hull of source and destination points. The effect of restricting the solution to some predetermined set is explored. The development is based on a generalization of Kuhn's characterization of a convex hull by dominance. When a “Manhattan” norm is employed, it is shown to be sufficient to consider, as optimal locations, the finite number of “intersection points” in the convex hull.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.