Question 1196320: 2.4 Determine the dual problem of the linear programming problem below:
Minimize C= 4x + 2y + 6z
Subject to X+2y+z≥4
2x+y+ 2z≥ 2
3x+ 2y+z≥ 3
x, y, z ≥ 0
2.5 Use the dual method to solve the problem in question 2.4.
Answer by ikleyn(52814)   (Show Source):
You can put this solution on YOUR website! .
I believe this problem is for University students,
and I believe that a university student should solve it on his or her own.
All what I can do (and it is, actually, very essential help), is to point relevant sources to read and to learn from.
These sources are
https://web.mit.edu/15.053/www/AMP-Chapter-04.pdf
https://en.wikipedia.org/wiki/Dual_linear_program
Otherwise, I would be in position to re-write from there, which I do not want to do.
|
|
|
