Doctoral Dissertations

Abstract

"Two algorithms are developed, one exact, one approximate, for finding solutions to the simple plant location problem. Theorems are proved which give sufficient conditions for the inclusion of a plant in the optimal solution. The exact algorithm which is developed is similar to the Branch and Bound method. The approximate technique consists of a directed search through the solution tree for the problem, followed by terminal iterations. The terminal iterations are justified by empirical results obtained from a preliminary version of the technique and a theorem which is proved. Statistics from the results of applying the algorithm to a large number of problems are given. Listings of computer programs which are implementations of the algorithms are provided together with sample output from those programs"--Abstract, page ii.

Advisor(s)

Gillett, Billy E.

Committee Member(s)

Wellek, Robert M.
Lee, Ralph E., 1921-2010
Ho, C. Y. (Chung You), 1933-1988
Rigler, A. Kellam
Penico, Anthony J., 1923-2011

Department(s)

Mathematics and Statistics

Degree Name

Ph. D. in Mathematics

Sponsor(s)

National Science Foundation (U.S.)

Publisher

University of Missouri--Rolla

Publication Date

1970

Pagination

vi, 85 pages

Note about bibliography

Includes bibliographical references (pages 65-66).

Rights

© 1970 John Bruce Prater, All rights reserved.

Document Type

Dissertation - Open Access

File Type

text

Language

English

Subject Headings

Industrial location -- Mathematical modelsIndustrial sites -- Location -- Mathematical models

Thesis Number

T 2377

Print OCLC #

6020208

Electronic OCLC #

851583246

Download

Included in

Mathematics Commons

Share

 
COinS