ArticleslgStudy

science

Strong duality

Strong duality is a science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Strong duality rather than just read about it. In short: Strong duality is a condition in mathematical optimization in which the primal optimal objective and the dual optimal objective are equal. By definition, strong duality holds if and only if the duality gap is equal to 0.

Key takeaways

  • Strong duality belongs to science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Strong duality to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Strong duality from memory before moving on to harder problems.

Reference excerpt

Strong duality is a condition in mathematical optimization in which the primal optimal objective and the dual optimal objective are equal. By definition, strong duality holds if and only if the duality gap is equal to 0. This is opposed to weak duality (the primal problem has optimal value greater than or equal to the dual problem, in other words the duality gap is greater than or equal to zero).

Sufficient conditions Each of the following conditions is sufficient for strong duality to hold:

F = F ∗ ∗ {\displaystyle F=F^{**}} where F {\displaystyle F} is the perturbation function relating the primal and dual problems and F ∗ ∗ {\displaystyle F^{**}} is the biconjugate of F {\displaystyle F} (follows by construction of the duality gap)

F {\displaystyle F} is convex and lower semi-continuous (equivalent to the first point by the Fenchel–Moreau theorem) the primal problem is a linear optimization problem Slater's condition for a convex optimization problem.

Strong duality and computational complexity Under certain conditions (called "constraint qualification"), if a problem is polynomial-time solvable, then it has strong duality (in the sense of Lagrangian duality). It is an open question whether the opposite direction also holds, that is, if strong duality implies polynomial-time solvability.

See also Convex optimization Linear programming#Duality Dual linear program

References

Worked examples

Example 1 — a first encounter with Strong duality

Start with the simplest possible case. Write down what Strong duality claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Strong duality before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Strong duality ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Strong duality

In research
Strong duality appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Strong duality in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Strong duality is common in secondary-school and first-year university syllabi. It links to neighbouring topics Convex optimization, Linear programming, so understanding it makes those chapters shorter.
In everyday life
Look for Strong duality outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Strong duality in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Strong duality means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Strong duality out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Strong duality in simple terms?

Strong duality is a condition in mathematical optimization in which the primal optimal objective and the dual optimal objective are equal. By definition, strong duality holds if and only if the duality gap is equal to 0.

Why does Strong duality matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Strong duality?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Strong duality.

Tags

  • Convex optimization
  • Linear programming

Keep exploring