Professional Documents
Culture Documents
J-3407[S-1263]
[2037]
MCA (Semester - 3rd)
COMPUTER BASED OPTIMIZATION METHODS (MCA - 305)
Instruction to Candidates:
1) Section - A is compulsory.
2) Attempt any Nine questions from Section - B.
Section - A
Section - B
(9 x 5 = 45)
Q2) State the different types of models used in operations research. Explain briefly
the general methods for solving these OR models.
Q3) Using simplex method solve the L.P. problem: Minimize Z = 4x1 + 8x2+ 3x3,
subject to: x1 + x2 > 2, 2x1 + x3 > 5, x1, x2, x3 > 0.
1 2 3 4 Supply
1 21 16 25 13 11
2 17 18 14 23 13
3 32 27 18 41 19
Demand 6 10 12 15 43
Q7) Determine the optimal transportation plan from the following table giving the
plant to market shipping costs, and qualities required at each market and
available at each plant:
Machines
M1 M2 M3 M4
J1 15 11 13 15
Jobs J2 17 12 12 13
J3 14 15 10 14
J4 16 13 11 17
Q9) Explain the nature of a travelling salesman problem and give its mathematical
formulation.
Q12) Use branch and bound method to solve the following integer L.P.P.:
Maximize Z = x1 + 2x2 subject to the constraints:
x1 + 2x2 < 12, 4x1 + 3x2 < 14; x1, x2 > 0, and are integers.
J-3407[S-1263] 3