知识卡片
多商品流共用边容量
多商品流让多种货物分别从各自源点流向汇点,每种都有需求量和守恒约束;同一边上各商品流量之和不能超过共享容量。
这里先问是否存在满足全部需求的流,目标函数可取常数零。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第29章 线性规划 · 查看原书依据
We define fuv, the aggregate flow, to be the sum of the various commodity flows, so that . The aggregate flow on edge (u, v) must be no more than the capacity of edge (u, v). This problem has no objective function: the question is to determine whether such a flow exists. Thus the linear program for this problem has a
参考来源
- 位置:《算法导论(第4版)》第29章《线性规划》(OEBPS/chapter029.xhtml,文本字符[30000,35000))。
- 结论依据:原文陈述多商品流、对偶、可行性证书或网络优化的定义与条件;相应公式图已核对。
- 原始内容:We define f uv , the aggregate flow , to be the sum of the various commodity flows, so that . The aggregate flow on edge ( u , v ) must be no more than the capacity of edge ( u , v ). This problem has no objective function: the question is to determine whether such a flow exists. Thus the linear program for this problem has a