1

MAL210: Tutorial Sheet-2

1. Without sketching the graph nd all the vertices of the set of feasible solutions of
x
1
+ x
2
1
2x
1
x
2
2
x
1
, x
2
0.
2. Use the simplex method to nd a corner point of the region given by
x
1
+ x
2
1
x
1
+ x
2
2
x
1
, x
2
0
3. Let S = {(x
1
, x
2
) : x
1
x
2
4, x
1
+ x
2
3, x
2
8}. Find all extreme points of S and hence
express the point (2, 1) as a convex combination of these extreme points.
4. Use the simplex method to verify that the following LPP has unbounded solution
Max x
1
+ 2x
2
subject to
2x
1
+ x
2
+ x
3
2
x
1
+ x
2
x
3
1
x
1
, x
2
, x
3
0.
From the nal simplex tableau construct a feasible solution for which the objective function
is greater than 2000.
5. The optimal simplex tableau of a LPP is
x
B
y
(1)
y
(2)
y
(3)
y
(4)
x
2
= 6 0 1 2 1
x
1
= 2 1 0 1 1
26 0 0 2 1
Given that x
3
and x
4
are slack variables and the starting basis was (x
3
, x
4
)
T
, write the original
LPP.
6. The following is the current simplex tableau of a LPP in the maximization form
x
B
y
(1)
y
(2)
y
(3)
y
(4)
y
5
y
6
y
7
x
1
= c 1 0 0 0 a 3 2
x
2
= f 0 1 0 0 2 d 1
x
3
= 1 0 0 1 0 1 0 g
x
4
= 3 0 0 0 1 4 1 6
z = 5 0 0 0 0 3 4 1
Determine the conditions on a,c,d,f,g so that the current tableau and the updated tableau
represent respectively
1. Non-degenerate and degenerate b.f.ss.
2. Non-degenerate and non-degenerate b.f.ss.
3. Degenerate and non-degenerate b.f.ss.
4. Degenerate and degenerate b.f.ss.
2
7. Solve the following linear programming problem by the simplex method. Also, at each iteration
identify B and B
1
.
Max 3x
1
+ 2x
2
+ x
3
subject to
2x
1
3x
2
+ 2x
3
3
x
1
+ x
2
+ x
3
5
x
1
, x
2
, x
3
0 .
8. Solve the following problem by the simplex method starting with the corner point (4, 2) and
show the movement graphically
Max x
1
+ 3x
2
subject to
x
1
+ x
2
2
x
1
+ 2x
2
8
2x
1
x
2
6
x
1
, x
2
0 .
9. Use the simplex method to show that the following LPP has unbounded solution
Max 4x
1
+ 3x
2
subject to,
x
1
+ x
2
8
2x
1
+ x
2
10
x
1
, x
2
0.
Hence obtain a feasible solution for which the given objective function takes the value 300.
10. Solve the following problem by the simplex method starting with the b.f.s corresponding to
the corner point (x
1
, x
2
) = (4, 0)
Max x
1
+ 2x
2
subject to
3x
1
+ 4x
2
= 12
2x
1
x
2
12
x
1
, x
2
0
11. Let following be the simplex tableau of a LPP at some iteration
x
B
y
(1)
y
(2)
y
(3)
y
(4)
x
3
= a 0 c 1 1
x
1
= b 1 1 0 2
0 d 0 e
State all possible values of a, b, c, d and e in each of the following so that the given statement
is true
1. the current solution is optimal
2. the given LPP has unbounded solution
3. the current solution is not optimal but the objective function value can be increased by
replacing x
3
by x
2
.
4. the current solution is optimal but the LPP has many optimal solutions
12. Let it be known that The system of linear equations Ax = b is consistent if and only if Rank
A = Rank(A : b). Hence or otherwise, use the simplex algorithm to check that the matrices
(
1 1
2 1
)
and
(
1 1 4
2 1 2
)
have the same rank.
3
13. Use the simplex method to nd all optimal solutions of the LPP
Min 2x
1
4x
2
subject to
x
1
+ 2x
2
4
x
1
x
2
1
x
1
, x
2
0
Verify your answer graphically.
14. Use the simplex method to show that the system of linear equations
x
1
+ x
2
= 4
2x
1
+ x
2
= 2
x
1
, x
2
0
is consistent and hence obtain a solution of the given system.
15. Two consecutive simplex tableaus of a given LPP are
x
B
y
(1)
y
(2)
y
(3)
y
(4)
y
(5)
x
4
= 6 b c d 1 0
x
5
= 1 1 2 e 0 1
0 a 1 3 0 0
x
B
y
(1)
y
(2)
y
(3)
y
(4)
y
(5)
x
1
= f g 2/3 2/3 1/3 0
x
5
= 3 h 1 1/3 1/3 1
2 0 1/3 j k 0
Find the value of a, b, c, d, e, f, g, h, i, j and k.
16. Use the simplex method to verify that the following LPP has unbounded solution
Max 2x
1
+ 3x
2
subject to
x
1
x
2
+ x
3
2
3x
1
+ x
2
4
x
1
, x
2
0.
Hence nd a feasible solution for which the value of the objective function is greater than 248.
17. In a simplex tableau if (z
j
c
j
) = 10 for a non basic variable x
j
. Find the change in the
objective function value if x
j
enters the basis and it is given that the minimum ratio is 2 in
the pivot.
18. Use the simplex algorithm to nd a solution of the system
x
1
+ x
2
= 2
2x
1
+ x
2
= 12 .
Does the system have only one solution? How does it get checked by the simplex method.
19. Consider the optimization problem
Max

n
j = 1
|c
j
x
j
+
j
|
subject to

n
j = 1
a
i j
x
j
b
(i)
(i = 1, 2, . . . , m)
1. Is the above a LPP? Give reasons.
4
2. Can this be transformed into a LPP so as to solve the same by the simplex method. Verify
your answer for the problem
Max 5|x
1
| + 6|x
2
|
subject to
3x
1
+ 4x
2
6
x
1
+ 3x
2
2.
20. Are the following statements true? Give reasons for your answer
1. The system of equations x
1
+ x
2
+ x
3
= 3, x
1
x
2
x
4
= 0, x
1
, x
2
, x
3
0, has three
degenerate b.f.s.
2. For the LPP Max 4x
1
+3x
2
5x
3
, subject to 4x
1
+x
2
+6x
3
12, x
1
, x
2
0 x
3
unrestricted
in sign, the optimal solution (x

1
, x

2
, x

3
) can never have x

1
> 0 and x

2
> 0.
3. The set S = {(x
1
, x
2
) : x
1
0, x
2
0, x
1
+ x
2
1} is a polyhedron but not a polytope.
4. The set S = {(x
1
, x
2
) : x
1
1 or x
2
1} can never be the feasible region of a LPP.
5. For the constraints x
1
x
2
+ x
3
= 2, x
1
, x
2
x
3
0, the point (x

1
= 4, x

2
= 2, x

3
= 0) is
a b.f.s.
6. Let f : [a, b] R be given by f (x) = mx +c. If f attains its minimum at a point x

(a, b)
then m = 0.
7. The problem Max z = 4x
1
+ 3x
2
subject to |x
1
x
2
| 1 is a LPP.
8. The set S = {(x
1
, x
2
) : x
2
1
+ x
2
2
4, x
2
2
x
1
} is a convex set.
21. Construct an example of each of the following (if no such example is possible then state reasons
for the same)
1. a convex set in R
3
having four corner points.
2. a LPP having exactly 2 optimal solutions
3. a closed half space in R
2
4. a LPP in which more than one degenerate b.f.s. correspond to the same corner point
5. a simplex in R
6. a nonconvex set which is the intersection of two polytopes
7. an optimal solution which is not a b.f.s.
8. a LPP having non-convex feasible region.