top of page

I am an enthusiast of  Duality in linear programming and convex optimization. 

 

There are 12 videos I have made in Mandarin and uploaded on a Chinese video-sharing website, Bilibili:

  1. Dual Problem & Shadow Price

  2. Lagrangian Duality & Complementary Slackness

  3. Infeasible & Unbounded

  4. Largest & Smallest (I)

  5. Largest & Smallest (II)

  6. Knapsack Problem

  7. Assignment Problem

  8. Transportation Problem & Basic Feasible Solution

  9. Simplex & Dual Simplex Methods

  10. Resource Allocation & Process Flexibility

  11. Process Flexibility Plus

  12. Shortest Path Problem

​All these videos are about intuitions, tricks, and applications of Duality, and without mathematical theories. The original plan is to make the 13th video about Max-Flow and Min-Cut, but I'm too lazy to update. I will try to reproduce the same videos in English and keep updating when I have a detailed plan of the next 12 videos in future.​

​

Btw, my ID on Bilibili is the Chinese characters of 0.878, which pays tribute to the best-known approximation bound for the Max-Cut problem, using Goemans-Williamson's algorithm.

​

If you know any interesting paper or proof applying Duality in the key steps, please let me know. I will list some brilliant cases here afterwards.

bottom of page