This document contains two assignment sets for the course MC0079 - Computer Based Optimization Methods, part of the Master of Computer Application program. It includes questions on mathematical modeling, linear programming, transportation problems, project management techniques like PERT, queuing theory and Erlang distributions. Students are required to answer all six questions in each assignment set worth 60 marks total.

1. Spring 2012
Master of Computer Application (MCA) – Semester IV
MC0079 – Computer Based Optimization Methods(Statistics Applied
OR)– 4 Credits
(Book ID: B0902)
Assignment Set – 1 (60 Marks)
Answer All Questions 6 X 10 = 60 Marks
1. Explain the structure of Mathematical model in OR.
2. Explain briefly the graphical method of analyzing a linear programming problem. Can a LPP
have unbounded solution?
3. Apply simplex procedure to solve the L.P.P. maximize z = 3x1 + 4x2 subject to 5x1 + 4x2
 200; 3x1 + 5x2  150; 5x1 + 4x2  100; 8x1 + 4x2  80, x1  0, x2  0.
4. Solve the following transportation problem
Destination
A B C D
Source I 21 16 25 13 11
II 17 18 14 23 13 Availability
III 32 27 18 41 19
Requirement 43
6 10 12 15
5. Explain Project Management (PERT).
6. Explain the use of finite queuing tables

2. Spring 2012
Master of Computer Application (MCA) – Semester IV
MC0079 – Computer Based Optimization Methods(Statistics Applied
OR)– 4 Credits
(Book ID: B0902)
Assignment Set – 2 (60 Marks)
Answer All Questions 6 X 10 = 60 Marks
1. A furniture manufacturing company plans to make two products chairs and tables from
its available resources, which consists of 400 board feet of wood and 450 man-hours.
To make a chair it requires 5 board feed and 10 man-hours and yields a profit of Rs.45.
Each table uses 20 board feet and 15 man-hours and has a profit of R's.80. How
many chairs and tables, the company can make so that it gets maximum profit. (i)
Formulate the mathematical model; (ii) Solve this problem by graphical method.
2. Use Two-Phase method to solve the following L.P.P.
Maximize Z = 3x1 + 2x2+ 2x3
Subject to Constraints
5x1 + 7x2 + 4x3  7;
-4x1 + 7x2 + 5x3  -2;
3x1 + 4x2 -6x3  29/7.
x1 , x2, x3  0.
3. Solve the following transportation problem
To
From

3. 9 12 9 6 9 10 5
7 3 7 7 5 5 6
6 5 9 11 3 11 2
6 8 11 2 2 10 9
4 4 6 2 4 2 22
4. A solicitor’s firm employs typists on hourly piece-rate basis for their daily work. There
are five typists and their charges and speed are different. According to an earlier
understanding, only one job is given to one typist and the typist is paid for a full hour
even when he works for a fraction of an hour. Find the least cost allocation for the
following data:
Typist Number of
Rate/hour No. of
PageTypist/ho Job
(Rs.) Pages
ur
A 5 12 P 199
B 6 14 Q 175
C 3 8 R 145
D 4 10 S 298
E 4 11 T 178
5. Write down the basic difference between PERT and CPM.
6. Explain Erlang family of distributions of service times