Lalaji Memorial Omega International School Aca.

Year:2023 - 24

XII MATHEMATICS ASSIGNMENT 1

LINEAR PROGRAMMING PROBLEMS
1. Graphically solve the system of linear constraints 𝑥 − 𝑦 ≤ 2, 𝑥 + 𝑦 ≤ 4,
𝑥 ≥ 0, 𝑦 ≥ 0. Also mention the corner points of the shaded region.
Solve graphically the following linear programming problems:
2. Maximize Z = 50𝑥 + 15𝑦 subject to the constraints 5𝑥 + 𝑦 ≤ 100, 𝑥 + 𝑦 ≤
60, 𝑥, 𝑦 ≥ 0
3. Maximize Z = 3𝑥 + 4𝑦, if possible subject to the constraints 𝑥 − 𝑦 ≤ − 1,
− 𝑥 + 𝑦 ≤ 0, 𝑥, 𝑦 ≥ 0
4. Maximize 𝑍 = 3𝑥 + 5𝑦 such that 𝑥 + 2𝑦 ≤ 2000, 𝑥 + 𝑦 ≤ 1500, 𝑦 ≤ 600,
𝑥, 𝑦 ≥ 0
5. Minimize 𝑍 = 3𝑥 + 5𝑦 subject to the constraints −2𝑥 + 𝑦 ≤ 4, 𝑥 + 𝑦 ≥ 3,
𝑥 − 2𝑦 ≤ 2, 𝑥, 𝑦 ≥ 0
6. Maximize the objective function Z = 2𝑥 − 𝑦 subject to the constraints
3𝑥 + 2𝑦 ≤ 6, 𝑥 − 𝑦 ≥ 0, 𝑥 ≤ 4
7. Maximize the objective function 𝑍 = − 50𝑥 + 20𝑦 subject to the constraints
2𝑥 − 𝑦 ≥ − 5, 3𝑥 + 𝑦 ≥ 3, 2𝑥 − 3𝑦 ≤ 12, 𝑥, 𝑦 ≥ 0
8. Maximize and Minimize Z = 5a + 2b Subject to constraints −2𝑎 − 3𝑏 ≤ −6,
𝑎 − 2𝑏 ≤ 2, 3𝑎 + 2𝑏 ≤ 12, −3𝑎 + 2𝑏 ≤ 3, 𝑎, 𝑏 ≥ 0
9. Maximize Z = 5x + 7y Subject to the constraints 𝑥 ≥ 2, 𝑦 ≤ 6, 𝑥 + 2𝑦 ≥ 8,
𝑥, 𝑦 ≥ 0
CASE STUDY QUESTION:
10.Two tailors A and B are paid Rs 225 and Rs 300 per day respectively. A can
stitch 9 shirts and 6 pants while B can stitch 15 shirts and 6 pants per day.
(i) Form a linear programming problem to minimize the labour cost to
produce at least 90 shirts and 48 pants.
(ii) Solve the problem graphically.