Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 408048, 9 pages
http://dx.doi.org/10.1155/2013/408048
Review Article

Review on the Research for Separated Continuous Linear Programming: With Applications on Service Operations

Lingnan (University) College, Sun Yat-Sen University, Guangzhou, Guangdong 510275, China

Received 22 April 2013; Accepted 17 June 2013

Academic Editor: Tsan-Ming Choi

Copyright © 2013 Xiaoqing Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. X. Ding and C. Wang, “A novel algorithm of stochastic chance-constrained linear programming and its application,” Mathematical Problems in Engineering, vol. 2012, Article ID 139271, 17 pages, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  2. W. Chen, Y. Yang, and H. Ma, “Fuzzy portfolio selection problem with different borrowing and lending rates,” Mathematical Problems in Engineering, vol. 2011, Article ID 263240, 15 pages, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. E. J. Anderson, A continuous model for job-shop scheduling [Ph.D. thesis], University of Cambridge, Cambridge, UK, 1978.
  4. X. Luo and D. Bertsimas, “A new algorithm for state-constrained separated continuous linear programs,” SIAM Journal on Control and Optimization, vol. 37, no. 1, pp. 177–210, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. A. Shapiro, “On duality theory of conic linear problems,” in Semi-Infinite Programming, M. A. Goberna and M. A. Lopez, Eds., vol. 57, pp. 135–165, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2001. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. G. Weiss, “A simplex based algorithm to solve separated continuous linear programs,” Mathematical Programming, vol. 115, no. 1, pp. 151–198, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. X. Wang, “The duality theory of generalized separated continuous linear programming,” in Proceedings of the International Conference on Management and Service Science (MASS '10), pp. 24–26, Wuhan, China, August 2010.
  8. M. M. Nasrabadi, M. A. Yaghoobi, and M. Mashinchi, “Separated continuous linear programs with fuzzy valued objective function,” Scientia Iranica D, vol. 17, no. 2, pp. 105–118, 2010. View at Google Scholar · View at Zentralblatt MATH
  9. E. J. Anderson and P. Nash, Linear Programming in Infinite-Dimensional Spaces: Theory and Applications, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Chichester, UK, 1987. View at MathSciNet
  10. R. C. Grinold, Continuous programming [Ph.D. thesis], Operations Research Center, University of Berkeley, Berkeley, Calif, USA, 1968.
  11. M. C. Pullan, “An algorithm for a class of continuous linear programs,” SIAM Journal on Control and Optimization, vol. 31, no. 6, pp. 1558–1577, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. M. C. Pullan, “A duality theory for separated continuous linear programs,” SIAM Journal on Control and Optimization, vol. 34, no. 3, pp. 931–965, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. E. J. Anderson, P. Nash, and A. F. Perold, “Some properties of a class of continuous linear programs,” SIAM Journal on Control and Optimization, vol. 21, no. 5, pp. 758–765, 1983. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. E. J. Anderson and A. B. Philpott, “On the solutions of a class of continuous linear programs,” SIAM Journal on Control and Optimization, vol. 32, no. 5, pp. 1289–1296, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. M. C. Pullan, “Forms of optimal solutions for separated continuous linear programs,” SIAM Journal on Control and Optimization, vol. 33, no. 6, pp. 1952–1977, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. E. J. Anderson and A. B. Philpott, “A continuous-time network simplex algorithm,” Networks, vol. 19, no. 4, pp. 395–425, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. A. B. Philpott and M. Craddock, “An adaptive discretization algorithm for a class of continuous network programs,” Networks, vol. 26, no. 1, pp. 1–11, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. M. C. Pullan, “An extended algorithm for separated continuous linear programs,” Mathematical Programming, vol. 93, no. 3, pp. 415–451, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. M. C. Pullan, “Convergence of a general class of algorithms for separated continuous linear programs,” SIAM Journal on Optimization, vol. 10, no. 3, pp. 722–731, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. R. N. Buie and J. Abrham, “Numerical solutions to continuous linear programming problems,” Zeitschrift für Operations Research, vol. 17, no. 3, pp. 107–117, 1973. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  21. W. F. Tyndall, “A duality theorem for a class of continuous linear programming problems,” Journal of the Society for Industrial and Applied Mathematics, vol. 13, no. 3, pp. 644–666, 1965. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  22. L. Fleischer and J. Sethuraman, “Efficient algorithms for separated continuous linear programs: the multicommodity flow problem with holding costs and extensions,” Mathematics of Operations Research, vol. 30, no. 4, pp. 916–938, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  23. H. Chen and D. D. Yao, “Dynamic scheduling of a multiclass fluid network,” Operations Research, vol. 41, no. 6, pp. 1104–1115, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  24. F. Avram, D. Bertsimas, and M. Ricard, “Fluid models of sequencing problems in open queueing networks; an optimal control approach,” in Stochastic Networks, F. P. Kelly and R. Williams, Eds., vol. 71 of IMA Volumes in Mathematics and Its Applications, pp. 199–234, Springer, New York, NY, USA, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  25. V. Bhaskar and P. Lallement, “Modeling a supply chain using a network of queues,” Applied Mathematical Modelling, vol. 34, no. 8, pp. 2074–2088, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  26. M. Mohammadi, F. Jolai, and H. Rostami, “An M/M/c queue model for hub covering location problem,” Mathematical and Computer Modelling, vol. 54, no. 11-12, pp. 2623–2638, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  27. C. Kim, A. Dudin, S. Dudin, and O. Dudina, “Tandem queueing system with impatient customers as a model of call center with interactive voice response,” Performance Evaluation, vol. 70, no. 6, pp. 440–453, 2013. View at Publisher · View at Google Scholar
  28. M. Asaduzzaman, T. J. Chaussalet, and N. J. Robertson, “A loss network model with overflow for capacity planning of a neonatal unit,” Annals of Operations Research, vol. 178, no. 1, pp. 67–76, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  29. H. Chen and D. D. Yao, Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization, vol. 46 of Applications of Mathematics, Springer, New York, NY, USA, 2001. View at MathSciNet
  30. J. G. Dai, “On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models,” The Annals of Applied Probability, vol. 5, no. 1, pp. 49–77, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  31. B. Hajek and R. G. Ogier, “Optimal dynamic routing in communication networks with continuous traffic,” Networks, vol. 14, no. 3, pp. 457–487, 1984. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  32. X. Luo, Continuous linear programming: theory, algorithms and applications [Ph.D. thesis], Massachusetts Institute of Technology, Cambridge, Mass, USA, 1995.