An optimal transportation model of COS students in the SJ Building
Date of Publication
1998
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
This study addresses the problem of some students who find it difficult to move from one class to another especially for students who are usually placed on blocks. This study delved only to regular COS students whose classes are held in SJ building only. From a transportation model, it derived an optimal solution that minimized the time and distance travel of regular COS students in attending to their consecutive classes in SJ building. This may also serve as a tool in preparing the plantilla of the vice dean of COS in assigning subjects to rooms in the said building.
Abstract Format
html
Language
English
Format
Accession Number
TU08293
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
69 leaves
Keywords
Mathematical models; Sequential analysis; Linear programming; Mathematical optimization; Optimal stopping (Mathematical statistics)
Recommended Citation
Baes, K. D., & Talosig, M. S. (1998). An optimal transportation model of COS students in the SJ Building. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16433