-
A linear programming problem is shown below:
Maximise 3x + 7y
Subjeot to 3x + 7y ≤ 10
4x + 6y ≤ 8
x, y ≥ 0
-
- an unbounded objective function
- exactly one optimal solution
- exactly two optimal solution
- infinitely many optimal solution
Correct Option: B
z = 3x + 7y
Constraints 3x + 7y ≤ 10
4x + 6y < 8; x, y > 0
Corresponding equations
3x + 7y = 10; 4x + 6y = 8 
A (0, 4/3) z = 9.23
B (2, 0) z = 6
Thus, exactly one optimal solution.
Hence, the correct option is (b).
