BITSAT 2018
- Exam
- BITSAT
- Year
- 2018
- Subject
- Mathematics
- Chapter
- Linear Programming
BITSAT 2018 · Mathematics · Linear Programming
The maximum value of Z = 4x + 2y subject to constraints 2x + 3y ≤...
The maximum value of subject to constraints and & is

Options
- A
- B
- C
- DNone of these
Correct answer
D. None of these
Step-by-step solution
We have,
And,
Let
Then the feasible region is

From the figure, it is clear that there is no common area. So, we cannot find maximum value of~.
Hence, option is correct.