On Zero Duality Gap and the Farkas Lemma for Conic Programming

On Zero Duality Gap and the Farkas Lemma for Conic Programming

0.00 Avg rating0 Votes
Article ID: iaor200954199
Country: United States
Volume: 33
Issue: 4
Start Page Number: 991
End Page Number: 1001
Publication Date: Nov 2008
Journal: Mathematics of Operations Research
Authors:
Keywords: programming: convex
Abstract:

Recently S. A. Clark published an interesting duality result in linear conic programming dealing with a convex cone that is not closed in which the usual (algebraic) dual problem is replaced by a topological dual with the aim of having zero duality gap under certain usual hypotheses met in mathematical finance. We present some examples to show that an extra condition is needed to reach a conclusion; this supplementary condition is also provided. We also give counterexamples for three results on hedging prices and simple proofs for two known solvability results.

Reviews

Required fields are marked *. Your email address will not be published.