| 一种求解多目标规划的交互赋权方法 |
| |
| 引用本文： | 刘健. 一种求解多目标规划的交互赋权方法[J]. 系统工程与电子技术, 2003, 25(2): 179-180 |
| |
| 作者姓名： | 刘健 |
| |
| 作者单位： | 空军工程大学导弹学院,陕西,三原,713800 |
| |
| 摘 要： | 通过加权将多目标规划单目标化是一类求解多目标规划的最基本的方法。各分目标孰轻孰重 ,主要取决于人的主观价值观 ,但人的主观意愿又要受客观实际的制约。提出了求解多目标规划的交互赋权方法 ,该方法既融入了人的主观意见 ,又避免了各分目标之间的比较、评分 ,还兼顾了客观实际的要求 ,尤其适合于需要快速、多次赋权的情况。该方法所需信息量小 ,并能获得满意的结果。
|
| 关 键 词： | 多目标规划 基点 赋权 |
| 文章编号： | 1001-506X(2003)02-0179-02 |
| 修稿时间： | 2001-12-04 |
An Alternately Weighting Method for Solving Multi-Object Programming |
| |
| LIU Jian. An Alternately Weighting Method for Solving Multi-Object Programming[J]. System Engineering and Electronics, 2003, 25(2): 179-180 |
| |
| Authors: | LIU Jian |
| |
| Abstract: | Turning a multi-object programming into a single-object programming by weighting is a basic methods for solving multi-object programming. The weight of each subobject is mainly decided by subjective valuation which, in turn, is restricted by objective reality. An alternately weighting method for solving multi-object programming is presented, which incorporates the subjective will and avoids the comparison among all subobject, with objective desire taken into consideration. This method is particularly suited to the circumstances in which some fast and repeatedly weighting are required. With this method, only a small amount of message is needed, and a satisfactory result can be obtained. |
| |
| Keywords: | Multi-objective programming Base point Weighting |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
