# \#duality

**URL:** https://discourse.julialang.org/tag/duality/1765.md

[Latest](https://discourse.julialang.org/latest.md) · [Categories](https://discourse.julialang.org/categories.md) · [Tags](https://discourse.julialang.org/tags.md)

---

## [Approaching a Linear Program Correctly](https://discourse.julialang.org/t/approaching-a-linear-program-correctly/127354)

<div class="topic-metadata">

**Author:** [@WalterMadelim](https://discourse.julialang.org/u/WalterMadelim)\
**Replies:** 15\
**Last updated:** [March 27, 2025, 12:37am UTC](https://discourse.julialang.org/t/approaching-a-linear-program-correctly/127354 "2025-03-27T00:37:32Z")

</div>

Let’s see the Proposition 5.2.1 of the 2009 Bertsekas’s convex optimization theory: (Linear Programming Duality Theorem) (a) If any one of the 2 programs (primal and dual) has a finite optimal objective value, then th…

---

## [A naive explanation of infeasibility and unboundedness](https://discourse.julialang.org/t/a-naive-explanation-of-infeasibility-and-unboundedness/127343)

<div class="topic-metadata">

**Author:** [@WalterMadelim](https://discourse.julialang.org/u/WalterMadelim)\
**Replies:** 1\
**Last updated:** [March 25, 2025, 12:37pm UTC](https://discourse.julialang.org/t/a-naive-explanation-of-infeasibility-and-unboundedness/127343 "2025-03-25T12:37:48Z")

</div>

I demo the process “From unboundedness to an infeasibility system” Say, let’s employ y \\in \\mathbb{R} as our decision variable. We know +\\infty = \\sup \\{y | y \\ge 0\\} Given any y \\ge 0, we know 0 = \\inf \\{yx |x \\g…