engineering recuitment HAL Management & Design Trainee Mock Test 2023 Industrial Engineering Operations Research Linear Programming
Consider the Linear Programming problem:
Maximize: 7X1 + 6X2 + 4X3
subject to:
X1 + X2 + X3 ≤ 5;
2X1 + X2 + 3X3 ≤ 10,
X1, X2, X3 ≥ 0 (Solve by algebraic method).
The number of basic solutions is:
1
10
2
7
3
9
4
8