| 对偶关系的进一步思考 |
| |
| 引用本文： | 潘美芹,丁志军,韩耀军,傅军和.对偶关系的进一步思考[J].教育教学论坛,2019(13):213-214. |
| |
| 作者姓名： | 潘美芹 丁志军 韩耀军 傅军和 |
| |
| 作者单位： | 1.上海外国语大学国际工商管理学院;2.同济大学电子与信息工程学院 |
| |
| 基金项目： | 国家自然科学基金面上项目(61173042);上海外国语大学主干课程建设项目(KCXJ20140203) |
| |
| 摘 要： | 每个线性规划问题总有一个与它对应的对偶线性规划问题。基于对偶关系表,可以由原问题得出对偶问题,但由于变量、约束的复杂关系而使对应关系容易出错。为此,论文总结了"大约变,小约不变,变化仅一次,等号与无约束关联"的口诀,使得能准确无误地写出对偶问题。
|
| 关 键 词： | 原问题 对偶问题 对偶关系 |
A Rule of Dual Relation between Original Problem and Dual Problem |
| |
| PAN Mei-qin,DING Zhi-jun,HAN Yao-jun,FU Jun-he.A Rule of Dual Relation between Original Problem and Dual Problem[J].jiaoyu jiaoxue luntan,2019(13):213-214. |
| |
| Authors: | PAN Mei-qin DING Zhi-jun HAN Yao-jun FU Jun-he |
| |
| Institution: | (School of Business and Management,Shanghai International Studies University,Shanghai 200083,China;School of Electronics and Information Engineering,Tongji University,Shanghai 201804,China) |
| |
| Abstract: | There is always a dual linear programming problem corresponding to each linear programming problem.But it is very easy to get wrong dual problem because of the complicated relationship between variables and constraints.This paper proposes a rule that can help people to get the dual problem easily and correctly. The rule is,maximize-constraint-change, minimize-constraint-same, change is only one time, equal is associated with unconstrained. |
| |
| Keywords: | original problem dual problem dual relation |
| 本文献已被 维普 等数据库收录！ |
|
