Bitsat
Linear Programming
BITSAT 2021
MCQ+3 / -12021
The linear programming problem minimize z = 3x + 2y subject to constrains x + y \(\ge\) 8, 3x + 5y \(\ge\) 15, x \(\ge\) 0 and y \(\ge\) 0, has
Bitsat
BITSAT 2021
The linear programming problem minimize z = 3x + 2y subject to constrains x + y \(\ge\) 8, 3x + 5y \(\ge\) 15, x \(\ge\) 0 and y \(\ge\) 0, has