| A DUAL ALGORITHM OF PIECEWISE LINEAR PROGRAMMING WITH SUCCESSIVELY INCREASING SLOPES |
| |
| 引用本文： | Li Wenyuan Li Zhiping Xu Guoyu. A DUAL ALGORITHM OF PIECEWISE LINEAR PROGRAMMING WITH SUCCESSIVELY INCREASING SLOPES[J]. 保鲜与加工, 1991, 0(1): 6-11 |
| |
| 作者姓名： | Li Wenyuan Li Zhiping Xu Guoyu |
| |
| 作者单位： | Li Wenyuan Li Zhiping Xu Guoyu |
| |
| 摘 要： | A fast dual algorithm is presented for the piecewise linear programming with successively increasing slopes. The concept of the pointer is used to derive the optimality and the feasibility conditions based on the dual simplex principle, which avoids enlarging the scale of the problem due to introducing piecewise variables so that storage and calculating requirements are reduced. Finally,the example is given to demonstrate the effectiveness of the presented algorithm.
|
| 关 键 词： | piecewise linear programming succesively increasing slops dual simplex method |
A DUAL ALGORITHM OF PIECEWISE LINEAR PROGRAMMING WITH SUCCESSIVELY INCREASING SLOPES |
| |
| Li Wenyuan Li Zhiping Xu Guoyu. A DUAL ALGORITHM OF PIECEWISE LINEAR PROGRAMMING WITH SUCCESSIVELY INCREASING SLOPES[J]. Storage & Process, 1991, 0(1): 6-11 |
| |
| Authors: | Li Wenyuan Li Zhiping Xu Guoyu |
| |
| Affiliation: | Li Wenyuan Li Zhiping Xu Guoyu |
| |
| Abstract: | A fast dual algorithm is presented for the piecewise linear programming with successively increasing slopes. The concept of the pointer is used to derive the optimality and the feasibility conditions based on the dual simplex principle, which avoids enlarging the scale of the problem due to introducing piecewise variables so that storage and calculating requirements are reduced. Finally,the example is given to demonstrate the effectiveness of the presented algorithm. |
| |
| Keywords: | piecewise linear programming succesively increasing slops dual simplex method |
|
| 点击此处可从《保鲜与加工》浏览原始摘要信息 |
|
点击此处可从《保鲜与加工》下载全文 |
