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


     


MATHEMATICS OF OPERATIONS RESEARCH
Vol. 28, No. 2, May 2003, pp. 233-245
DOI: 10.1287/moor.28.2.233.14479
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 HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Clark, S. A.
Right arrow Search for Related Content

An Infinite-Dimensional LP Duality Theorem

Stephen A. Clark

Department of Statistics, University of Kentucky, 817 Patterson Office Tower, Lexington, Kentucky 40506-0027
scalar{at}ms.uky.edu

This paper constructs an infinite-dimensional version of the Duality Theorem for a Linear Program (LP). The algebraic dual LP is replaced with a new program called the topological dual LP that closes the range of the adjoint operator. Under some mild nondegeneracy conditions involving strict positivity, the new Duality Theorem asserts that the optimal value of the primal LP equals the optimal value of the topological dual LP. Some applications to mathematical finance are also included.

Key Words: Linear program; strictly positive; adjoint operator; algebraic dual; topological dual
History: Received: August 28, 2001; revision received: June 11, 2002;revision received: October 14, 2002;


This article has been cited by other articles:


Home page
Mathematics of Operations ResearchHome page
C. Zalinescu
On Zero Duality Gap and the Farkas Lemma for Conic Programming
Mathematics of Operations Research, November 1, 2008; 33(4): 991 - 1001.
[Abstract] [PDF]




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