Tuesday

September 23, 2014

September 23, 2014

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

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 -
**MathMate**, Sunday, December 12, 2010 at 5:42pmIn the real or integer domain?

If integer domain, have you done linear programming yet?

If so, graphics solution or simplex?

**Answer this Question**

**Related Questions**

Linear Programming - calculate the lower bound from min z= 4x1 + 2x2 2x1 - 3x2...

7th grade math help Ms. Sue - 3. Which of the following equations has an ...

Linear Algebra - Solve the following system using Gauss's algorithm (a) x1 + 2x2...

7th grade math Ms. Sue please - 1. m 7 < 6 (1 point) m < 1 m > 1 m &...

Mathforme - 5. 4x + 2 = x + 8. (1 point) x = 4 x = 3 x = 2 x = 1 Solve the ...

kbMath - 5. 4x + 2 = x + 8. (1 point) x = 4 x = 3 x = 2 x = 1 Solve the ...

7th grade math Ms. Sue please - 1. 5h 9 = 16 + 6h (1 point) 4 7 7 10 2. 4x...

Math - 1. 5h 9 = 16 + 6h (1 point) 4 7 7 10 2. 4x + 4 = 9x 36 (1 point) 8...

MATH URGENT - 1. m 7 < 6 (1 point) m < 1 m > 1 m < 13 m < 13 ...

math (double checking) - I've posted this question before but I forgot to say ...