1 AIT Asian Institute of Technology

A study of Erlenkotter's procedure for the simple plant location problem

AuthorLin, Chiou-feng
Call NumberAIT SSPR no. IE-81-05
Subject(s)Industries, Location of

NoteA special study submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology
PublisherAsian Institute of Technology
AbstractErlenkotter developes a dual-base procedure for a specific mixed-integer programming problem, the so-called Simple Plant Location Problem (SPLP). The superiority of his procedure over the other algorithms for the SPLP is depicted by its much less computational times required to obtain an optimal solution. The main purpose of this study is to supplement the detail theoretical explanations that are omitted in the original paper, to make it easier to be understood. In this study, linear relaxation of the SPLP, condensing of the dual problem, contracting of dual and corresponding integer primal solutions, and justification of optimality of the solutions are explained sequentially. Besides the theoretical aspect, explanations are also given to the implementation of the associated computer program, such as computer input and output.
Year1981
TypeSpecial Study Project Report (SSPR)
SchoolSchool of Engineering and Technology
DepartmentDepartment of Industrial Systems Engineering (DISE)
Academic Program/FoSIndustrial Engineering (IE)
Chairperson(s)Oudheusden, Dirk L. Van;
Examination Committee(s)Tabucanon, Mario T. ;Saeed, Khalid ;
Scholarship Donor(s)China Technical Consultants, Inc. ;
DegreeSpecial Studies Project Report (M. Eng.) - Asian Institute of Technology, 1981


Usage Metrics
View Detail0
Read PDF0
Download PDF0