[1]曹东,万国华.确定多目标问题有效最小值的新方法[J].深圳大学学报理工版,1993,(3-4):47-53.
 Cao Dong,Wan Guohua.An Exact Penalty Method for Finding Minimum Criterion Values over the Efficient Set[J].Journal of Shenzhen University Science and Engineering,1993,(3-4):47-53.
点击复制

确定多目标问题有效最小值的新方法()
分享到:

《深圳大学学报理工版》[ISSN:1000-2618/CN:44-1401/N]

卷:
期数:
1993年3-4期
页码:
47-53
栏目:
电子与信息科学
出版日期:
1993-12-31

文章信息/Info

Title:
An Exact Penalty Method for Finding Minimum Criterion Values over the Efficient Set
作者:
曹东万国华
深圳大学软科学系,深圳 518060
Author(s):
Cao Dong Wan Guohua
Dept. of Soft Science, Shenzhen Univ.
关键词:
多目标线性规划凹最优化支付矩阵
Keywords:
multiple objective linear programmingconcave minimizationpayoff matrix
分类号:
O221
摘要:
源于支付矩阵的最小值常被认为是多目标线性规划(MOLP)问题中有效集上真实最小值的一个“合理”近似,实际两者之间的差距常常是相当大的,为此,提出了一种确定有效集上真实最小值的精确罚函数法,并给出了相应的数值实例。
Abstract:
Minimum criterion values from payoff matrix are often integrated into a number of Multiple Objective Linear Programming(MOLP)problems. These values are usually considered as reasonably accurate estimates of the minimum criterion values over the efficient set that characterize the range of the criterion values over this set. However,the discrepancy between the minimum from the payoff matrix and the minimum over the efficient set can often be large. In this paper,a new exact penalty method is developed to determine the minimum criterion values over the efficient set. A numerical example with three criteria is presented and solved using this method.
更新日期/Last Update: 2016-04-26