Consider the following Linear Programming Problem (LPP):

Home » Industrial Engineering » Industrial Engineering Miscellaneous » Question

Consider the following Linear Programming Problem (LPP):
Maximize z = 3x₁ + 2x₂,
Subject to x₁ ≤ 4
x₂ ≤ = 6
3x₁ + 2x₂ < 18
x₁ ≥ 0, x₂ ≥ 0

1. The LPP has a unique optimal solution
2. The LPP is infeasible
3. The LPP is unbounded
4. The LPP has multiple optimal solution

Correct Option: D

z= 3 × 1 + 2 × 2
x₁ ≤ 4
x₂ ≤ 6
3x₁ + 2x₂ ≤ 18
x₁, x₂ ≥ 0

The objective function is parallel to constraint. Therefore multiple solution can be obtained.