Technical Note—Vertex Generation and Cardinality Constrained Linear Programs

David S. Rubin
Additional contact information
David S. Rubin: University of North Carolina, Chapel Hill, North Carolina

Operations Research, 1975, vol. 23, issue 3, 555-565

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.

Date: 1975
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.3.555 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:23:y:1975:i:3:p:555-565

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().