MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

On packing and covering polyhedra in infinite dimensions

Author(s)
Rademacher, Luis; Toriello, Alejandro; Vielma Centeno, Juan Pablo
Thumbnail
DownloadVielma_On-Packing.pdf (240.9Kb)
PUBLISHER_CC

Publisher with Creative Commons License

Creative Commons Attribution

Terms of use
Creative Commons Attribution-NonCommercial-NoDerivs License http://creativecommons.org/licenses/by-nc-nd/4.0/
Metadata
Show full item record
Abstract
We consider the natural generalizations of packing and covering polyhedra in infinite dimensions, and study issues related to duality and integrality of extreme points for these sets. Using appropriate finite truncations we give conditions under which complementary slackness holds for primal/dual pairs of the infinite linear programming problems associated with infinite packing and covering polyhedra. We also give conditions under which the extreme points are integral. We illustrate an application of our results on an infinite-horizon lot-sizing problem. Keywords: Covering polyhedron; Packing polyhedron; Infinite linear program; Complementary slackness; Integral extreme point
Date issued
2016-01
URI
http://hdl.handle.net/1721.1/114829
Department
Sloan School of Management
Journal
Operations Research Letters
Publisher
Elsevier BV
Citation
Rademacher, Luis et al. “On Packing and Covering Polyhedra in Infinite Dimensions.” Operations Research Letters 44, 2 (March 2016): 225–230 © 2016 Elsevier B.V.
Version: Original manuscript
ISSN
0167-6377

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.