Scribd
Upload
3 views2 pages

Tutorial No. - IV & V

The document contains a tutorial on Linear Programming Problems (LPP) and Non-Linear Programming Problems (Non-LPP), providing various optimization problems to solve using methods like Simplex, Penalty (Big-M), and Dual Simplex. It includes specific problems with their constraints and expected answers for maximization and minimization. Additionally, it outlines tasks involving Lagrange's multipliers and Kuhn-Tucker conditions for non-linear optimization.

Uploaded by

sajidshaikh06501
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
3 views2 pages

Tutorial No. - IV & V

The document contains a tutorial on Linear Programming Problems (LPP) and Non-Linear Programming Problems (Non-LPP), providing various optimization problems to solve using methods like Simplex, Penalty (Big-M), and Dual Simplex. It includes specific problems with their constraints and expected answers for maximization and minimization. Additionally, it outlines tasks involving Lagrange's multipliers and Kuhn-Tucker conditions for non-linear optimization.

Uploaded by

sajidshaikh06501
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

Tutorial No.

04 (LPP)
1. Determine all basic solutions to the following problem. Which of them are
basic feasible, degenerate, infeasible basic and optimal basic feasible
solutions?
Maximise z = x1 − 2x2 + 4x3
subject to x1 + 2x2 + 3x3 = 7
3x1 + 4x2 + 6x3 = 15
2. Solve by using Simplex method.
Maximise 𝑧 = 3𝑥1 + 2𝑥2
subject to 𝑥1 + 𝑥2 ≤ 4
𝑥1 − 𝑥2 ≤ 2
𝑥1 , 𝑥2 ≥ 0 Ans. 𝑥1 = 3, 𝑥2 = 1, 𝑧𝑚𝑎𝑥 = 11
3. Solve by using Simplex method.
Maximise 𝑧 = 𝑥1 + 4𝑥2
subject to 2𝑥1 + 𝑥2 ≤ 3
3𝑥1 + 5𝑥2 ≤ 9
𝑥1 + 3𝑥2 ≤ 5
5 20
𝑥1 , 𝑥2 ≥ 0 Ans. 𝑥1 = 0, 𝑥2 = , 𝑧𝑚𝑎𝑥 =
3 3
4. Using Penalty (Big-M ) method to solve the following L.P.P.
Maximise 𝑧 = 3𝑥1 − 𝑥2
subject to 2𝑥1 + 𝑥2 ≥ 2
𝑥1 + 3𝑥2 ≤ 3
𝑥2 ≤ 4
𝑥1 , 𝑥2 ≥ 0 Ans.𝑥1 = 3, 𝑥2 = 0, 𝑧𝑚𝑎𝑥 = 9
5. Use Dual simplex method to solve the following LPP
Minimize 𝑧 = 6𝑥1 + 𝑥2
Subject to 2𝑥1 + 𝑥2 ≥ 3
𝑥1 − 𝑥2 ≥ 0
𝑥1 , 𝑥2 ≥ 0 Ans. 𝑥1 = 1, 𝑥2 = 1, 𝑧𝑚𝑖𝑛 = 7
6. Use dual simplex method, solve
Maximise 𝑧 = −2𝑥1 − 𝑥3
Subject to 𝑥1 + 𝑥2 − 𝑥3 ≥ 5
𝑥1 − 2𝑥2 + 4𝑥3 ≥ 8
𝑥1 , 𝑥2 , 𝑥3 ≥ 0 Ans. 𝑥1 = 0, 𝑥2 = 14, 𝑥3 = 9, 𝑧𝑚𝑎𝑥 = −9
************
Tutorial No. 05 (Non-LPP )

1) Find the relative maximum or minimum of the function

2) Using the Method of Lagrange’s multiplier solve the N.L.P

3) Using the Kuhn –Tucker conditions solve the N.L.P.P.

4) Using the Method of Lagrange’s multiplier

5) Using the Kuhn –Tucker conditions solve the N.L.P.P.

6) Using the Method of Lagrange’s multiplier

************

You might also like