1.¹é°üÈ£, À̱ÔÇå, ¡°LP ¸ðÇü¿¡ ÀÇÇÑ Çѱ¹ Á¤º¸»ê¾÷±â¼úÀÇ R&DÅõÀÚ±Ô¸ð °áÁ¤»ç·Ê¡±, 「±â¼úÇõ½Å¿¬±¸」, Á¦4±Ç Á¦1È£, 1996, pp. 27¢¦47. 2.¹é±¤Ãµ ¿Ü 3ÀÎ, ¡°R&D ÅõÀÚ±Ô¸ð °áÁ¤ ¹× ÀÚ¿ø¹èºÐ¿¡ °üÇÑ ¿¬±¸¡±, 「°æ¿µ°úÇÐ」, Á¦10±Ç Á¦1È£, 1993, pp. 81¢¦105. 3.ÀÌ¿µÂù, ¹ÎÀçÇü, ¡°ºÒÈ®½ÇÇÑ »óȲ ÇÏ¿¡¼ÀÇ ´Ù¸ñÀû R&D ÅõÀÚ°èȹ¼ö¸³¿¡ °üÇÑ ¿¬±¸¡±, 「Çѱ¹°æ¿µ°úÇÐȸÁö」, Á¦20±Ç Á¦2È£, 1995, pp. 39¢¦60. 4.À̵¿¿±, ¡°Interactive Face Search Procedure for Multiple Objective Linear Programming¡±, 「°æ¿µ°úÇÐ」, Á¦10±Ç Á¦2È£, 1993, pp. 11¢¦26. 5.À̵¿¿±, ¡°Interactive Weight Vector Space Reduction Procedure for Bicriterion Linear Programming¡±, 「°æ¿µ°úÇÐ」, Á¦13±Ç Á¦2È£, 1996, pp. 205¢¦213. 6.Á¤È£¿ø, °Àιè, ¡°AHP¸¦ ÀÌ¿ëÇÑ ÀüÀÚ°æºñ ½Ã½ºÅÛÀÇ Æò°¡¿¡ °üÇÑ ¿¬±¸¡±, 「°æ¿µ°úÇÐ」, Á¦13±Ç Á¦2È£, 1996, pp. 49¢¦60. 7.Çѱ¹»ê¾÷±â¼úÁøÈïÇùȸ, ¡¸±¹³»¿Ü Á¤º¸Åë½Å ¿¬±¸°³¹ß ÇöȲÁ¶»ç¡¹, 1997. 8.Çѱ¹ÀüÀÚÅë½Å¿¬±¸¿ø, ¡¸97 Á¤º¸Åë½Å±â±â ¹× ¿¬±¸°³¹ß Åë°è¡¹, ±â¼ú°æÁ¦¿¬±¸ºÎ, 1997. 9.Åë½Å°³¹ß¿¬±¸¿ø, ¡¸Á¤º¸Åë½Å»ê¾÷µ¿Ç⡹, 1997. 7. 10.À̵¿¿±, ¾ÈÅÂÈ£, ¡°A Face Optimization Algorithm for Optimizing over the Efficient Set¡±, 「°æ¿µ°úÇÐ」, Á¦15±Ç Á¦1È£, 1998, pp. 77¢¦85. 11.Aksoy, Y., ¡°Interactive Multiple Objective Decision Making: A Bibliography (1965-1988)¡±, Management Research News, 2, 1990, pp. 1¢¦8. 12.Benayoun, R., J. de Montgolfier, J. Tergny, and O. Laritchev, ¡°Linear Programming with Multiple Objective Functions: Step Method(STEM)¡±, Mathematical Programming, Vol. 1, No. 3, 1971, pp. 366¢¦375. 13.Dessouky, M. I., Ghiassi, M, and Davis, W. J., ¡°Estimates of the Minimum Nondominated Criterion Values in Multiple-Criteria Decision Making¡±, Engineering Costs and Production Economics, Vol. 10, 1986, pp. 95¢¦104. 14.Evans, G. W., ¡°An Overview of Techniques for Solving Multiobjective Mathematical Programs¡±, Management Science, 30, 1268-1282, 1984. 15.Harold P. Benson and Sayin, S., ¡°A face search heuristic algorithm for optimizing over the efficient set¡±, Naval Res. Logist., 40, 1993, pp. 103¢¦116. 16.Harold P. Benson and Dongyeup Lee, ¡°An Outcome-Based Algorithm for Optimizing over the Efficient Set of a Bicriteria Linear Programming Problem¡±, Journal of Optimization Theory and Applications, Vol. 88, No. 1, Jan. 1996, pp. 77¢¦105. 17.Harold P. Benson, Dongyeup Lee and J. P. McClure, ¡°A Multiple-Objective Linear Programming Model for the Citrus Rootstock Selection Problem in Florida¡±, Journal of Multi-Criteria Decision Analysis, Vol. 6, 1997, pp. 283¢¦295. 18.Harold P. Benson, Dongyeup Lee and J. P. McClure, ¡°Global Optimization in Practice: An Application to Interactive Multiple Objective Linear Programming¡±, Journal of Global Optimization, Vol. 12, 1997, pp. 353¢¦372. 19.Isermann, H., ¡°The enumeration of the set of all efficient solutions for a linear multiple objective program¡±, Operational Research Quarterly, 28, 1977, pp. 711 ¢¦725. 20.Isermann, H., ¡°The enumeration of all efficient solutions for a linear multiple- objective transportation problem¡±, Naval Research Logistics Quarterly, 26, 1979, pp. 123¢¦139. 21.Liberatore, M. J., ¡°An Extention of the Analytic Hierarchy Process for Industrial R&D Project Selection¡±, IEEE Transactions on Engineering Management, EM-34, No. 1, 1987, pp. 12¢¦18. 22.Steuer, R. E., Multiple Criteria Optimization: Theory, Computation, and Application, John Wiley and Sons, New York, 1986. 23.Saaty, T. L., ¡°Priority Setting in Complex Problems¡±, IEEE Transactions on Engineering Management, Vol. EM-30, No. 3, 1983, pp. 140¢¦155. 24.Saaty, T. L., ¡°How to make a decision the analytic hierarchy process,¡± European Journal of Operational Research, Vol. 48, 1990, pp. 9¢¦26. 25.Yu, P. L., and Zeleny, M., ¡°The set of all nondominated solutions in linear cases and a multiple criteria simplex method,¡± Journal of Mathematical Analysis and Applications, 49, 1975, pp. 430¢¦468.
|