Date:26/12/2023
“LINEAR PROGRAMMING ”
1. Minimize Z = 500x + 400y
Subject to constraints
x + y ≤ 200
x ≥ 20
y ≥ 4x
y≥0
Solve the above L.P.P graphically.
2. Maximize Z = 3x + 9y
Subject to constraints
x + 3y ≤ 60
x + y ≥ 10
x≤y
x, y ≥ 0
Solve the above L.P.P graphically.
3. Maximize Z = x + 2y
Subject to constraints
x + 2y ≥ 100
2x − y ≤ 0
2x + y ≤ 200
x, y ≥ 0
Solve the above L.P.P graphically.
4. Maximize Z = 7x + 10y
Subject to constraints
4x + 6y ≤ 240
6x + 3y ≤ 240
x ≥ 10
x, y ≥ 0
Solve the above L.P.P graphically.
5. Minimize Z = −50x + 20y
Subject to constraints
2x − y ≥ −5
3x + y ≥ 3
2x − 3y ≤ 12
x, y ≥ 0
Solve the above L.P.P graphically.
6. Minimize Z = 3x + 2y
Subject to constraints
x+y ≥8
3x + 5y ≤ 15
x, y ≥ 0
Solve the above L.P.P graphically (If possible).
7. Minimize Z = 3x + 5y
Subject to constraints
x + 2y ≥ 10
x+y ≥6
3x + y ≥ 8
x, y ≥ 0
Solve the above L.P.P graphically.