IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v20y1990i4p105-116.html
   My bibliography  Save this article

Interior Point Methods for Linear Programming: Just Call Newton, Lagrange, and Fiacco and McCormick!

Author

Listed:
  • Roy Marsten

    (School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332)

  • Radhika Subramanian

    (School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332)

  • Matthew Saltzman

    (Department of Mathematical Sciences, Clemson University, Clemson, SC 29631)

  • Irvin Lustig

    (Department of Civil Engineering and Operations Research, Princeton University, Princeton, NJ 08544)

  • David Shanno

    (RUTCOR, Rutgers University, New Brunswick, NJ 08903)

Abstract

Interior point methods are the right way to solve large linear programs. They are also much easier to derive, motivate, and understand than they at first appeared. Lagrange told us how to convert a minimization with equality constraints into an unconstrained minimization. Fiacco and McCormick told us how to convert a minimization with inequality constraints into a sequence of unconstrained minimizations. Newton told us how to solve unconstrained minimizations. Linear programs are minimizations with equations and inequalities. Voila!

Suggested Citation

  • Roy Marsten & Radhika Subramanian & Matthew Saltzman & Irvin Lustig & David Shanno, 1990. "Interior Point Methods for Linear Programming: Just Call Newton, Lagrange, and Fiacco and McCormick!," Interfaces, INFORMS, vol. 20(4), pages 105-116, August.
  • Handle: RePEc:inm:orinte:v:20:y:1990:i:4:p:105-116
    DOI: 10.1287/inte.20.4.105
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.20.4.105
    Download Restriction: no

    File URL: https://libkey.io/10.1287/inte.20.4.105?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gondzio, Jacek, 2012. "Interior point methods 25 years later," European Journal of Operational Research, Elsevier, vol. 218(3), pages 587-601.
    2. John W. Mamer & Richard D. McBride, 2000. "A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem," Management Science, INFORMS, vol. 46(5), pages 693-709, May.
    3. Torres-Rojo, J. M., 2001. "Risk management in the design of a feeding ration: a portfolio theory approach," Agricultural Systems, Elsevier, vol. 68(1), pages 1-20, April.
    4. Kraft, Edwin R., 2002. "Scheduling railway freight delivery appointments using a bid price approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(2), pages 145-165, February.
    5. Richard D. McBride & John W. Mamer, 2004. "Implementing an LU Factorization for the Embedded Network Simplex Algorithm," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 109-119, May.
    6. G. Y. Zhao, 1999. "Interior-Point Methods with Decomposition for Solving Large-Scale Linear Programs," Journal of Optimization Theory and Applications, Springer, vol. 102(1), pages 169-192, July.
    7. Alexandra M. Newman & Martin Weiss, 2013. "A Survey of Linear and Mixed-Integer Optimization Tutorials," INFORMS Transactions on Education, INFORMS, vol. 14(1), pages 26-38, September.
    8. M. Xiong & J. Wang & P. Wang, 2002. "Differential-Algebraic Approach to Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 114(2), pages 443-470, August.

    More about this item

    Keywords

    programming: linear; tutorial;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orinte:v:20:y:1990:i:4:p:105-116. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.