Friday
March 24, 2017

Post a New Question

Posted by on Sunday, December 12, 2010 at 5:07pm.

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?

  • Operations research - , Sunday, December 12, 2010 at 5:42pm

    In the real or integer domain?
    If integer domain, have you done linear programming yet?
    If so, graphics solution or simplex?

Answer This Question

First Name:
School Subject:
Answer:

Related Questions

More Related Questions

Post a New Question