Scribd
Upload
53 views3 pages

(Spring19) - MTL 103 Tut2

The document provides 10 linear programming problems to solve graphically and find the basic feasible solutions. It also includes 3 additional problems: 1. To solve a multi-variable linear programming problem graphically and find the minimum value of the objective function subject to the given constraints. 2. To find all basic solutions to a system of 5 linear equations with 5 variables. 3. To determine the degenerate and non-degenerate basic feasible solutions to a system of inequalities graphically.

Uploaded by

Sanskriti Jain
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
53 views3 pages

(Spring19) - MTL 103 Tut2

The document provides 10 linear programming problems to solve graphically and find the basic feasible solutions. It also includes 3 additional problems: 1. To solve a multi-variable linear programming problem graphically and find the minimum value of the objective function subject to the given constraints. 2. To find all basic solutions to a system of 5 linear equations with 5 variables. 3. To determine the degenerate and non-degenerate basic feasible solutions to a system of inequalities graphically.

Uploaded by

Sanskriti Jain
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/ 3

MTL103: Tutorial Sheet-II

Graphical Method & Basic Feasible Solution

1. Solve the following LPPs graphically:

(1) Max z = 2x1 + x2


subject to
2x1 + x2 ≤ 4
−x1 + x2 ≥ 1
x1 , x2 ≥ 0.

(2) Max z = 2x1 + x2


subject to
x1 + x2 ≥1
−x1 + x2 ≥ 1
x1 , x2 ≥ 0.

(3) Max z = 2x1 + 4x2


subject to
3x1 + 5x2 ≤ 15
3x1 + 2x2 ≤ 12
x1 , x2 ≥ 0.

(4) Min z = x1 − 10x2


subject to
x1 − 5x2 ≥ 0
−x1 + 5x2 ≤ 5
x1 , x2 ≥ 0.

(5) Min z = x1 − 10x2


subject to
x1 − 5x2 ≥ 0
−x1 + 5x2 ≤ 5
x1 , x2 ≥ 0.

(6) Max z = 2x1 + 5x2


subject to
x1 + 2x2 ≤ 20
x1 + x2 ≤ 15
x2 ≤ 6
x1 , x2 ≥ 0.

1
(7) Max z = x1 + 2x2
subject to
x1 + x2 + x3 = 8
2x1 + x2 + x4 = 10
x1 , x2 , x3 , x4 ≥ 0.

(8) Max z = 6x1 − 2x2


subject to
x1 − x 2 ≤ 1
2x1 − x2 ≤ 6
x1 , x2 ≥ 0.

(9) Max z = 6x1 − 2x2


subject to
2x1 − x2 ≤ 2
x1 ≤ 4
x1 , x2 ≥ 0.

(10) Max z = x1 − 2x2


subject to
x1 + x2 ≥ 2
−x1 + x2 ≥ 1
x2 ≤ 3
x1 , x2 ≥ 0.

2. Solve the problem graphically:


Minimize 4x1 − 3x2
s.t 2x1 + x2 + x3 = 10
x1 + x2 + x4 = 7
2x1 + 3x2 − x5 = 12
xi ≥ 0, i = 1, ..., 5

3. Find all basic solutions of the following system of linear equations


(a) x1 + 2x2 + 3x3 + 4x4 = 7 (b) 8x1 + 6x2 + 12x3 + x4 + x5 = 6
2x1 + x2 + x3 + 2x4 = 3 9x1 + x2 + 2x3 + 6x4 + 10x5 = 11
x1 , x2 , x3 , x4 ≥ 0 x1 , x2 , x3 , x4 , x5 ≥ 0

4. Determine all degenerate and non-degenerate basic feasible solutions of the system
graphically

2x + 3y ≤ 21, 3x − y ≤ 15, x + y ≥ 5, y ≤ 5, ; x, y ≥ 0.

5. Identify the basic feasible solutions for the system


x1 + 4x2 + x3 = 8
x1 + 2x2 + x4 = 4
x1 , x 2 , x 3 , x 4 ≥ 0

2
6. Find all degenerate b.f.s of the system

x 1 + x2 + x3 = 3
x1 − x2 + x4 = 0
x1 , x2 , x3 , x4 ≥ 0.

You might also like