Consider the following linear programming problem:

Maximize X1 + 3X2

Subject to X1 - 3X2 <= 3

-2X1 + X2 <= 2

- 3X1 + 4X2 <= 12

3X1 + X2 <= 9

X1, X2 >= 0

b. Identify all the extreme points and reformulate the problem in terms of the convex combination of the extreme points. Solve the resulting problem.

C. Suppose the fourth constraint is removed. Identify the extreme points and the extreme directions, and reformulate the problem in terms of the convex combination of the extreme points and the nonnegative linear combination of the extreme directions.

d. Is the procedure in parts (b) and (c) practical for solving linear programs? Justify your answer.

Answer rating: 100% (QA)

b To identify the extreme points solv... View the full answer