论文信息 - Purification for separated continuous linear programs

Purification for separated continuous linear programs

This paper presents a purification algorithm for a class of infinite-dimensional linear programs called separated continuous linear programs (SCLP). This takes an initial feasible solution and produces an extreme point solution without a decrease in objective function value. The algorithm presented here for SCLP is also shown to be the best possible purification algorithm in a certain class.

Edward J. Anderson | Malcolm Craig Pullan

[1] Malcolm Craig Pullan. Separated continuous linear programs : theory and algorithms , 1992 .

[2] Adrian Segall,et al. The Modeling of Adaptive Routing in Data-Communication Networks , 1977, IEEE Trans. Commun..

[3] M. Pullan. An algorithm for a class of continuous linear programs , 1993 .

[4] Gideon Weiss,et al. On optimal draining of re-entrant fluid lines , 1995 .

[5] Hoang Xuan Phu. A method for solving a class of optimal control problems which are linear in the control variable , 1987 .

[6] F. Clarke. Optimization And Nonsmooth Analysis , 1983 .

[7] A. Lewis. Extreme Points and Purification Algorithms in General Linear Programming , 1985 .

[8] E. Anderson,et al. Some Properties of a Class of Continuous Linear Programs , 1983 .

[9] R Bellman,et al. Bottleneck Problems and Dynamic Programming. , 1953, Proceedings of the National Academy of Sciences of the United States of America.

[10] Teresa León,et al. A purification algorithm for semi-infinite programming , 1992 .

[11] H. X. Phu. Some necessary conditions for optimality for a class of optimal control problems which are linear in the control variable , 1987 .

[12] Adrian S. Lewis,et al. An extension of the simplex algorithm for semi-infinite linear programming , 1989, Math. Program..

[13] M. Pullan. Forms of Optimal Solutions for Separated Continuous Linear Programs , 1995 .

[14] E. Anderson. A new continuous model for job-shop scheduling , 1981 .