IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v23y1975i3p555-565.html
   My bibliography  Save this article

Technical Note—Vertex Generation and Cardinality Constrained Linear Programs

Author

Listed:
  • David S. Rubin

    (University of North Carolina, Chapel Hill, North Carolina)

Abstract

Tanahashi and Luenberger have recently discussed a class of problems that they call “cardinality constrained linear programs (CCLP's).” These are linear programs with an additional constraint limiting the number of variables that may take on strictly positive values. Tanahashi and Luenberger presented cutting plane methods to solve the CCLP. We show how to solve the CCLP by modifying a procedure for generating all the vertices of the feasible region of the associated linear program. We also illustrate the relations between the CCLP and some other problems discussed in the literature.

Suggested Citation

  • David S. Rubin, 1975. "Technical Note—Vertex Generation and Cardinality Constrained Linear Programs," Operations Research, INFORMS, vol. 23(3), pages 555-565, June.
    • Handle: RePEc:inm:oropre:v:23:y:1975:i:3:p:555-565
    DOI: 10.1287/opre.23.3.555
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.23.3.555
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.23.3.555?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
    ---><---

    More about this item

    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:oropre:v:23:y:1975:i:3:p:555-565. 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.