# A simplex-type algorithm for continuous linear programs with constant coefficients

- 79 Downloads

## Abstract

We consider continuous linear programs over a continuous finite time horizon *T*, with a constant coefficient matrix, linear right hand side functions and linear cost coefficient functions. Specifically, we search for optimal solutions in the space of measures or of functions of bounded variation. These models generalize the separated continuous linear programming models and their various duals, as formulated in the past by Anderson, by Pullan, and by Weiss. In previous papers we formulated a symmetric dual and have shown strong duality. We also have presented a detailed description of optimal solutions and have defined a combinatorial analogue to basic solutions of standard LP. In this paper we present an algorithm which solves this class of problems in a finite bounded number of steps, using an analogue of the simplex method, in the space of measures.

## Keywords

Optimal control Continuous linear programming Simplex-type algorithm## Mathematics Subject Classification

90C05 49N05 65K05## Notes

## References

- 1.Anderson, E.J.: A new continuous model for job-shop scheduling. Int. J. Syst. Sci.
**12**, 1469–1475 (1981)CrossRefGoogle Scholar - 2.Anderson, E.J., Nash, P.: Linear Programming in Infinite Dimensional Spaces. Wiley-Interscience, Chichester (1987)zbMATHGoogle Scholar
- 3.Anderson, E.J., Philpott, A.B.: A continuous time network simplex algorithm. Networks
**19**, 395–425 (1989)MathSciNetCrossRefGoogle Scholar - 4.Bampou, D., Kuhn, D.: Polynomial approximations for continuous linear programs. SIAM J. Optim.
**22**(2), 628–648 (2012)MathSciNetCrossRefGoogle Scholar - 5.Bellman, R.: Bottleneck problems and dynamic programming. Proc. Natl. Acad. Sci.
**39**, 947–951 (1953)MathSciNetCrossRefGoogle Scholar - 6.Cottle, R.W., Pang, J.S., Stone, R.E.: The Linear Complementarity Problem. AP, New York (1992)zbMATHGoogle Scholar
- 7.Dantzig, G.B.: Application of the simplex method to a transportation problem. In: Koopmans, T. (ed.) Activity Analysis of Production and Allocation, pp. 359–373, 330–335. Wiley, New York (1951)Google Scholar
- 8.Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Oper. Res.
**8**(1), 101–111 (1960)CrossRefGoogle Scholar - 9.Fleischer, L., Sethuraman, J.: Efficient algorithms for separated continuous linear programs: the multicommodity flow problem with holding costs and extensions. Math. Oper. Res.
**30**(4), 916–938 (2005)MathSciNetCrossRefGoogle Scholar - 10.Fleischer, L., Skutella, M.: Quickest flows over time. SIAM J. Comput.
**36**(6), 1600–1630 (2007)MathSciNetCrossRefGoogle Scholar - 11.Fleischer, L., Tardos, F.: Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett.
**23**(3–5), 71–80 (1998)MathSciNetCrossRefGoogle Scholar - 12.Grinold, R.C.: Symmetric duality for continuous linear programs. SIAM J. Appl. Math.
**18**, 32–51 (1970)MathSciNetCrossRefGoogle Scholar - 13.Hoppe, B., Tardos, F.: The quickest transshipment problem. Math. Oper. Res.
**25**(1), 36–62 (2000)MathSciNetCrossRefGoogle Scholar - 14.Lemke, C.E.: A method of solution for quadratic programs. Manage. Sci.
**8**(4), 442–453 (1962)MathSciNetCrossRefGoogle Scholar - 15.Lemke, C.E.: Bimatrix equilibrium points and mathematical programming. Manage. Sci.
**11**(7), 681–689 (1965)MathSciNetCrossRefGoogle Scholar - 16.Lemke, C.E., Howson Jr., J.T.: Equilibrium points of bimatrix games. SIAM J. Appl. Math.
**12**(2), 413–423 (1964)MathSciNetCrossRefGoogle Scholar - 17.Leontief, W. (ed.).: Input–Output Economics. Oxford University Press (1986)Google Scholar
- 18.Levinson, N.: A class of continuous linear programming problems. J. Math. Anal. Appl.
**16**, 73–83 (1966)MathSciNetCrossRefGoogle Scholar - 19.Luo, X., Bertsimas, D.: A new algorithm for state-constrained separated continuous linear programs. SIAM J. Control Optim.
**37**(1), 177–210 (1998)MathSciNetCrossRefGoogle Scholar - 20.Nazarathy, Y., Weiss, G.: Near optimal control of queueing networks over a finite time horizon. Ann. Oper. Res.
**170**(1), 233 (2009)MathSciNetCrossRefGoogle Scholar - 21.Papageorgiou, N.S.: A class of infinite dimensional linear programming problems. J. Math. Anal. Appl.
**87**, 228–245 (1982)MathSciNetCrossRefGoogle Scholar - 22.Pullan, M.C.: An algorithm for a class of continuous linear programs. SIAM J. Control Optim.
**31**, 1558–1577 (1993)MathSciNetCrossRefGoogle Scholar - 23.Pullan, M.C.: Forms of optimal solutions for separated continuous linear programs. SIAM J. Control Optim.
**33**, 1952–1977 (1995)MathSciNetCrossRefGoogle Scholar - 24.Pullan, M.C.: A duality theory for separated continuous linear programs. SIAM J. Control Optim.
**34**, 931–965 (1996)MathSciNetCrossRefGoogle Scholar - 25.Pullan, M.C.: Existence and duality theory for separated continuous linear programs. Math. Model. Syst.
**3**, 219–245 (1997)MathSciNetCrossRefGoogle Scholar - 26.Pullan, M.C.: Convergence of a general class of algorithms for separated continuous linear programs. SIAM J. Control Optim.
**10**, 722–731 (2000)MathSciNetCrossRefGoogle Scholar - 27.Shapiro, A.: On duality theory of conic linear problems. In: Goberna, M.A., Lopez, M.A. (eds.) Semi-Infinite Programming, Chap. 7, pp. 135–165. Kluwer, Netherlands (2001)CrossRefGoogle Scholar
- 28.Shindin, E.: Symmetric Strong Duality and Simplex Type Algorithm for Continuous Linear Programs with Constant Coefficients. Ph.D. thesis, University of Haifa, Israel (2016)Google Scholar
- 29.Shindin, E., Weiss, G.: Symmetric strong duality for a class of continuous linear programs with constant coefficients. SIAM J. Optim.
**24**, 1102–1121 (2014)MathSciNetCrossRefGoogle Scholar - 30.Shindin, E., Weiss, G.: Structure of solutions for continuous linear programs with constant coefficients. SIAM J. Optim.
**25**, 1276–1297 (2015)MathSciNetCrossRefGoogle Scholar - 31.Tyndall, W.F.: A duality theorem for a class of continuous linear programming problems. SIAM J. Appl. Math.
**13**, 644–666 (1965)MathSciNetCrossRefGoogle Scholar - 32.Tyndall, W.F.: An extended duality theorem for continuous linear programming problems. SIAM J. Appl. Math.
**15**, 1294–1298 (1967)MathSciNetCrossRefGoogle Scholar - 33.Vanderbei, R.J.: Linear Programming, Foundations and Extensions, 4th edn. Springer, New York (2014)CrossRefGoogle Scholar
- 34.Wang, X., Zhang, S., Yao, D.: Separated continuous conic programming: strong duality and an approximation algorithm. SIAM J. Control Optim.
**48**, 2118–2138 (2009)MathSciNetCrossRefGoogle Scholar - 35.Weiss, G.: A simplex based algorithm to solve separated continuous linear programs. Mathematical Programming Series A, pp. 151–198 (2008)Google Scholar
- 36.Wen, C.F.: Continuous-time generalized fractional programming problems. Part I: basic theory. J. Optim. Theory Appl.
**157**(2), 365–399 (2013)MathSciNetCrossRefGoogle Scholar - 37.Wen, C.F.: Continuous-time generalized fractional programming problems, Part II: an interval-type computational procedure. J. Optim. Theory Appl.
**156**(3), 819–843 (2013)MathSciNetCrossRefGoogle Scholar