Scribd
Upload
48 views16 pages

Simplex Method For LPP

The document provides examples of linear programming problems (LPP) involving maximization or minimization of objective functions subject to constraints. The simplex method is used to solve the LPPs. There are examples of LPP formulations for production problems involving multiple products with resource constraints. Practice questions on applying the simplex method to additional LPPs are also provided.

Uploaded by

Mohit Bakshi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
48 views16 pages

Simplex Method For LPP

The document provides examples of linear programming problems (LPP) involving maximization or minimization of objective functions subject to constraints. The simplex method is used to solve the LPPs. There are examples of LPP formulations for production problems involving multiple products with resource constraints. Practice questions on applying the simplex method to additional LPPs are also provided.

Uploaded by

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

SIMPLEX METHOD FOR LPP

Q1: Maximize Z = 30x + 25y

Subject to the Constraint:

2x + 3y <= 40
4x + 2y <= 50
5x + 2y <= 60
x,y >= 0
Q2: Maximize Z = 50x + 30y

Subject to the Constraint:

2x + y >= 18
x + y >= 12
3x + y <= 34
x,y >= 0
Q1: Maximize Z = 7x + 10y

Subject to the Constraint:


x + y <= 300
y <= 120
x >= 60
x >= y
x,y >= 0

Q3: Maximize Z = 7x + 9y

Subject to the Constraint:


x+y=6
4x <= 16
5y <= 20 x,y >= 0

Q5: Maximize Z = 5x + 7y

Subject to the Constraint:


x + y <= 10
3x + 4y >= 34
8x + 5y <= 68 x,y >= 0
Q2: Maximize Z = 17x + 27y

Subject to the Constraint:


2x + 3y >= 18
2x + y >= 10
x + y <= 8
x,y >= 0

Q4: Maximize Z = 4x + 6y

Subject to the Constraint:


x+y=5
x >= 2
x <= 4 x,y >= 0

Q6: Maximize Z = 9x + 7y

Subject to the Constraint:


x + 4y <= 500
x <= 175
y <= 100
7x + 4y <= 1400
4x >= y x,y >= 0
MINIMIZATION CASES:
Q1: Minimize Z = 20x + 30y

Subject to the Constraint:

X + Y >= 50
X + 2Y >= 60
x,y >= 0

Q3: Minimize Z = 50x + 60y

Subject to the Constraint:


X + Y = 1000
X <= 300
Y >= 150
x,y >= 0
Q2: Minimize Z = 20000X + 25000Y + 30000A

Subject to the Constraint:


400X + 300Y + 400A >= 25000
300X + 300Y + 600A >= 27000
200X + 500Y + 400A >= 30000 x,y >= 0
Exceptional Cases:
Q1: Minimize Z = 2x + 5y

Subject to the Constraint:


2x + 5y <= 50
2x + y <= 100
2x + 3y <= 90 x,y >= 0

Q3: Maximize Z = 15x + 60y

Subject to the Constraint :


9x + 3y <= 45
x + y >= 40
x,y >= 0
Q5: Maximize Z = 9x + 7y

Subject to the Constraint:


x + 4y <= 60
x <= 20
y >= 30 x,y >= 0

Q7: Minimize Z= 9x + 6y

Subject to the Constraint:


5x + 8y >= 30
x + 2y <= 20
2x + y <= 30
4x + 5y >= 62 x,y >= 0
Q2: Maximize Z = 5x + 6y

Subject to the Constraint:


9x - 2y <= 5
4x - y <= 3 x,y >= 0

Q4: Maximize Z = x + 3y

Subject to the Constraint:


x + 4y <=8
x + 2y <= 4
x,y >= 0
Q6: Minimize Z = 3x + 2y

Subject to the Constraint:


-2x + 3y <= 9
3x - 2y <= - 20 x,y >= 0
PRACTICE QUESTIONS:
Q1: Maximize Z = x + 3y

Subject to the Constraint:


x + 4y <= 8
x + 2y <= 4 x,y >= 0

Q3: Maximize Z = 7x + 5y

Subject to the Constraint :


2x + 3y <= 200
3x + 5y <= 300 x,y >= 0

Q5: A firm is engaged in producing two products A and B. Each unit of product A requires 3 kg of raw material and 2 labo
each unit of B requires 2 kg of raw material and 3 labour hours for the same type . Every day, the firm has an availab
80 labour hours . One unit of product A, when sold yields Rs 50 and one unit of product B, when sold yields Rs 40 as
Formulate as a LPP and solve to determine the units of each product that should be produced per day so as to maxim

Q6: X Y S1 S2 A1 A2 Bi
1 1 0 0 1 0 5
1 0 1 0 0 0 4
0 1 0 -1 0 1 2
Cj 5 8 0 0 M M

Write the Original LPP and find its optimum solution by Simplex Method.
Q2: Maximize Z = x + y

Subject to the Constraint :


2x + 3y <= 20
2x + 5y <= 30 x,y >= 0

Q4: Maximize Z= 10x + 12y

Subject to the Constraint:


x+y=5
x >= 2
y <= 4 x,y >= 0

s 3 kg of raw material and 2 labour hours for processing, whereas


very day, the firm has an availability of 70 kg of raw material and
uct B, when sold yields Rs 40 as profit.
produced per day so as to maximize profit by using simplex method.

You might also like