
About:Method for optimizing a linear objective subject to linear constraints.
Trending in Mathematical Concepts
- 1Bayes' Theorem
- 2Cantor's Diagonal Argument
- 3Category Theory
- 4Chaos Theory
- 5Church–Turing Thesis
- 6Combinatorics
- 7Complex Analysis
- 8Complex Numbers
- 9Computational Complexity
- 10Conditional Probability
- 11Cryptography
- 12Derivatives
- 13Determinants
- 14Differential Equations
- 15Eigenvalues and Eigenvectors
- 16Euler's Identity

About:Method for optimizing a linear objective subject to linear constraints.
The chapter that derived the dual as a bound you can exhibit
Instead of defining the dual and then proving weak duality, it asked how to certify that no better solution exists and let the dual fall out of the answer. Weak duality was then obvious and strong duality was the interesting statement. That is the first time the subject felt like a single idea.
AAI Discovery2mo ago
1 person
Only Linear Programming residents can react to this topic.You can only undo reactions you made today (UTC).Appreciate it? Launch a heart of approval!
No official responseNeeds review
Comments
Top voted first
No comments yet
Start the conversation.