Scribd
Upload
14 views3 pages

Optimization Techniques

This document is an examination paper for the MSc Mathematics program, specifically for the Optimization Techniques course. It consists of two parts: Part A with 15 short answer questions and Part B with 4 detailed questions, each requiring comprehensive answers. The exam covers various topics in optimization, including linear programming, transportation problems, and queueing theory.

Uploaded by

Jeethu Jose George
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
14 views3 pages

Optimization Techniques

This document is an examination paper for the MSc Mathematics program, specifically for the Optimization Techniques course. It consists of two parts: Part A with 15 short answer questions and Part B with 4 detailed questions, each requiring comprehensive answers. The exam covers various topics in optimization, including linear programming, transportation problems, and queueing theory.

Uploaded by

Jeethu Jose George
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

2215 M (Pages: 3) Reg. No. .................

Name ......................

MSc DEGREE EXAMINATION, SEPTEMBER 2021


Second Semester
MSc Mathematics
BMMM210: Optimization Techniques
(2019 Admission onwards)

Time: 3 Hours Maximum: 75 Marks

Part A
Answer any fifteen questions. Each question carries 1 marks.

1. Define a basic feasible solution of a linear programming problem.

2. Define slack and surplus variables

3. What is an unbounded solution of a linear programming problem?

4. If in the optimal solution of the modified problem of big M method, all artificial
variables are not zero then what can be concluded about the solution of the original
problem?

5. If the primal is feasible and dual has no feasible solution then what can be concluded
about the optimum value of the primal?

6. What makes a transportation problem balanced?

7. What is a loop in a transportation array?

8. Write the general form of an assignment problem?

9. What is degeneracy in transportation problems?

10. What is the number of basic variables in an assignment problem?

11. Define saddle point.


Pm
12. What is the relation between the saddle point of f (X)+ i=1 yi gi (X) and the minimal
point of f (X); X ∈ En .

13. How does quadratic programming problem differ from linear programming problem?

14. Give an example of a convex function and verify it.

15. What do you understand by queue discipline?

16. Which disrtibution exhibits memoryless property.

17. Graphically represent the relation between average system size and the queue utiliza-
tion.

18. Write the detailed balanced equation.

(15×1=15)

Turn over
(Page 2 of 3)

Part B
Answer any four questions. Each question carries 15 marks.

19. (a) (i) Explain the primal dual relationship


(ii) Use dual simplex method to solve the problem
Maximize Z = −3x1 − x2
subject to the constraints
x1 + x2 greater than or equal to 1
2x1 + 3x2 greater than or equal to 2
x1 , x2 greater than or equal to 0

OR

(b) (i) Explain the standard form of a linear programming problem


(ii) Use big M method to maximize Z = 3x1 + 2x2 + 3x3
subject to the constraints
2x1 + x2 + x3 less than or equal to 2
3x1 + 4x2 + 2x3 greater than or equal to 8
x1 , x2 , x3 greater than or equal to zero

20. (a) A batch of five jobs (Ji ) can be assigned to five different machines. The set- up
time for each job on each machine is given in the following table. Find an optimal
assignment of jobs to machines which will minimise the total set -up time.
J1 J2 J3 J4 J5
A 10 3 3 2 8
B 9 7 8 2 7
C 7 5 6 2 4
D 3 5 8 2 4
E 9 10 9 6 10
A company wishes to manufacture 5 Products A,B,C,D and E in its three work-
shops W1 , W2 , W3 whose production capacities are 90,40,60 units respectively. The
potential sales of the 5 products are 60,30,40,70,40 units respectively. Product D
can not be produced in W3 . What quantity of each product should be produced
at each workshop to minimize cost?
The producing cost per unit are given in the following table,
A B C D E
W1 14 19 20 16 21
W2 13 20 15 16 19
W3 18 15 18 20

OR

(b) A caterer needs clean table covers everyday for 6 days to meet a contract according
to the following schedule,
Days 1 2 3 4 5 6
Number of covers 50 60 80 70 90 100
The cost of a new cover is Rs 20 while washing charges are Rs 1 for return on the
fourth day or later, Rs 2 for return on the third day and Rs 3 for the next day.
Find the minimum cost schedule for the purchase and washing of the table covers,
assuming that after the end of the contract the covers are rejected.
(Page 3 of 3)

21. (a) Derive Kuhn - Tucker conditions for F (X, Y ) = f (x) + m i=1 yi gi (X), X ≥ 0,
P

Y ≥ 0, gi (X) ≤ 0. Where X ∈ En , f and gi are differentiable functions.


OR
(b) Find the optimumm value of Maximize f (X) = 3x1 + 6x2 − 3x21 − 2x22 − 4x1 x2
subject to 3x1 + 2x2 ≤ 4
x1 + x 2 ≤ 1
x1 , x 2 ≥ 0

22. (a) (i) Derive the formula for steady state probabilities in a single server queue
M/M/1, using probability generating function. Verify this formula using
iterative method.
(ii) The full steady solution for the M/M/1 system is a geometric probability
function. Justify.
(iii) Graphically explain the relation between average system size and queue uti-
lization.
(iv) Find the formula for Probability of atleast n customers in the M/M/1 system
in terms of traffic intensity.

OR

(b) (i) Draw the rate transition diagram for an M/M/c queue model.
(ii) Derive the formula for steady state Probabilities pn of an M/M/c queue
model.
(iii) The behaviour of pn as a random variable changes according to n. Justify.
(iv) Derive the formulas for average measures associated with the above queue
model.

(4×15=60)

You might also like