Mathematics of Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


MATHEMATICS OF OPERATIONS RESEARCH
Vol. 32, No. 2, May 2007, pp. 395-412
DOI: 10.1287/moor.1060.0242
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Pataki, G.
Right arrow Search for Related Content

On the Closedness of the Linear Image of a Closed Convex Cone

Gábor Pataki

Department of Statistics and Operations Research, University of North Carolina, CB #3260, Chapel Hill, North Carolina 27599
gabor{at}unc.edu, http://www.unc.edu/~pataki

When is the linear image of a closed convex cone closed? We present very simple and intuitive necessary conditions that (1) unify, and generalize seemingly disparate, classical sufficientconditions such as polyhedrality of the cone, and Slater-type conditions; (2) are necessary and sufficient, when the dual cone belongs to a class that we call nice cones (nice cones subsume all cones amenable to treatment by efficient optimization algorithms, for instance, polyhedral, semidefinite, and p-cones); and (3) provide similarly attractive conditions for an equivalent problem: the closedness of the sum of two closed convex cones.

Key Words: closedness; linear image; closed convex cone; sum of closed convex cones; duality; common root of Slater’s condition and polyhedrality
History: Received: March 27, 2003; revision received: June 8, 2006;





HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2007 by INFORMS.