| A Compromise Approach to Lexicographic Optimal Solution in Multiple Objective Programming |
| |
| 作者姓名： | XU Jiuping |
| |
| 作者单位： | XU Jiuping Department of Applied Mathematics，Chengdu University of Science and Technology，Chengdu，610065 SHI Yong College of Business Administration，University of Nebraska at Omaha，Omaha，NE 68182，USA |
| |
| 摘 要： | ＡＣｏｍｐｒｏｍｉｓｅＡｐｐｒｏａｃｈｔｏＬｅｘｉｃｏｇｒａｐｈｉｃＯｐｔｉｍａｌＳｏｌｕｔｉｏｎｉｎＭｕｌｔｉｐｌｅＯｂｊｅｃｔｉｖｅＰｒｏｇｒａｍｍｉｎｇＸＵＪｉｕｐｉｎｇＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，Ｃｈｅｎｇｄ...
|
A Compromise Approach to Lexicographic Optimal Solution in Multiple Objective Programming |
| |
| XU Jiuping.A Compromise Approach to Lexicographic Optimal Solution in Multiple Objective Programming[J].Journal of Systems Science and Systems Engineering,1997(3). |
| |
| Authors: | XU Jiuping |
| |
| Institution: | XU Jiuping Department of Applied Mathematics,Chengdu University of Science and Technology,Chengdu,610065 SHI Yong College of Business Administration,University of Nebraska at Omaha,Omaha,NE 68182,USA |
| |
| Abstract: | In this paper we use a compromise approach to identify a lexicographic optimal solution of a multiple objective programming (MOP) problem. With this solution concept, we first find the maximization of each objection function as the ideal value. Then, we construct a lexicographic order for the compromise (differences) between the ideal values and objective functions. Based on the usually lexicographic optimality structure, we discuss some theoretical properties about our approach and derive a constructing algorithm to compute such a lexicographic optimal solution. |
| |
| Keywords: | multiple objective programming compromise approach lexicographic optimal solution algorithm |
| 本文献已被 CNKI 等数据库收录！ |
