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

Identifying the set of always-active constraints in a system of linear inequalities by a single linear program

Author

Listed:
  • Freund, Robert Michael.
  • Roundy, Robin.
  • Todd, Michael J., 1947-

Abstract

No abstract is available for this item.

Suggested Citation

  • Freund, Robert Michael. & Roundy, Robin. & Todd, Michael J., 1947-, 1985. "Identifying the set of always-active constraints in a system of linear inequalities by a single linear program," Working papers 1674-85., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    • Handle: RePEc:mit:sloanp:2111
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. Olivier Toubia & Duncan I. Simester & John R. Hauser & Ely Dahan, 2003. "Fast Polyhedral Adaptive Conjoint Estimation," Marketing Science, INFORMS, vol. 22(3), pages 273-303.
    2. Dritan Nace & James B. Orlin, 2007. "Lexicographically Minimum and Maximum Load Linear Programming Problems," Operations Research, INFORMS, vol. 55(1), pages 182-187, February.
    3. Daniel E. Steffy & Kati Wolter, 2013. "Valid Linear Programming Bounds for Exact Mixed-Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 271-284, May.
    4. Georgios Saharidis & Marianthi Ierapetritou, 2013. "Speed-up Benders decomposition using maximum density cut (MDC) generation," Annals of Operations Research, Springer, vol. 210(1), pages 101-123, November.
    5. Bharat Adsul & Jugal Garg & Ruta Mehta & Milind Sohoni & Bernhard von Stengel, 2021. "Fast Algorithms for Rank-1 Bimatrix Games," Operations Research, INFORMS, vol. 69(2), pages 613-631, March.
    6. Gelareh, Shahin & Neamatian Monemi, Rahimeh & Nickel, Stefan, 2015. "Multi-period hub location problems in transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 75(C), pages 67-94.

    More about this item

    Keywords

    HD28 .M414 no.1674-; 85;

    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:2111. 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.