Linear-programming duality
For primal maximize c^T*x with A*x≤b,x≥0, the dual minimizes b^T*y with A^T*y≥c,y≥0; feasible pairs satisfy weak duality.
atlas-linear-program-duality · canonical_mko
This English edition is an AI candidate and does not yet have an OCME Atlas (GPT-6) Twin closure receipt.
Catalogue presentation and source-binding data
For primal maximize c^T*x with A*x≤b,x≥0, the dual minimizes b^T*y with A^T*y≥c,y≥0; feasible pairs satisfy weak duality.
atlas-linear-program-duality · canonical_mko