Development of interactive methods for the mathematical programming problem in multi-objective decision process다목적의사결정과정에서 수리계획문제를 위한 상호교호적인 방법론 개발

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 501
  • Download : 0
When planning the allocation of resources, designing or controlling a system, one is often confronted with a need to simultaneously consider several objectives. The multi-objective decision problem arises when the decision-maker(DM) perceives the need to alter the course of the multi-objective system about which he/she is concerned. The inherent conflicting nature of objectives makes one impossible to obtain an optimal solution that simultaneously maximize all objectives. Instead of the optimal solution, the DM chooses the most preferred solution(MPS) based on his/her preference structure among the efficient solutions. Therefore the DM``s preference should be incorporated into the problem solving process. But the decision analyst may have difficulties for involving the DM``s preference, because the DM``s preference structure is not generally known explicitly. The main characteristic methodological aspects of the multi-objective decision problem is the process of eliciting the DM``s preference, suitable to the concerned multi-objective decision problems. Many researches have been carried out for developing methods based on different assumptions and approaches to measure or derive the utility function and solve the various types of Multi-Objective Programming(MOP) problems. In assessing the preference structure, the interactive approach is becoming popular and promising proved by many comparative studies. In this work, we develop an improved interactive method for the MOP problems, especially the multi-objective linear programming(MOLP) problem and the multi-objective integer linear programming(MOLP) probelm, together with development of a new preference representation scheme. In assessing the partial preference, queries of paired comparisons are posed to the DM, which gives to the DM less cognitive burden. For the MOLP problem, we will extend the notion of the Maximally Changeable Dominated Cone (MCDC), on which an interactive scheme is based. Hence, in solution...
Advisors
Kim, Soung-Hieresearcher김성희researcher
Description
한국과학기술원 : 산업공학과,
Publisher
한국과학기술원
Issue Date
1993
Identifier
68152/325007 / 000855390
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 산업공학과, 1993.8, [ vi, 104 p. ]

URI
http://hdl.handle.net/10203/40420
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=68152&flag=dissertation
Appears in Collection
IE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0