3 (Sem-s) MAT M 6

2AL4
MATHEMATICS

( Major )

Paper :'5.6

FUII Marks : 6O

Time :3 hours
Tlrc figures in the margin indicate full marks
for the questions
1. Choose the correct option for each of the
following statements : Ix7=7
(a) The set of simultaneous equations
xt +2x, = B, 3x1 * x2 =9, x, + x2 =4
is
0 consistent
(iE inconsistent
(iiri None of the above
(b) The set of points
(1, 3,2), (I, - 7, - B) and Q, I, -1l'

in R3is
(L) linearly dependent
(i4 linearly independent
(illi None of the above
A15-120O I L46 ( Turn Cuer )
 (2) (3)

(f) At any iteration of the usual simplex

(c) A simplex in n-dimension is a convex
method, if there is at least one basic
polyhedron having variable in the basis at zera level'and all
z j -c j >0, the current solution is
0 n-1 vertices
(t) infeasible
(iL) n vertices
(it) unbounded
(iii) n+l vertices (iii) non-degenerate
(iu/ None of the above /iu,) degenerate
(zi, ci having usual meaning)
(d) Let X = {x1, x2} - R2. Then the convex
(s) A feasible solution to an LPP
hull C (X) of X is
0 must satisfy all of the probietns
(t) {}"x, + (I - tu)xr: }' > 1} constraints simultaneously
(i4 {}"x, + (1 - tr)x, : }. < 0} (iL) must be a corner point of the
feasible region
(iii) l)"xt+(1 -1.)x, : 0 < l. < 1)
liif need not satis$r all of the
(iul None of the above constraints
(iu/ must optimize the value of the
(e) A linear programming problem (LPP)
objective function
must have
0 an objective (goal) that we aim to 2: (a) Justify each of the following
maximize or minimize statements : 2x2=4

(it) constraints (restrictions) that we 0 The set

need to sPecifY S = {(xr, x2l: x1, x, e )R, x1, x2 > O, xl xz > I}
(iiil decision variables (activities) that is convex in ]R2.
we need to determine (iE Let S and T be two convex sets

(iu) AII of the above in lR". Then for any scalars cr, B e lR,
crS+0? is also convex in lR".

( Continued
,4'15-12001146 ( Turn Ouer )
A15-12001146 )
 t4l (5)

(b) Answer each of the follorving questions : (c) Explain what you mean by feasible
, 2x2=4 solution and basic feasible solution.
0 Find the extreme points of the Describe briefly the method of reducing
convex polygon defined by the a feasible solution to a basic feasible
inequalities solution of an LPP
2xr+xr+9>O Max Z =CX
-x, +3x2 +6 > 0 subject to
xr+2x2 -3 <0 AX=b
xr+xr<a x>o
(i4 Show that the linear function under the assumption that the system
Z=CX,XelR",Ce]R has at least one t'easible solution.
is a convex function (d) If xr-1, x2=2, x3=1, x4=3 is a
feasible solution of the set of equations
3.' Answer any three of the following :
Sxr-4x, +3x. +xo -3
5x3= 15 2xt + x2 +5x3 -3xo =g
(a) Find all basic feasible solutions of the xr +6x2 -4xs +2xo =15
system of equations
X1t X2> X3, X4 )0
xr+2x2 +3x3 *4xo =f
then find a basic feasible solution of the
2x, + x2 + x.s *2xo = J system.
(b) Find graphically the maximum of (e) Prove that any convex combination of k
Z =2x +3y subject to diflerent optimum solutions to an Lpp
x+y<3O
Max Z=CX, CXTe R"
y>3
O<g<12 subject to
x-92.O '4.Y =
b

and O< x<2O

x>0
is again an optimum solution to
the LPP.

A15-1200lt46 ( Continued ) A15-1200I L46 , ( Turn Ouer )

 t6) t7l
4. Prove that if either the primal or the dual
Or
problem of an LPP has a finite optimal
solution, then the other problem also has a Use duality to solve the LPP
finite optimal solution. MaxZ=2x1 +x2
Furthermore, the optimal values of the subject to the constraints
objective function in both the problems are x, +2x" <IO
the same, i.e. xr+xr<6
MaxZ*-MaxZ* 10 x1 -x2<2
x, -2x, < I
Or x1,X2)O

Use simplex method to solve the LPP 6. A company has three plants at locations A, B
Max Z =4xt+IOxz and Cwhich supply to warehouses iocated at
subject to the constraints D,E,F, G and H. Monthly plant capacities
2x, +x2 < 5O
are 8O0, 50O and 900 units respectively.
Monthly warehouse requirements are 4OO,
2x1+5x2 <100 400, 50O, 6O0 and 800 units respectively.
2x, +3x2 <90 Unit transportation costs (in rupees) are
X1, X2 2O given below :

to
5. Use the two-phase simplex method to solve
D E F G H
Max Z =Sxt-4xz +3xa
A q
8 6 6 3
subject to the constraints From
B 4 7 6 5
2x, + x2 -6x, =)g
C 8 4 6 6 A
6x, + 5x, +lOx3 376 "

Bxr - 3x, +6x3 S 50 Determine an optimum distribution for the

X1, X2> Xg > 0 10 company in order to minimize the total
transportation cost. 10

A15-1200 | L46 ( Continued )

A15-1200 I L46 (Turn Ouer )
 (8)

Or
Solve the following assignment problem :

Project

ABCD
7
f 1210108
2 14 Not suitable 15 11
Engineer
3 610L64
81097

***

A15-12O0 11,46 3 (Sem-S) MAT M 6