D 10669 (Pages : 4) पपि या © ०००००००००००००००००००००००००००००००००००००००००

FIFTH SEMESTER U.G. DEGREE EXAMINATION, NOVEMBER 2021
(CBCSS—UG)
Mathematics
MTS 5B 08—LINEAR PROGRAMMING
(2019 Admissions)
Time : Two Hours Maximum : 60 Marks
Section A

Answer at least eight questions.
Each question carries 3 marks.
All questions can be attended.

Overall Ceiling 24.

1. Define canonical minimization linear programming problem.

2. Give an example of a bounded polyhedral convex subset in R?,

3. State the canonical minimization linear programming problem represented by the following
tableau :

4. Define unbounded linear programming problem.
Pivot on 5 in the canonical maximum tableau given below :

21 Xo -1

6. Write the simplex algorithm for maximum tableaus.
7. What do you mean by complementary slackness ?

8. State Duality theorem.

Turn over

16040