运筹与管理 ›› 2022, Vol. 31 ›› Issue (10): 133-138.DOI: 10.12005/orms.2022.0330

• 理论分析与方法探讨 • 上一篇    下一篇

序数权重统一表示下的权重稳健性Hasse图分析

岳立柱1, 陆畅2, 施光磊2   

  1. 1.黄山学院 经济管理学院,安徽 黄山 245000;
    2.辽宁工程技术大学 管理科学与工程研究院,辽宁 葫芦岛 125105
  • 收稿日期:2020-01-29 出版日期:2022-10-25 发布日期:2022-11-14
  • 作者简介:岳立柱(1976-),男,黑龙江省大庆人,副教授,博士,研究方向:决策理论与方法;陆畅(1998-),女,辽宁省朝阳人,硕士研究生,研究方向:公司治理。
  • 基金资助:
    辽宁省教育厅基金项目(LJ2020JCL028)

Analysis of Hasse Graphs with Uniform Representation of Ordinal Weights

YUE Li-zhu1, LU Chang2, SHI Guang-lei2   

  1. 1. School of Economics and Management, Huangshan University, Huangshan 245000, China;
    2. Institute of Management Science and Engineering, Liaoning Technical University, Huludao 125105, China
  • Received:2020-01-29 Online:2022-10-25 Published:2022-11-14

摘要: 认识多种序数赋权方法的共性,有助于摆脱方法选择困扰,增强其实用效果。首先以线性函数为目标函数,以权重关系构造约束条件,建立线性规划。在此基础上证明了任意权重均可由线性规划的极值点集来表示,揭示了序数权重实质上是极值点的加权线性组合。进一步针对赋权方法稳健性不足的问题,利用极值点构建偏序关系,通过Hasse图增强权重排序的稳健性。实例分析表明,尽管序数权重不同,但与偏序方法相结合,均能得到类似的分析结果。

关键词: 权重, 序数权重, 偏序集, Hasse图

Abstract: It is helpful to get rid of the puzzle of method selection and enhance its practical effect to recognize the commonness of several ordinal weighting methods. Firstly, linear programming is established by taking linear function as objective function and constructing constraint conditions with weight relation. On this basis, it is proved that any weight can be expressed by the set of extreme points of linear programming, and it is revealed that ordinal weight is essentially a weighted linear combination of extreme points. Furthermore, aiming at the problem of insufficient robustness of weighting method, the partial order relation is constructed by using extreme points, and the robustness of weight ranking is enhanced by Hasse graph. The example analysis shows that although the ordinal weights are different, the similar analysis results can be obtained by combining with the partial order method.

Key words: weight, ordinal weight, poset, Hasse diagram

中图分类号: