A short simple proof of closedness of convex cones and Farkas' lemma

Wouter Kager

A short simple proof of closedness of convex cones and Farkas' lemma

Wouter Kager

Mathematics

Research output: Working paper / Preprint › Preprint › Academic

57 Downloads (Pure)

Abstract

Proving that a finitely generated convex cone is closed is often considered the most difficult part of geometric proofs of Farkas' lemma. We provide a short simple proof of this fact and (for completeness) derive Farkas' lemma from it using well-known arguments.

Original language	English
Number of pages	2
Publication status	Published - 23 Aug 2022

Bibliographical note

2 pages; v2: note largely rewritten, provided more context, improved presentation, added 5 references

Keywords

math.OC
math.RA
15A39 (Primary), 90C05, 52A20 (Secondary)

Access to Document

2208.11678v2

Persistent URL (handle)

Persistent link

Cite this

@techreport{9bcbe35370364d02a799553aed7bd746,

title = "A short simple proof of closedness of convex cones and Farkas' lemma",

abstract = "Proving that a finitely generated convex cone is closed is often considered the most difficult part of geometric proofs of Farkas' lemma. We provide a short simple proof of this fact and (for completeness) derive Farkas' lemma from it using well-known arguments.",

keywords = "math.OC, math.RA, 15A39 (Primary), 90C05, 52A20 (Secondary)",

author = "Wouter Kager",

note = "2 pages; v2: note largely rewritten, provided more context, improved presentation, added 5 references",

year = "2022",

month = aug,

day = "23",

language = "English",

type = "WorkingPaper",

}

TY - UNPB

T1 - A short simple proof of closedness of convex cones and Farkas' lemma

AU - Kager, Wouter

N1 - 2 pages; v2: note largely rewritten, provided more context, improved presentation, added 5 references

PY - 2022/8/23

Y1 - 2022/8/23

N2 - Proving that a finitely generated convex cone is closed is often considered the most difficult part of geometric proofs of Farkas' lemma. We provide a short simple proof of this fact and (for completeness) derive Farkas' lemma from it using well-known arguments.

AB - Proving that a finitely generated convex cone is closed is often considered the most difficult part of geometric proofs of Farkas' lemma. We provide a short simple proof of this fact and (for completeness) derive Farkas' lemma from it using well-known arguments.

KW - math.OC

KW - math.RA

KW - 15A39 (Primary), 90C05, 52A20 (Secondary)

M3 - Preprint

BT - A short simple proof of closedness of convex cones and Farkas' lemma

ER -

A short simple proof of closedness of convex cones and Farkas' lemma

Abstract

Bibliographical note

Keywords

Access to Document

Persistent URL (handle)

Fingerprint

Cite this