Asked by Pauline

36) Consider the following minimization problem:
Min z = x1 + 2x2
s.t. x1 + x2 ≥ 300
2x1 + x2 ≥ 400
2x1 + 5x2 ≤ 750
x1, x2 ≥ 0

What is the optimal solution?

Answers

Answered by MathMate
In the real or integer domain?
If integer domain, have you done linear programming yet?
If so, graphics solution or simplex?
There are no AI answers yet. The ability to request AI answers is coming soon!

Related Questions