000			03198nam a2200385 4500
005			20260818143701.0
008			170398 th eng
035			_a.b1036772x
099		9	_aAIT Thesis no. 1132
100	1		_aDe Guia, Arthur A.
245	1	0	_aInteractive approaches to multicriterion optimization
260			_aBangkok : _bAsian Institute of Technology, _c1975
300			_a108 p.
490	1		_aThesis ; _vno. 1132
500			_aA thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering of the Asian Institute of Technology, Bangkok, Thailand
502			_aThesis (M.Eng.) - Asian Institute of Technology, 1975
520			_aThis thesis considers the two common cases of multicriterion optimization problems: the goal-attainment type and the type. a The classical approach to solving the first type is to set targets priori and use goal programming to achieve them. Its failure to provide a framework for setting targets necessitates model simulation through target variation resulting in tedious calculations. The SCOC (Sequential Conversion of Objective into Constraints) approach is an iterative procedure for rationally organizing the investigation of these acceptable and permissible solutions as a function of the partial choices made by the decision maker at the interactive stages of the process. Two sensitivity analyses - Consequence Realization and Behavior Tracing provided the grounds in undertaking the investigation. The second type of problem arises when there is absolute obscurity on the decision maker's preferences of the objectives. Existing inter active approaches fail in giving the decision maker enough information on the set of permissible solutions, thus requiring numerous interactions and tedious computations before an acceptable solution is arrived. The "indifference map" approach involves a systematic method of simulating all permissible "best compromise" solutions and presenting them in a manner which would facilitate the search for an acceptable solution. It relies on the concepts on sequential optimization and efficient points. This approach is extended to handle multicriterion quadratic programming problems.
650		0	_aMathematical optimization
700	1		_aPakorn Adulbhan, _eChairperson
700	1		_aSharif, M. N., _eExamination Committee
700	0		_aTechapun Raengkhum, _eExamination Committee
710	2		_aGovernment of Canada, _eScholarship Donor
810	2		_aAsian Institute of Technology. _tThesis ; _vno. 1132
856			_3Full-Text _uhttp://203.159.5.9/ait-thesis/detail.php?q=B24125
907			_a.b1036772x _bmnait _cx
902			_a260519
998			_b2 _c951012 _dm _ea _fx _g0
945			_lmnait
945			_lmnarc
942			_c20
942			_c40
909			_aBarcode : 30050003022299 _bCREATED : 1994-05-17 _cRECORD # : i10458712 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0
909			_aBarcode : 30050160087879 _bCREATED : 2016-04-05 _cRECORD # : i12971078 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0
999			_c62004 _d62004