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?

1 answer

In the real or integer domain?
If integer domain, have you done linear programming yet?
If so, graphics solution or simplex?
Similar Questions
  1. Consider two problem: (1) a minimization problem Z = x1 + 2x2 subject to:−x1 + x2 ≥ 2 ; x1 + 2x2 ≥ 8; x1 ≥ 6 ; and x1,
    1. answers icon 1 answer
  2. Good cop-bad cop strategies are equivalent to:a. suggestibility and coercion b. rapport building and forced-hand techniques c.
    1. answers icon 1 answer
    1. answers icon 0 answers
    1. answers icon 1 answer
more similar questions