Professional Documents
Culture Documents
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.