- Consider The Linear Programming Problem Of Maximising 23 12 Subject To 2 2x2 10 11 12 6 X1 12 2 21 2x2 1 (48.58 KiB) Viewed 29 times
Consider the Linear Programming Problem of maximising 23, + 12 subject to 2 + 2x2 < 10 11 + 12 < 6 X1 - 12 < 2 21 - 2x2
-
answerhappygod
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
Consider the Linear Programming Problem of maximising 23, + 12 subject to 2 + 2x2 < 10 11 + 12 < 6 X1 - 12 < 2 21 - 2x2
Consider the Linear Programming Problem of maximising 23, + 12 subject to 2 + 2x2 < 10 11 + 12 < 6 X1 - 12 < 2 21 - 2x2 < 1 *1,12 > 0. (a) Write the problem in Standard Form. (b) Use the Simplex Method to determine the optimal solution to the problem. (c) Formulate the corresponding Dual Problem. (a) What is the optimal solution to the Dual Problem? (You do not have to solve the Dual Problem.)