| 广义多品种最小费用流问题的对偶理论 |
| |
| 引用本文： | 朱德通.广义多品种最小费用流问题的对偶理论[J].运筹学学报,2002,6(3):17-26. |
| |
| 作者姓名： | 朱德通 |
| |
| 作者单位： | 上海师范大学数学系,上海,200234 |
| |
| 基金项目： | The author gratefully acknowledges the partial supports of the National Science Foundation Grant
(10071050)of China，Science Foundation Grant of Shanghai Technical Sciences Committee |
| |
| 摘 要： | 基于广义多品种最小费用流问题的性质，将问题转化成一对含有内、外层问题的双水平规划，内层规划实际是单品种费用流问题，而外层问题是分离的凸规划，使用相关的凸分析理论，导出了广义多品种最小费用流问题的对偶规划，对偶定理和Kuhn-Tucker条件。
|
| 关 键 词： | 对偶定理 双水平规划 Kuhn－Tucker条件 广义多品种最小费用流问题 |
Dual Theories of General Multicommodity Minimal Cost Flow Problems |
| |
| DETONG ZHU.Dual Theories of General Multicommodity Minimal Cost Flow Problems[J].OR Transactions,2002,6(3):17-26. |
| |
| Authors: | DETONG ZHU |
| |
| Abstract: | Based on the properties of general multicommodity minimal cost flow problems, the problems are first transferred into a bilevel programming problem, which consists of a pair of a lower level programming, called a single-commodity flow problem, and a upper level programming, a separable convex programming. Using the related duality theories of convex analysis, we derived the duality programming, the duality theorems and the Kuhn-Tucker conditions of general multicommodity minimal cost flow problems. |
| |
| Keywords: | Duality theorem bilevel programming Kuhn-Tucker condition general multicommodity minimal cost flow problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
