Abstract
dc:description.abstract<p>The purpose of this research is to study on the sensitivity analysis of priority level reordering of a goal programming model. Two approaches are presented in this study to handle this priority level reordering analysis. The first one is an algorithm to generate the solution of a similar problem with different priority level ordering of the original one utilizing the final solution tableau of the original problem. In doing so, calculation steps and time are saved tremendously.</p><p>The second approach is based on the fact that some goal programming problem of different priority level ordering has the same solution as others. A mechanism is developed to generate all the GP problems (experiments) with different priority level ordering having the same solution. This mechanism is to utilize indicator rows in the final tableau of the original problem to determine experiments having the same result as the original one. A theorem and a corollary are developed to confirm its possibility.</p>
Degree
thesis:*- Name thesis:degree_name
- Master of Science in Industrial Engineering - (M.S.)
- Discipline thesis:degree_discipline
- Industrial and Management Engineering
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Hor, Fu-Chia
- Contributors dc:contributor
-
- David W. Mo
Subjects
dc:subject × 2Identifiers
dc:identifier.*- Repository record dc:identifier
- https://digitalcommons.njit.edu/theses/3405