Strong duality¶
Assert that a typed primal optimization problem and its dual attain equal optimal objective values, while keeping zero gap distinct from feasibility, attainment, and optimality certificates.
Core Idea¶
For a specified primal minimization problem with optimal value \(p^*\) and its specified dual maximization problem with optimal value \(d^*\), weak duality gives \(d^*\le p^*\) under the standard convention. Strong duality is the equality \(d^*=p^*\), or zero duality gap, for that typed pair. A theorem may additionally guarantee primal or dual attainment, but equality of extended optimal values and existence of optimizers are logically distinct claims.
The dual is constructed so each dual-feasible point gives a bound on every primal-feasible objective, often through a Lagrangian, cone pairing, or linear-program coefficient relation. Strong duality follows when separation, closedness, constraint qualification, polyhedral structure, or another theorem closes the possible gap.
Scope of Application¶
The abstraction is literal wherever practitioners can identify the same constitutive roles, apply the same boundary tests, and obtain the same kind of output. The following habitats are uses of Strong duality itself, not metaphors based only on resemblance.
- Linear programming. Equating finite primal and dual optima under standard feasibility conditions.
- Convex optimization. Using constraint qualifications to close a Lagrangian gap.
- Conic programming. Relating primal and dual cones through closedness and interior conditions.
- Fenchel duality. Equating infimal and supremal conjugate formulations under regularity.
- Optimality certification. Pairing feasible solutions whose objectives meet.
- Sensitivity analysis. Interpreting attained multipliers after strong duality and additional assumptions are secured.
Clarity¶
A clear account of Strong duality must preserve the recognition invariant stated in the Core Idea rather than rely on the title alone. Write the exact primal and exact dual, including minimization or maximization convention. Define optimal values as infima or suprema and state how infeasibility or unboundedness is represented. Separate zero gap, primal attainment, dual attainment, and uniqueness into distinct claims. Name the theorem and verify every convexity, closedness, interior, or feasibility hypothesis.
Manages Complexity¶
Strong duality manages complexity by replacing a diffuse field of observations or possible operations with a bounded role structure: primal problem supplies a declared feasible set, objective, and optimization direction define the reference value.; dual construction supplies a specified transformation produces bound-generating variables and constraints.; weak bound supplies every dual-feasible value lies on the correct side of every primal-feasible value.; optimal values supplies extended infimum and supremum values define the duality gap.; constraint qualification supplies a theorem-specific regularity condition can close the gap..
Abstract Reasoning¶
- Type the primal variables, objective, constraints, and feasible set. 2. Derive the chosen dual rather than importing a visually similar problem. 3. Prove weak duality to establish the direction and sign of the bound. 4. Identify the exact strong-duality theorem appropriate to linear, convex, conic, or Fenchel structure. 5. Verify its feasibility and constraint-qualification hypotheses. 6. Compare optimal values and separately test whether either optimum is attained.
Knowledge Transfer¶
The strict upward abstraction is Duality. Strong Duality instantiates Duality because primal and dual offer complementary bound-generating perspectives on one optimization structure, specialized by equality of their optimal values. Within optimization duality, the full mechanism transfers literally when the same roles and boundary tests recur. Beyond that domain, only the parent-level skeleton should travel. Reusing the label Strong duality after removing its constitutive vocabulary would hide a change of mechanism behind an analogy. The honest transfer rule is therefore two-stage: recognize the domain-specific pattern first, then lift only the parent relation that remains invariant under a substrate change.
Relationships to Other Abstractions¶
Current abstraction Strong duality Domain-specific
Parents (1) — more general patterns this builds on
-
Strong duality is a kind of Duality Prime
Strong Duality instantiates Duality because primal and dual offer complementary bound-generating perspectives on one optimization structure, specialized by equality of their optimal values.
Hierarchy path (1) — routes to 1 parentless root
- Strong duality → Duality
Neighborhood in Abstraction Space¶
Strong duality sits in a sparse region of the domain-specific corpus (93rd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (1565 abstractions)
Nearest neighbors
- Approximation Algorithm — 0.79
- Feasible Region — 0.78
- L-Reduction — 0.78
- Optimal Substructure — 0.77
- Fourier–Motzkin Elimination — 0.77
Computed from structural-signature embeddings · 2026-09-08