| 线性规划问题的一解双优性 |
| |
| 引用本文： | 娄扩路,董丕明,朱殿国.线性规划问题的一解双优性[J].大连铁道学院学报,1990(2). |
| |
| 作者姓名： | 娄扩路 董丕明 朱殿国 |
| |
| 作者单位： | 大连陆军学院，大连铁道学院，大连陆军学院 |
| |
| 摘 要： | 本文研究了线性规划问题的目标函数与约束条件互换的问题,给出了一解双优的结论.即:若目标函数在X~((h))点取得最大值c.且约束条件过X~((h))点,当二者互换后,得新规划问题的目标函数在X~((h))点必取得最小值b_k:反之,若原目标函数在X~((h))点取得最小值c.则互换后,新的目标函数在X~((h))点必取得最大值b_k.
|
| 关 键 词： | 线性规划 单纯形算法/一解双优 |
Using Simple Method to Make Decisions of One Solution with Two Best Results |
| |
| Lou Kuolu Dong Piming Zhu Dianguo.Using Simple Method to Make Decisions of One Solution with Two Best Results[J].Journal of Dalian Railway Institute,1990(2). |
| |
| Authors: | Lou Kuolu Dong Piming Zhu Dianguo |
| |
| Institution: | Lou Kuolu Dong Piming Zhu Dianguo (Dalian Army Inst.) (Dalian Inst of R. T.) (Dalian Army Inst.) |
| |
| Abstract: | The objective function's exchanges with the restricted condition about the linear programming problem are studied, and the conclusion of one soloution with two best results is given. I. e., if the objetive function gets the maximal value c in X~((k)) spot, and the restricted condition gets througl X~((k)). the objective function of new programming problem must get the minimal value b_k in X~((k)) spot after they exchange with each other. Otherwise, if the original objective function gets the minimal value c in X~((k)) spot after their exchanging with each other, the new objective function must get the maximal value b_k in X~((k)) spot. |
| |
| Keywords: | linear programming simplex algorithm/one solution with two best results |
| 本文献已被 CNKI 等数据库收录！ |
