Not the exact question you were looking for?

Paste your question to our Mathbee AI Mentor below to get an instant step-by-step solution.

Linear Programming
NCERT Exemplar Class 12
CBSE
Grade 12

Question:

Solve LPP: Maximize $Z = 3x + 2y$ subject to $x + 2y \le 10, 3x + y \le 15, x, y \ge 0$.

Step-by-Step Solution

Given: Solve LPP: Maximize $Z = 3x + 2y$ subject to $x + 2y \le 10, 3x + y \le 15, x, y \ge 0$.
Step 1: Formulate initial mathematical setup / substitution:
Given equation / conditions:
$$Corner points (0,0):0, (5,0):15, (4,3):18, (0,5):10. Max Z$$
[1.0 Mark]
Step 2: Perform intermediate algebraic / calculus operations:
Executing the step-by-step reduction:
$$18 at (4, 3).$$
[1.0 Mark]
Step 3: Evaluate final values / boundary conditions:
Substituting limits or solving the simplified system:
$$18 at (4, 3).$$
[1.0 Mark]
Conclusion: The final evaluated answer is 18 at (4, 3)..

---
🎯 Official CBSE Marking Scheme:
Formulating mathematical relation: 1.0 Mark
Executing algebraic/calculus operations: 1.0 Mark
Evaluating final solution/vector: 1.0 Mark

Correct Answer:
Mathbee AI Mentor (Free Demo)

Confused by the solution? Ask the AI to explain a specific step, tell you where you went wrong, or break down the key trap in this question.

Master Linear Programming with Mathbee

Practice this topic under real exam conditions with strict timers, or ask our AI Mentor to explain the concepts step-by-step.

Start Practicing for Free