Same chapter4 marksDifficulty: Hard
Maximise Z = 3x + 4y subject to x + y ≤ 4, x ≥ 0 and y ≥ 0.
Linear Programming
4 marksDifficulty: Hard
Minimise Z = 5x + 10y subject to x + 2y ≤ 120, x + y ≥ 60, x − 2y ≥ 0 and x, y ≥ 0.
Original Khojo Papers practice question — not from a past board paper.
Answer
The minimum is 300, at the point (60, 0).
No citable source has been recorded for this record. Treat it as practice material, not as fact.
Explanation
The corner points of the feasible region are (60, 0), (120, 0), (60, 30) and (40, 20). Evaluating Z at each gives 300, 600, 600 and 400 respectively, so the minimum is 300 at (60, 0).
Related questions
From the same topic and chapter, at a similar level.
Same chapter3 marksDifficulty: Medium
Define a convex feasible region and state why the optimum of a linear objective function occurs at a corner point.
Linear Programming
Same chapter3 marksDifficulty: Medium
Define the feasible region and the objective function of a linear programming problem, and state where the optimum occurs.
Linear Programming
Same subject4 marksDifficulty: Hard
A factory has two machines. Machine A makes 60% of the output with 2% defective, and machine B makes 40% with 5% defective. An item chosen at random is defective. Find the probability that it came from machine A.
Probability
Same subject4 marksDifficulty: Hard
A rectangle is to be made with a perimeter of 40 cm. Find the dimensions that give the greatest area.
Applications of Derivatives
Same subject
Write the smallest equivalence relation from the set
cos x
A to A, where A = {1, 2, 3}. (i) Evaluate: ∫ dx
3cos x - 5
0 1 -2
OR