返回
摘要
En 中文
This paper concentrates on the assignment problem where costs are not deterministic numbers but imprecise ones. Here, the elements of the cost matrix of the assignment problem are subnormal fuzzy intervals with increasing linear membership functions, whereas the membership function of the total cost is a fuzzy interval with decreasing linear membership function. By the max-min criterion suggested by Bellman and Zadeh, the fuzzy assignment problem can be treated as a mixed integer nonlinear programming problem. We show that this problem can usually be simplified into either a linear fractional programming problem or a bottleneck assignment problem. Here, we propose an efficient algorithm based on the labeling method for solving the linear fractional programming case. The algorithm begins with primal feasibility and proceeds to obtain dual feasibility while maintaining complementary slackness until the primal optimal solution is found. The computational results show that the proposed labeling algorithm offers an effective and efficient way for handling the fuzzy assignment problem. (C) 2003 Elsevier B.V. All rights reserved.
Keyword:
combinatorial problem
fuzzy interval
fuzzy assignment problem
labeling method
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.7
论文数:
7.6K
被引数:
1.5W
机构
暂无机构信息
引用论文
Development of the simulation-based German albuminuria screening model (S-GASM) for estimating the cost-effectiveness of albuminuria screening in Germany
PLOS ONE
IF0
Interactive fuzzy programming for two-level linear and linear fractional production and assignment problems: A case study两级线性和线性分数生产和分配问题的交互式模糊规划: 案例研究

