Tuesday

March 3, 2015

March 3, 2015

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**

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

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. m 7 < 6 (1 point) m < 1 m > 1 m &...

algebra. help! - 1. 3x+10≥4 a. x≥-2 b. x≤ 2 c. x≤-2 d. x...

PRE-ALGEBRA MRS.SUE PLEASE!!!!!!!!! - 1. 5h 9 = 16 + 6h (1 point) 4 7 7 10 2...

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

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

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

Math - Solve the linear programming problem by the method of corners. Minimize C...