JEE Main · MathematicsHard
Find the maximum value of subject to , , .
- A.
- B.
- C.
- D.
Show correct answer & step-by-step solution
Correct answer: A —
Solution
- The constraints are and .
- The vertices are , , , and the intersection of and .
- Adding equations: .
- Subtracting: .
- At , .
- Hence the answer is (A).
Attempt this question & track your score
Sign up free to answer, get instant scoring, and let SolveGini track which Mathematics topics you need to revise.
Attempt & Track Free →More Linear Programming practice questions
- The corner points of the feasible region for an LPP are (0,0), (4,0), (2,4), and (0,2). What is the maximum value of Z =
- What is the objective function in a linear programming problem?
- Which of the following represents a constraint in a linear programming problem?
- If the feasible region of an LPP is unbounded, then the maximum value of the objective function:
- What is the feasible region in a linear programming problem?
- The feasible region for a linear programming problem is defined by x >= 0, y >= 0, 2x + 3y <= 6, and x + 4y <= 4. What i
- Find the maximum value of the objective function Z = 3x + 4y subject to the constraints x + y <= 4, x >= 0, and y >= 0.
- For the constraints x + y <= 5, x - y >= 0, x >= 0, y >= 0, what is the minimum value of Z = x + 2y?
- A linear programming problem has constraints x + 2y <= 8 and 3x + 2y <= 12 with x, y >= 0. What is the maximum value of
- If the constraints are x + y <= 10, x >= 2, y >= 3, what is the maximum value of Z = 5x + 2y?
- A linear programming problem has constraints x + y <= 1, 3x + y >= 3, x >= 0, y >= 0. What is the nature of the feasible
- Minimize Z = 3x + 5y subject to x + 3y >= 3, x + y >= 2, x, y >= 0.