From e683b39e0b5f8f8226514ed28ebc1547339e9d5c Mon Sep 17 00:00:00 2001
From: "David A. Madore" <david+git@madore.org>
Date: Wed, 9 Mar 2022 14:34:21 +0100
Subject: Typo/thinko in definition of dual to linear programming problem.

---
 notes-mitro206.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

(limited to 'notes-mitro206.tex')

diff --git a/notes-mitro206.tex b/notes-mitro206.tex
index 7d20177..d5fb37f 100644
--- a/notes-mitro206.tex
+++ b/notes-mitro206.tex
@@ -1947,7 +1947,7 @@ devient de maximiser $v_+ - v_-$ sous les contraintes
 \[-\sum_{a\in A_1} x_a \leq -1\]
 \[(\forall b\in A_2)\;v_+ - v_- - \sum_{a \in A_1} u(a,b)\, x_a \leq 0\]
 Le problème dual (minimiser ${^{\mathrm{t}}\textbf{q}} y$ sous les
-contraintes ${^{\mathrm{t}}\textbf{M}} y \geq {^\mathrm{t}\textbf{q}}$
+contraintes ${^{\mathrm{t}}\textbf{M}} y \geq {^\mathrm{t}\textbf{p}}$
 et $y\geq 0$) est alors de minimiser $w_+ - w_-$ sous les contraintes
 \[w_+\geq 0,\; w_- \geq 0,\;\; (\forall b\in A_2)\;y_b \geq 0\]
 \[\sum_{b\in A_2} y_b \geq 1\]
-- 
cgit v1.2.3

