Technical Note—Vertex Generation and Cardinality Constrained Linear Programs | Zendy

David S. Rubin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Technical Note—Vertex Generation and Cardinality Constrained Linear Programs

Author(s) -

David S. Rubin

Publication year - 1975

Publication title -

operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.797

H-Index - 140

eISSN - 1526-5463

pISSN - 0030-364X

DOI - 10.1287/opre.23.3.555

Subject(s) - cardinality (data modeling) , vertex (graph theory) , linear programming , mathematics , class (philosophy) , limiting , mathematical optimization , constraint (computer aided design) , cutting plane method , combinatorics , graph , computer science , integer programming , mechanical engineering , geometry , artificial intelligence , engineering , data mining

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research