Page 1 of 1
Formulate the dual problem for the linear programming problem. Minimize C = 3x₁ + x₂ subject to 2x₁ + 3x2 ≥60, x₁ +4x₂ ≥
Posted: Thu Jun 30, 2022 7:41 pm
by answerhappygod
- Formulate The Dual Problem For The Linear Programming Problem Minimize C 3x X Subject To 2x 3x2 60 X 4x 1 (25.1 KiB) Viewed 35 times
Formulate the dual problem for the linear programming problem. Minimize C = 3x₁ + x₂ subject to 2x₁ + 3x2 ≥60, x₁ +4x₂ ≥ 40 with x₁, x₂ 20. O A. Maximize P=60y₁ +40y2subject to 2y₁ + y₂ ≤3, 3y₁ +4y2 ≤1 with y₁, y2 20 OC. Maximize P=3y₁ + y2 subject to 2y₁ + y₂ ≤3, 3y₁ +4y2 ≤1 with y₁, y₂ 20 C OB. Maximize P=60y₁ +40y2 subject to 2y₁ + y223, 3y₁ +4y2 21 with y₁, y₂ 20 O D. Maximize P=3y₁ + y₂ subject to 2y₁ + y₂ ≤3, 3y₁ + 4y221 with y₁, y₂ 20