Any help would be very very appreciated, here's the question: A standard minimization problem asks to minimize (C=2x+5y) subject to constraints (x+2y≥4), (3x+2y≥6), (x≥0), (y≥0). Create the dual problem.
a) Maximize (W = 4a + 6b) subject to constraints:
(a + 3b ≤ 2)
(2a + 2b ≤ 5)
(a ≥ 0)
(b ≥ 0)
b) Maximize (W = 2a + 5b) subject to constraints:
(a + 2b ≤ 4)
(3a + 2b ≤ 6)
(a ≥ 0)
(b ≥ 0)
c) Maximize (W = 4a + 5b) subject to constraints:
(a + 3b ≤ 2)
(2a + 2b ≤ 5)
(a ≥ 0)
(b ≥ 0)
d) Maximize (W = 2a + 5b) subject to constraints:
(a + 2b ≤ 4)
(3a + 2b ≤ 6)
(a ≥ 0)
(b ≥ 0)
