Question

For the constraint of a linear optimizing function z = 3x₁ + 11x₂, given by 2x₁ + x₂ ≤ 2, 4x₁ + x₂ ≥ 4 and x₁, x₂ ≥ 0 

Options

• There are two feasible regions

• There are infinite feasible regions

• There is no feasible region

• None of these

Answer 1

There is no feasible region.

Explanation:

Feasible region lies on origin side of line 2x₁ + x₂ = 2 and non-ongm side of line 4x₁ + x₂ = 4 in first quadrant.

∴ There is no feasible region.