Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
4 views

Tutorial 5 Linear Programming Problems

The document presents a tutorial on linear programming problems, including various optimization tasks such as maximizing and minimizing objective functions under specific constraints. It includes questions on finding basic solutions, feasible solutions, dual linear programming problems, and methods like the simplex method and Big M method. Each question requires solving different linear programming scenarios with provided equations and inequalities.

Uploaded by

varad04naik
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Tutorial 5 Linear Programming Problems

The document presents a tutorial on linear programming problems, including various optimization tasks such as maximizing and minimizing objective functions under specific constraints. It includes questions on finding basic solutions, feasible solutions, dual linear programming problems, and methods like the simplex method and Big M method. Each question requires solving different linear programming scenarios with provided equations and inequalities.

Uploaded by

varad04naik
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

TUTORIAL 5

Linear Programming Problems

Q.1 Maximize 𝑧 = 2𝑥1 − 3𝑥2 + 4𝑥3 − 5𝑥4


Subject to 𝑥1 + 4𝑥2 − 2𝑥3 + 8𝑥4 = 2 ;
−𝑥1 + 2𝑥2 + 3𝑥3 + 4𝑥4 = 1;
𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 ≥ 0.
Then find i) all basic solutions ii) all basic feasible solutions iii) Degenerate solution
iv) Optimal value of z .

Q.2 Solve the following by simplex method.


Maximize 𝑧 = 𝑥1 + 3𝑥2
Subject to −𝑥1 + 2𝑥2 ≤ 2;
𝑥1 − 2𝑥2 ≤ 2;
𝑥1 , 𝑥2 ≥ 0.

Q.3 Obtain the dual LPP


Maximize 𝑧=2𝑥1 +𝑥2 +5𝑥3
Subject to 𝑥1 +𝑥2 +𝑥3 =10
4𝑥1 −𝑥2 +2𝑥3 ≥12
3𝑥1 +2𝑥2 −3𝑥3 ≤6
𝑥1 , 𝑥2 , 𝑥3 ≥0.

Q4 Using dual Simplex method solve the LPP.


Minimize 𝑧=4𝑥1 +2𝑥2
Subject to 𝑥1 +2𝑥2 ≥2
3𝑥1 +𝑥2 ≥3
4𝑥1 +3𝑥2 ≥6
𝑥1 , 𝑥2 ≥0.
Q.5 Use Big M method to solve the following
Minimize 𝑧=4𝑥1 +𝑥2
Subject to 3𝑥1 +𝑥2 =3
4𝑥1 +3𝑥2 ≥6
𝑥1 +2𝑥2 ≤4
𝑥1 , 𝑥2 ≥0.

You might also like