Proof that the Dual of a Dual LP is the Primal LP

Exploring the cinematic intuition of Proof that the Dual of a Dual LP is the Primal LP.

Visualizing...

Our institutional research engineers are currently mapping the formal proof for Proof that the Dual of a Dual LP is the Primal LP.

Apply for Institutional Early Access →

The Formal Theorem

Let P P be a primal linear program in standard form:
maximizecTxsubject toAxbx0 \begin{array}{ll} \text{maximize} & c^T x \\ \text{subject to} & Ax \leq b \\ & x \geq 0 \end{array}
Its dual linear program D D is:
minimizebTysubject toATycy0 \begin{array}{ll} \text{minimize} & b^T y \\ \text{subject to} & A^T y \geq c \\ & y \geq 0 \end{array}
Now, let D D' be the dual of D D . The proof establishes that D D' is equivalent to the original primal program P P (possibly after a transformation if D D was not in standard form). Specifically, if we transform D D to its standard form for dualization, its dual D D' will be equivalent to P P .

Analytical Intuition.

Imagine a master strategist, planning a grand campaign (the Primal LP). This strategist's plan has inherent strengths and weaknesses. Now, consider an adversary analyzing this plan from the opposite perspective, looking for vulnerabilities and counter-strategies (the Dual LP). This adversary, in turn, might have their own complex plan. The profound revelation is that when the *adversary* of the adversary devises *their* plan, it perfectly mirrors and reinforces the *original* master strategist's intentions. It's like looking into a mirror, then looking into the mirror of that mirror – you end up seeing the original image, with all its nuances and intentions perfectly preserved, albeit possibly from a different angle.
CAUTION

Institutional Warning.

The primary confusion arises from the necessary transformations required to put the dual LP into standard form before constructing *its* dual, which can obscure the direct correspondence to the original primal.

Academic Inquiries.

01

Why is it important to prove that the dual of the dual is the primal?

This property, known as symmetry, is fundamental to the duality theory of linear programming. It underpins many theoretical results, including the strong duality theorem, and provides a consistent framework for analyzing optimization problems from different perspectives.

02

Does this proof hold for all forms of linear programs (e.g., not just standard form)?

Yes, the principle holds. However, the proof becomes more involved as one needs to account for the specific transformations required to convert different forms (like equality constraints or unrestricted variables) into the standard form for dualization. The core relationship remains.

03

What if the primal LP has no feasible solution or an unbounded objective?

The symmetry still holds in a generalized sense. If the primal is infeasible, the dual is unbounded (or infeasible in a generalized context). If the primal is unbounded, the dual is infeasible. The dual of the dual will then reflect the original primal's status.

Standardized References.

  • Definitive Institutional SourceBertsimas, D., & Tsitsiklis, J. N. (1997). Introduction to Linear Optimization. Athena Scientific.

Institutional Citation

Reference this proof in your academic research or publications.

NICEFA Visual Mathematics. (2026). Proof that the Dual of a Dual LP is the Primal LP: Visual Proof & Intuition. Retrieved from https://nicefa.org/library/linear-and-integer-programming/proof-that-the-dual-of-a-dual-lp-is-the-primal-lp

Dominate the Logic.

"Abstract theory is just a movement we haven't seen yet."