Business Studies, asked by rabichofficial, 3 months ago

solve problem by first finding the dual and then using the simplex algorithm. minimize (6) c = 225y1 + 180y2 subject to 8y1 + y2 ≥ 32 7y1 + 4y2 ≥ 112 y1 + 6y2 ≥ 54 y1, y2 ≥ 0.

Answers

Answered by Anonymous
1

huhuhuhuhuhuhuuhuuuhh

Answered by waa032697
0

Explanation:

solve problem by first finding the dual and then using the simplex algorithm. minimize (6) c = 225y1 + 180y2 subject to 8y1 + y2 ≥ 32 7y1 + 4y2 ≥ 112 y1 + 6y2 ≥ 54 y1, y2 ≥ 0.

Similar questions