IDEAS home Printed from https://ideas.repec.org/p/mit/sloanp/2612.html
   My bibliography  Save this paper

Condition measures and properties of the central trajectory of a linear program

Author

Listed:
  • Nunez, M. A. (Manuel A.)
  • Freund, Robert Michael.
  • Massachusetts Institute of Technology. Operations Research Center.

Abstract

Includes bibliographical references (p. 37-39).

Suggested Citation

  • Nunez, M. A. (Manuel A.) & Freund, Robert Michael. & Massachusetts Institute of Technology. Operations Research Center., 1996. "Condition measures and properties of the central trajectory of a linear program," Working papers 316-96., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    • Handle: RePEc:mit:sloanp:2612
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/1721.1/2612
    Download Restriction: no
    ---><---

    Citations

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


    Cited by:

    1. Epelman, Marina A., 1973-. & Freund, Robert Michael, 1997. "Condition number complexity of an elementary algorithm for resolving a conic linear system," Working papers WP 3942-97., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    2. Holder, A.G. & Sturm, J.F. & Zhang, S., 1998. "Analytic central path, sensitivity analysis and parametric linear programming," Econometric Institute Research Papers EI 9801, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    3. Freund, Robert Michael. & Mizuno, Shinji., 1996. "Interior point methods : current status and future directions," Working papers 3924-96., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    4. A.G. Holder & J.F. Sturm & S. Zhang, 1998. "Analytic Central Path, Sensitivity Analysis and Parametric Linear Programming," Tinbergen Institute Discussion Papers 98-003/4, Tinbergen Institute.
    5. J.F. Sturm & S. Zhang, 1998. "On Sensitivity of Central Solutions in Semidefinite Programming," Tinbergen Institute Discussion Papers 98-040/4, Tinbergen Institute.

    More about this item

    Keywords

    Q175.M41 O616 no.316-96;

    JEL classification:

    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:mit:sloanp:2612. 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: None (email available below). General contact details of provider: https://edirc.repec.org/data/ssmitus.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.