Unformatted text preview: the corners were traversed. 2. Solve the LP problem maximize 3 x 1 + 2 x 2 subject to x 1 + x 2 ≤ 2 2 x 1x 2 ≥ 6 and x 1 , x 2 ≥ 3. Solve the LP problem maximize 2 x 1 + x 2 + 3 x 3 + 2 x 4 subject to x 12 x 2 + x 32 x 4 ≤ 12 3 x 1 + 4 x 22 x 3 + 5 x 4 ≥ 20 and x 1 , x 2 , x 3 , x 4 ≥ 4. Solve the LP problem maximize x 1 + 5 x 2 + 2 x 3 subject to 4 x 1 + x 2 + 3 x 3 ≤ 6 x 1 + 4 x 2 + 2 x 3 ≥ 8 3 x 1 + 2 x 2 + 6 x 3 ≤ 12 and x 1 , x 2 , x 3 ≥ 1...
View
Full Document
 Fall '07
 farmer
 Economics, Operations Research, Linear Programming, Optimization, LP problem, Basic Feasible Solutions

Click to edit the document details