Skip to main content
SpringerLink
Log in

A Variant of the Dual Face Algorithm Using Gauss-Jordan Elimination for Linear Programming

  • Published:
Journal of the Operations Research Society of China Aims and scope Submit manuscript

Abstract

Using Cholesky factorization, the dual face algorithm was described for solving standard Linear programming (LP) problems, as it would not be very suitable for sparse computations. To dodge this drawback, this paper presents a variant using Gauss-Jordan elimination for solving bounded-variable LP problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Dantzig, G.B.: Programming in a Linear Structure. Comptroller, United States Air Force, Washington, D.C. (1948)

    Google Scholar 

  2. Dantzig, G.B.: Programming of interdependent activities, mathematical model. Econometrica 17(3/4), 200–211 (1949)

    Article  MathSciNet  MATH  Google Scholar 

  3. Dantzig, G.B.: Maximization of a linear function of variables subject to linear inequalities. In: Koopmans, T.C. (ed.) Activity Analysis of Production and Allocation, pp. 339–347. Wiley, New York (1951)

    Google Scholar 

  4. Li, W.: Practical Criss-Cross Method for Linear Programming. Advances in Neural Networks—ISNN 2010. Lecture Notes in Computer Science, vol. 6063, pp. 223–229 (2010)

  5. Terlaky, T.: A covergent criss-cross method. Optimization 16(5), 683–690 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  6. Wang, Z.: A conformal elimination-free algorithm for oriented matroid programming. Chin. Ann. Math. Ser. B 8(1), 120–125 (1987)

    MathSciNet  MATH  Google Scholar 

  7. Yan, H.-Y., Pan, P.-Q.: Most-obtuse-angle criss-cross algorithm for linear programming. Numer. Math. J. Chin. Univ. 31, 209–215 (2009). (in Chinese)

    MathSciNet  Google Scholar 

  8. Zionts, S.: The criss-cross method for solving linear programming problems. Manag. Sci. 15, 426–445 (1969)

    Article  MATH  Google Scholar 

  9. Pan, P.-Q.: Practical finite pivoting rules for the simplex method. OR Spektrum 12, 219–225 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  10. Pan, P.-Q.: A simplex-like method with bisection for linear programming. Optimization 22(5), 717–743 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  11. Pan, P.-Q.: A modified bisection simplex method for linear programming. J. Comput. Math. 14(3), 249–255 (1996)

    MathSciNet  MATH  Google Scholar 

  12. Pan, P.-Q.: The most-obtuse-angle row pivot rule for achieving dual feasibility: a computational study. Eur. J. Oper. Res. 101, 167–176 (1997)

    Article  MATH  Google Scholar 

  13. Pan, P.-Q.: A dual projective simplex method for linear programming. Comput. Math. Appl. 35(6), 119–135 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  14. Pan, P.-Q.: A basis-deficiency-allowing variation of the simplex method. Comput. Math. Appl. 36(3), 33–53 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  15. Pan, P.-Q.: A projective simplex method for linear programming. Linear Algebra Appl. 292, 99–125 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  16. Pan, P.-Q.: A projective simplex algorithm using LU factorization. Comput. Math. Appl. 39, 187–208 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  17. Pan, P.-Q.: A dual projective pivot algorithm for linear programming. Comput. Optim. Appl. 29, 333–344 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  18. Pan, P.-Q.: A revised dual projective pivot algorithm for linear programming. SIAM J. Optim. 16(1), 49–68 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  19. Pan, P.-Q.: Linear Programming Computation, pp. 595. Springer, Berlin (2014)

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Southeast University, Nanjing, 210096, China

    Ping-Qi Pan

Authors
  1. Ping-Qi Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ping-Qi Pan.

Additional information

This work was supported by the National Natural Science Foundation of China (Nos. 10871043 and 70971136).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pan, PQ. A Variant of the Dual Face Algorithm Using Gauss-Jordan Elimination for Linear Programming. J. Oper. Res. Soc. China 4, 347–356 (2016). https://doi.org/10.1007/s40305-015-0106-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40305-015-0106-y

Keywords

Mathematics Subject Classification

Search

Navigation