I am a student who has done mostly pure mathematics courses. I have no background in convex optimization. I have a good background in linear algebra and functional analysis.
I need to understand the (weak) duality theorem of linear programming in order to understand a paper. Most online resources give me long examples and intuitive explanations, instead of the rigor. Can you please explain this concept to me assuming linear algebra and vector space duality?