References
- E. J. Anderson and P. Nash (1987). Linear Programming in In Infinite-Dimensional Spaces. John Wiley & Sons, Chichester, UK.
- E. J. Anderson, P. Nash, and A. F. Perold (1983). Some properties of a class of continuous linear programs. SIAM J. Cont. Optim. 21:758–765.
- E. J. Anderson and A. B. Philpott (1994). On the solutions of a class of continuous linear programs. SIAM J. Cont. Optim. 32:1289–1296.
- E. J. Anderson and M. C. Pullan (1996). Purification for separated continuous linear programs. Math. Methods Oper. Research 43:9–33.
- R. E. Bellman (1957). Dynamic Programming. Princeton University Press, Princeton, New Jersey.
- R. N. Buie and J. Abrham (1973). Numerical solutions to continuous linear programming problems. Math. Methods Oper. Research 17:107–117.
- L. Fleischer and J. Sethuraman (2005). Efficient algorithms for separated continuous linear programs: the multicommodity flow problem with holding costs and extensions. Math. Oper. Research 30:916–938.
- N. Levinson (1966). A class of continuous linear programming problems. J. Math. Anal. Appl. 16:73–83.
- R. Meidan and A. F. Perold (1983). Optimality conditions and strong duality in abstract and continuous-time linear programming. J. Optim. Theory Appl. 40:61–77.
- N. S. Papageorgiou (1982). A class of infinite dimensional linear programming problems. J. Math. Anal. Appl. 87:228–245.
- M. C. Pullan (1993). An algorithm for a class of continuous linear programs. SIAM J. Control Optim. 31:1558–1577.
- M. C. Pullan (1995). Forms of optimal solutions for separated continuous linear programs. SIAM J. Control Optim. 33:1952–1977.
- M. C. Pullan (1996). A duality theory for separated continuous linear programs. SIAM J. Control Optim. 34:931–965.
- M. C. Pullan (2000). Convergence of a general class of algorithms for separated continuous linear programs. SIAM J. Control Optim. 10:722–731.
- M. C. Pullan (2002). An extended algorithm for separated continuous linear programs. Math. Prog. Ser. A 93:415–451.
- F. Riesz and B. Sz.-Nagy (1955). Functional Analysis. Frederick Ungar Publishing Co., New York, NY.
- M. Schechter (1972). Duality in continuous linear programming. J. Math. Anal. Appl. 37: 130–141.
- W. F. Tyndall (1965). A duality theorem for a class of continuous linear programming problems. SIAM J. Appl. Math. 15:644–666.
- W. F. Tyndall (1967). An extended duality theorem for continuous linear programming problems. SIAM J. Appl. Math. 15:1294–1298.
- X. Q. Wang, S. Zhang, and D. D. Yao (2009). Separated continuous conic programming: strong duality and an approximation algorithm. SIAM J. Control Optim. 48:2118–2138.
- G. Weiss (2008). A simplex based algorithm to solve separated continuous linear programs. Math. Prog., Ser. A 115:151–198.