Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 Mathematical Science LPP, Simplex Methods, Duality
Consider the following system of linear equations which are constraints of a linear programming problem:
x + 2y + z = 4
2x + y + 2z = 5
x ≥ 0, y ≥ 0, z ≥ 0
The objective function to be maximized is Z = 3x + 2y + 4z. How many basic feasible solutions does this linear programming problem have?
1
1
2
2
3
3
4
4
5
Question Not Attempted