On solving multicriterion programming problems with minimum deviation and tradeoff approaches | |
| Author | Pichit Sukchareonpong |
| Call Number | AIT Thesis no. 894 |
| Subject(s) | Programming (Mathematics) Programming (Electronic computers) Computer programming management |
| Note | A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering of the Asian Institute of Technology, Bangkok, Thailand. |
| Publisher | Asian Institute of Technology |
| Abstract | Two approaches for solving multicriteria optimization problems are developed in this study, namely, minimum deviation approach and tradeoff approach, The minimum deviation approach is an iterative exploration procedure, where the best compromise solution is obtained after a number of iterations. The approach starts by constructing a payoff table. There are two phases in each iteration, namely, calculation phase and decision phase. In the calculation phase the problem of minimizing the total percentage deviation of the objective functions is formulated. The deviation of each objective function is expressed in percentage of its possible maximum deviation. In decision phase, the decision maker com pares the solution obtained with the ideal solution (i. e. the solution in which all objectives reach their individual optimum values), he then makes the decision whether the solution is satisfactory or not If only some objectives are satisfied, the decision maker will be asked to relax certain amount of the values of the satisfactory objectives in order to raise those of the unsatisfactory ones. The solution procedure stop when all objectives are satisfied by the decision maker. The tradeoff approach is a method for finding out how the objectives in the multiple objectives programming problems are related. These relationships are shown in graphical, tabular and functional forms. Two criteria-minimum total deviation and breakeven - are suggested to obtain the best compromise solution. Both approaches are developed to handle both multiple objective linear and nonlinear programming problems. Eleven cases are used to illustrated the two approaches. |
| Year | 1976 |
| Type | Thesis |
| School | Student Research Before 1980 |
| Department | Other Field of Studies (No Department) |
| Academic Program/FoS | Thesis (Year <=1979) |
| Chairperson(s) | Pakorn Adulbhan |
| Examination Committee(s) | Techapun Raengkhum ;Sharif, M. N. |
| Scholarship Donor(s) | Kasetsart University and The Siam Commercial Bank Ltd. |
| Degree | Thesis (M.Eng.) - Asian Institute of Technology, 1976 |