Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2012, Article ID 482193, 28 pages
http://dx.doi.org/10.1155/2012/482193
Research Article

A Two-Phase Support Method for Solving Linear Programs: Numerical Experiments

1Department of Technology, University of Laghouat, 03000, Algeria
2Laboratory of Modelling and Optimization of Systems (LAMOS), University of Bejaia, 06000, Algeria

Received 6 September 2011; Accepted 7 February 2012

Academic Editor: J. Jiang

Copyright © 2012 Mohand Bentobache and Mohand Ouamer Bibi. 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. L. V. Kantorovich, Mathematical Methods in the Organization and Planning of Production, Publication House of the Leningrad State University, 1939, Translated in Management Science, vol. 6, pp. 366–422, 1960.
  2. G. B. Dantzig, “Maximization of a linear function of variables subject to linear inequalities,” in Activity Analysis of Production and Allocation, R. C. Koopmans, Ed., pp. 339–347, Wiley, New York, NY, USA, 1951. View at Google Scholar · View at Zentralblatt MATH
  3. G. B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, USA, 1963.
  4. V. Klee and G. J. Minty, “How good is the simplex algorithm?” in Inequalities III, O. Shisha, Ed., pp. 159–175, Academic Press, New York, NY, USA, 1972. View at Google Scholar · View at Zentralblatt MATH
  5. R. Gabasov and F. M. Kirillova, Methods of Linear Programming, vol. 1–3, The Minsk University, 1977, 1978 and 1980.
  6. S. Radjef and M. O. Bibi, “An effective generalization of the direct support method,” mathematical Problems in Engineering, vol. 2011, Article ID 374390, 18 pages, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  7. R. Gabasov, F. M. Kirillova, and S. V. Prischepova, Optimal Feedback Control, Springer, London, UK, 1995.
  8. R. Gabasov, F. M. Kirillova, and O. I. Kostyukova, “Solution of linear quadratic extremal problems,” Soviet Mathematics Doklady, vol. 31, pp. 99–103, 1985. View at Google Scholar · View at Zentralblatt MATH
  9. R. Gabasov, F. M. Kirillova, and O. I. Kostyukova, “A method of solving general linear programming problems,” Doklady AN BSSR, vol. 23, no. 3, pp. 197–200, 1979 (Russian). View at Google Scholar
  10. R. Gabasov, F. M. Kirillova, and A. I. Tyatyushkin, Constructive Methods of Optimization. Part1. Linear Problems, Universitetskoje, Minsk, Russia, 1984.
  11. E. A. Kostina and O. I. Kostyukova, “An algorithm for solving quadratic programming problems with linear equality and inequality constraints,” Computational Mathematics and Mathematical Physics, vol. 41, no. 7, pp. 960–973, 2001. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  12. E. Kostina, “The long step rule in the bounded-variable dual simplex method: numerical experiments,” Mathematical Methods of Operations Research, vol. 55, no. 3, pp. 413–429, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  13. M. O. Bibi, “Support method for solving a linear-quadratic problem with polyhedral constraints on control,” Optimization, vol. 37, no. 2, pp. 139–147, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  14. B. Brahmi and M. O. Bibi, “Dual support method for solving convex quadratic programs,” Optimization, vol. 59, no. 6, pp. 851–872, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  15. M. Bentobache and M. O. Bibi, “Two-phase adaptive method for solving linear programming problems with bounded variables,” in Proceedings of the YoungOR 17, pp. 50–51, University of Nottingham, UK, 2011.
  16. M. Bentobache and M. O. Bibi, “Adaptive method with hybrid direction: theory and numerical experiments,” in Proceedings of the Optimization, pp. 24–27, Universidade Nova de Lisboa, Portugal, 2011.
  17. M. O. Bibi and M. Bentobache, “The adaptive method with hybrid direction for solving linear programming problems with bounded variables,” in Proceedings of the colloque International sur l’Optimisation et les Systèmes d’Information (COSI’ 11), pp. 80–91, University of Guelma, Algeria, 2011.
  18. M. O. Bibi and M. Bentobache, “An hybrid direction algorithm for solving linear programs,” in Proceedings of the International Conference on Discrete Mathematics & Computer Science (DIMACOS’11), pp. 28–30, University of Mohammedia, Morocco, 2011.
  19. L. G. Khachian, “A polynomial algorithm for linear programming,” Soviet Mathematics Doklady, vol. 20, pp. 191–194, 1979. View at Google Scholar
  20. N. Karmarkar, “A new polynomial-time algorithm for linear programming,” Combinatorica, vol. 4, no. 4, pp. 373–395, 1984. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  21. S. I. Gass, Linear Programming: Methods and Applications, McGraw-Hill, New York, NY, USA, 1964.
  22. C. M. Shetty, “A simplified procedure for quadratic programming,” Operations Research, vol. 11, pp. 248–260, 1963. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  23. C. B. Millham, “Fast feasibility methods for linear programming,” Opsearch, vol. 13, pp. 198–204, 1976. View at Google Scholar
  24. P. Wolfe, “The Composite Simplex Algorithm,” SIAM Review, vol. 7, no. 1, pp. 42–54, 1965. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  25. R. E. Bixby, “Implementing the simplex method: the initial basis,” ORSA Journal on Computing, vol. 4, no. 3, pp. 1–18, 1992. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  26. N. I. M. Gould and J. K. Reid, “New crash procedures for large systems of linear constraints,” Mathematical Programming, vol. 45, no. 1–3, pp. 475–501, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  27. I. Maros and G. Mitra, “Strategies for creating advanced bases for large-scale linear programming problems,” INFORMS Journal on Computing, vol. 10, no. 2, pp. 248–260, 1998. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  28. B. A. Murtagh and M. A. Saunders, “MINOS 5.5 User’s Guide,” Tech. Rep. SOL 83–20, Systems Optimization Lab., Stanford University, Stanford, Calif, USA, 1998. View at Google Scholar
  29. W. Orchard-Hays, Advanced Linear-Programming Computing Techniques, McGraw-Hill, New York, NY, USA, 1968.
  30. S. Lim and S. Park, “LPAKO: a simplex-based linear programming program,” Optimization Methods and Software, vol. 17, no. 4, pp. 717–745, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  31. H. D. Sherali, A. L. Soyster, and S. G. Baines, “Nonadjacent extreme point methods for solving linear programs,” Naval Research Logistics Quarterly, vol. 30, no. 1, pp. 145–161, 1983. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  32. M. Bentobache, A new method for solving linear programming problems in canonical form and with bounded variables, M.S. thesis, University of Bejaia, Algeria, 2005.
  33. M. Bentobache and M. O. Bibi, “Two-phase support method for solving linear programming problems with nonnegative variables: numerical experiments,” in Proceedings of the Colloque International sur l’Optimisation et les Systèmes d’Information (COSI’08), pp. 314–325, University of Tizi Ouzou, Algeria, 2008.
  34. M. Bentobache and M. O. Bibi, “Two-phase support method for solving linear programming problems with bounded variables: numerical experiments,” in Proceedings of the Colloque International sur l’Optimisation et les Systèmes d’Information (COSI’09), pp. 109–120, University of Annaba, Algeria, 2009.
  35. G. Mitra, M. Tamiz, and J. Yadegar, “Experimental investigation of an interior search method within a simplex framework,” Communications of the ACM, vol. 31, no. 12, pp. 1474–1482, 1988. View at Publisher · View at Google Scholar · View at Scopus
  36. R. J. Vanderbei, Linear Programming: Foundations and Extensions, Kluwer Academic Publichers, Princeton University, 2001.
  37. ILOG CPLEX, “9.0 User’s Manual,” 2003, http://www.ilog.com.
  38. “LP_SOLVE,” http://sourceforge.net/projects/lpsolve/files/lpsolve.
  39. A. Makhorin, “GNU linear programming Kit,” Reference Manual Version 4.9, Draft Edition, 2006, http://www.gnu.org/software/glpk/glpk.html.
  40. P. G. García and Á. Santos-Palomo, “A deficient-basis dual counterpart of Paparrizos, Samaras and Stephanides’s primal-dual simplex-type algorithm,” in Proceedings of the 2nd Conference on Optimization Methods & Software and 6th EUROPT Workshop on Advances in Continuous Optimization, Prague, Czech Republic, 2007.
  41. S. R. Thorncraft, H. R. Outhred, and D. J. Clements, “Evaluation of open-source LP optimization codes in solving electricity spot market optimization problems,” in Proceedings of the 19th Mini-Euro Conference on Operations Research Models and Methods in the Energy Sector, Coimbra, Portugal, 2006. View at Publisher · View at Google Scholar
  42. M. C. Ferris, O. L. Mangasarian, and S. J. Wright, “Linear programming with MATLAB,” MPSSIAM Series on Optimization, 2007. View at Google Scholar
  43. R. H. Bartels and G. H. Golub, “The simplex method of linear programming using LU decomposition,” Communications of the ACM, vol. 12, no. 5, pp. 266–268, 1969. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  44. P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, “A practical anti-cycling procedure for linearly constrained optimization,” Mathematical Programming, vol. 45, no. 1-3, pp. 437–474, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  45. M. Gay, “Electronic mail distribution of linear programming test problems,” Mathematical Programming Society COAL, Bulletin no. 13, 1985, http://www.netlib.org/lp/data.
  46. K. Paparrizos, N. Samaras, and G. Stephanides, “An efficient simplex type algorithm for sparse and dense linear programs,” European Journal of Operational Research, vol. 148, no. 2, pp. 323–334, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  47. J. J. H. Forrest and J. A. Tomlin, “Updated triangular factors of the basis to maintain sparsity in the product form simplex method,” Mathematical Programming, vol. 2, no. 1, pp. 263–278, 1972. View at Publisher · View at Google Scholar · View at Scopus