Page 1 of 1
Given the following linear programming problem Minimize = = 6x₁, +7x₁ +4x₁5 +5x₂ +8x₂ +6x Subject to 13 14 +x₁4 +x₂4 - +
Posted: Sun Jul 03, 2022 12:01 pm
by answerhappygod
- Given The Following Linear Programming Problem Minimize 6x 7x 4x 5 5x 8x 6x Subject To 13 14 X 4 X 4 1 (20.18 KiB) Viewed 16 times
Given the following linear programming problem Minimize = = 6x₁, +7x₁ +4x₁5 +5x₂ +8x₂ +6x Subject to 13 14 +x₁4 +x₂4 - +x₂5 = 40 +x₂= 60 =-30 =-40 -X15-X=-30 20 (a) Formulate the linear programming problem as a minimum-cost capacitated flow problem. (b) Use the capacitated network simplex algorithm to solve the problem.