[go: up one dir, main page]
Scribd
Upload
37 views2 pages

Questions For Practice - Graphical Method of LPP

The document presents a series of linear programming problems that require graphical solutions, including maximization and minimization objectives with various constraints. Each problem specifies the objective function and the constraints that define the feasible region. The problems involve two variables, x1 and x2, and require finding optimal solutions under specified conditions.

Uploaded by

Muskan Verma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
37 views2 pages

Questions For Practice - Graphical Method of LPP

The document presents a series of linear programming problems that require graphical solutions, including maximization and minimization objectives with various constraints. Each problem specifies the objective function and the constraints that define the feasible region. The problems involve two variables, x1 and x2, and require finding optimal solutions under specified conditions.

Uploaded by

Muskan Verma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

1.

Obtain graphically the solution to the following LPP:


Maximize Z = x1 + 3x2
Subject to
x1 + 2x2 ≤ 9
x1 + 4x2 ≤ 1
x1 –x2 ≥ 2
x1, x2 ≥ 0
2. Find the solution to the following LP problem.
Maximize Z= 10 x1 + 8x2
Subject to
2x1 +x2 ≤ 20
x1 + 3x2 ≤ 30
x1 -2x2 ≥ -15
x1, x2 ≥ 0

3. Solve graphically the following LP problem:


Maximize Z = 3x1 + 2x2
Subject to
2x1 + x2 ≤ 12
x1 + x2 ≤ 10
-x1 +3x2 ≥ 6
x1, x2 ≥ 0

4. Solve graphically the following LP problem


Minimize Z= 3x1 + 10x2
Subject to
15x1 + 4x2 ≥ 60
8x1 + 8x2 ≥ 40
4x1 + 16x2 ≥ 32
x1, x2 ≥ 0

5. Solve graphically the following LP problem.


Maximize Z = 4x1 + 3x2
Subject to
x1 + 3x2 ≥ 9
2x1 +3x2 ≥ 12
x 1 + x2 ≥ 5
x1, x2 ≥ 0
6. Solve graphically the following LPP:
Maximize Z= 10x1 -4x2
Subject to
2x1 -6x2 ≤ 0
-x1 + 2x2 ≥ -2
-3x1 -3x2 ≥ -24
x1 ≥ 2
x2 ≥0
7. Solve graphically the following LPP:
Minimize Z= 10x1 -4x2
Subject to
2x1 -6x2 ≤ 0
-x1 + 2x2 ≥ -2
-3x1 -3x2 ≥ -24
x1 ≥ 2
x2 ≥0
8. Solve graphically the following LPP:
Maximize Z= 4x1 +10 x2
Subject to
2x1 -6x2 ≤ 0
-x1 + 2x2 ≥ -2
-3x1 -3x2 ≥ -24
x1 ≥ 2
x2 ≥0
9. Solve the following linear programming problem:
Minimize Z = 12 x1 + 3x2
Subject to
4x1 + 6x2 ≥ 24000
x1 + x2 ≥ 5000
8x1 + 2x2 ≥ 16000
x1, x2 ≥ 0

10. A firm makes two products X and Y, and has a total production capacity of 9 tonnes per day,
X and Y requiring the same production capacity. The firm has a permanent contract to supply
at least 2 tonnes of X and at least 3 tonnes of Y per day to another company. Each tonne of X
requires 20 machine hours’ production time and each tonne of Y requires 50 machine hours’
production time. The daily maximum possible number of machine hours is 360. All the firm’s
output can be sold, and the profit made is Rs.80 per tonne of X and 120 per tonne of Y. It is
required to determine the production schedule for maximum profit and to calculate this
profit. Use Graphical method to get the solution.

You might also like