# Use Branch and Bound technique to solve the following problem Maximise z = 3×1 + 3×2 + 13 x3 Subject 1 answer below »

Use Branch and Bound technique to solve the following problem
Maximise z = 3×1 + 3×2 + 13 x3
Subject to
– 3×1 + 6×2 + 7×3 = 8
6×1 – 3×2 + 7×3 = 8
0 = xj = 5
And xj are integer j = 1, 2, 3
Document Preview:

May 2012 Master of Business Administration – Semester 2 MB 0048: “Operations Research” (4 credits) (Book ID: B1301) ASSIGNMENT- Set 1 Marks 60 Note: Each Question carries 10 marks. Answer all the questions. 1. (a) What is linear programming problem? (b) A toy company manufactures two types of dolls, a basic version doll-A and a deluxe version doll-B. Each doll of type B takes twice as long to produce as one of type A, and the company would have time to make maximum of 1000 per day. The supply of plastic is sufficient to produce 1000 dolls per day (both A & B combined). The deluxe version requires a fancy dress for which there are only 500 per day available. If the company makes a profit of Rs 3.00 and Rs 5 per doll, respectively on doll A and B, then how many of each doll should be produced per day in order to maximise the total profit. Formulate this problem. 2. What are the advantages of Linear programming techniques? 3. Write a note on Monte-Carlo simulation. 4. Use Branch and Bound technique to solve the following problem Maximise z = 3×1 + 3×2 + 13 x3 Subject to – 3×1 + 6×2 + 7×3 = 8 6×1 – 3×2 + 7×3 = 8 0 = xj = 5 And xj are integer j = 1, 2, 3 5. Explain the different steps involved in simulation methodologies? 6. Write down the basic difference between PERT &CPM.May 2012 Master of Business Administration – Semester 2 MB0048: “Operations Research” (4 credits) (Book ID: B1301) ASSIGNMENT- Set 2 Marks 60 Note: Each Question carries 10 marks 1. Define Operations Research. Discuss different models available in OR. 2. Write dual of Max Z= 4X +5X 1 2 subject to 3X +X =15 1 2 X +2X =10 1 2 5X +2X =20 1 2 X , X =0 1 2 3. Solve the following Assignment Problem operations M1 M2 M3 M4 0 10 15 12 11 1 0 9 10 9 12 2 0 15 16 16 17 3 4. Explain PERT 5. Explain Maximini-minimax principle Write short notes on the following: 6. a. Linear Programming b. transportation problem

Attachments: