MS-51: OPERATIONS RESEARCH

ASSIGNMENT

Course Code : MS – 51

Course Title : Operations Research

Assignment Code : MS-51/SEM - I /2011

Coverage : All Blocks

Note: Assignments Solved by www.distpub.com

Q1. Solve the following LP problem through SIMPLEX method

MINIMIZE Z = 2X₁ + 5X₂

Subject to

X₁ + X₂ = 100

X₁ ≤ 40

X₂ ³ 30

X₁ and X₂ ³ 0

Q2. Write the generalized form of linear programming problem with matrix rotation.

Q3. A manufacturer requires 15000 units of a part annually for assembly. Manufacturer can produce this at the rate of 100 per day. Set up cost for each production run is Rs.24/-. To hold one unit of this part in inventory will cost Rs.5/- per year. Determine the optimum manufacturing quantity and the optimum number of production run in any year.

Q4. a) Distinguish between pure and mixed strategy for a game.

b) Solve the game whose pay-off matrix is

1	7	2
6	2	7
5	1	6

Q5. Write short notes on the following

a) GOAL programming

b) Dynamic programming

c) Simulation