Skip to main content
SpringerLink
Log in

A combined phase I-phase II projective algorithm for linear programming

  • Published:
Mathematical Programming Submit manuscript

Abstract

We devise a projective algorithm which explicitly considers the constraint that an artificial variable be zero at the solution. Inclusion of such a constraint allows the algorithm to be applied to a (possibly infeasible) standard form linear program, without the addition of any “bigM“ terms or conversion to a primal-dual problem.

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

  • K.M. Anstreicher, “A monotonic projective algorithm for fractional linear programming,”Algorithmica 1 (1986) 483–498.

    Google Scholar 

  • D.M. Gay, “A variant of Karmarkar's linear programming algorithm for problems in standard form,”Mathematical Programming 37 (1987) 81–90.

    Google Scholar 

  • G. de Ghellinck and J. Vial, “A polynomial Newton method for linear programming,”Algorithmica 1 (1986) 425–453.

    Google Scholar 

  • D. Goldfarb and S. Mehrotra, “A relaxed version of Karmarkar's method,”Mathematical Programming 40 (1988) 259–315.

    Google Scholar 

  • D. Goldfarb and S. Mehrotra, “A homogeneous equations variant of Karmarkar's algorithm for solving linear programs,” Department of Industrial Engineering and Operations Research, Columbia University (New York, NY, 1988).

    Google Scholar 

  • C. Gonzaga, “A conical projection algorithm for linear programming,” Department of Electrical Engineering and Computer Science, University of California (Berkeley, CA, 1985).

    Google Scholar 

  • N. Karmarkar, “A new polynomial-time algorithm for linear programming,” manuscript, Mathematical Sciences Division, AT&T Bell Laboratories (Murray Hill, NJ, 1984).

    Google Scholar 

  • N. Karmarkar, “A new polynomial-time algorithm for linear programming,”Combinatorica 4 (1984) 373–395.

    Google Scholar 

  • A.E. Steger, “An extension of Karmarkar's algorithm for bounded linear programming problems,” M.S. Thesis, State University of New York (Stonybrook, NY, 1985).

    Google Scholar 

  • M.J. Todd, private communication (1986).

  • M.J. Todd and B.P. Burrell, “An extension of Karmarkar's algorithm for linear programming using dual variables,”Algorithmica 1 (1986) 409–424.

    Google Scholar 

  • Y. Ye and M. Kojima, “Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming,”Mathematical Programming 39 (1987) 305–317.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Yale School of Organization and Management, Box 1A, 06520, New Haven, CT, USA

    Kurt M. Anstreicher

Authors
  1. Kurt M. Anstreicher
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anstreicher, K.M. A combined phase I-phase II projective algorithm for linear programming. Mathematical Programming 43, 209–223 (1989). https://doi.org/10.1007/BF01582290

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01582290

Key words

Search

Navigation