Consider the following problem.
Maximize z = x1 + 2x2,
Subject to

and
x1 ‰¥ 0, x2 ‰¥ 0.

(a) Plot the feasible region and circle all the CPF solutions.

(b) For each CPF solution, identify the pair of constraint boundary equations that it satisfies.

(c) For each CPF solution, use this pair of constraint boundary equations to solve algebraically for the values of x₁ and x₂ at the corner point.

(d) For each CPF solution, identify its adjacent CPF solutions.

(e) For each pair of adjacent CPF solutions, identify the constraint boundary they share by giving its equation.

Transcribed Image Text:

ちs2 X + X2 s3