Filio, Jose P. 4 0
Optimizing student admission vis-a-vis availability of faculty and physical facilities : an integer programming model / 6 6 Jose P. Filio Jr. - - - xii, 85 pages 28 cm. - - - - - . - . - 0 . - . - 0 .
Thesis (M.A.) -- Pamantasan ng Lungsod ng Maynila, 2004.;A directed study presented to the faculty of Graduate School of Engineering in partial fulfillment of the requirements for the degree Master of Engineering Management (MEM) with specialization in Systems Management.
5
ABSTRACT: The LP models presented in this study set the stage to optimize student admission in view of the availability of faculty and room resources in the four (4) undergraduate degree programs of the College of Science at De La Salle University-Dasmariñas. This study aims to meet the increasing demand of students of the university as well as optimizing the utilization of available resources. The following constraints were identified: Availability of faculty hours must not be exceeded, Availability of lecture room hours must not be exceeded, and Availability of laboratory room hours must not be exceeded for one semester. The method used in this study was patterned after the Operations Research methodology- Integer Linear Programming. The researcher comes up with an optimal solution for determining the optimum number of classes to be opened in one semester in order to reach the maximum profit subject to the currently existing resources. A mathematical model was developed that represents the substance of the problem. Substituting the computed values based on the data gathered, and running this in a QM for Windows the following results were obtained: 30 CS (X1), 10 HUB (X2), 8 APB (X3), and 4 ENV (X4) classes for each degree programs with an entity of 52 classes and a total maximum profit of P23,801,330 for the College of Science. Together with the detailed presentation on the above the results obtained will be described as well as final considerations and future developments.
5
2 = =
2
2 --0------
6 --0-- 2 --------
0 2 --
--20------
--------20--
--------20--
----2
/ 2
/ 2
/
/
Optimizing student admission vis-a-vis availability of faculty and physical facilities : an integer programming model / 6 6 Jose P. Filio Jr. - - - xii, 85 pages 28 cm. - - - - - . - . - 0 . - . - 0 .
Thesis (M.A.) -- Pamantasan ng Lungsod ng Maynila, 2004.;A directed study presented to the faculty of Graduate School of Engineering in partial fulfillment of the requirements for the degree Master of Engineering Management (MEM) with specialization in Systems Management.
5
ABSTRACT: The LP models presented in this study set the stage to optimize student admission in view of the availability of faculty and room resources in the four (4) undergraduate degree programs of the College of Science at De La Salle University-Dasmariñas. This study aims to meet the increasing demand of students of the university as well as optimizing the utilization of available resources. The following constraints were identified: Availability of faculty hours must not be exceeded, Availability of lecture room hours must not be exceeded, and Availability of laboratory room hours must not be exceeded for one semester. The method used in this study was patterned after the Operations Research methodology- Integer Linear Programming. The researcher comes up with an optimal solution for determining the optimum number of classes to be opened in one semester in order to reach the maximum profit subject to the currently existing resources. A mathematical model was developed that represents the substance of the problem. Substituting the computed values based on the data gathered, and running this in a QM for Windows the following results were obtained: 30 CS (X1), 10 HUB (X2), 8 APB (X3), and 4 ENV (X4) classes for each degree programs with an entity of 52 classes and a total maximum profit of P23,801,330 for the College of Science. Together with the detailed presentation on the above the results obtained will be described as well as final considerations and future developments.
5
2 = =
2
2 --0------
6 --0-- 2 --------
0 2 --
--20------
--------20--
--------20--
----2
/ 2
/ 2
/
/