Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more ➡
Download
Standard view
Full view
of .
×
0 of .
Results for:
No results containing your search query
P. 1
MB0048 –Operations Research- 4 Credits

# MB0048 –Operations Research- 4 Credits

Ratings: (0)|Views: 8,311|Likes:
Published by MBA HELP
Dear students get fully solved assignments
call us at :- 08263069601
or
mail us at help.mbaassignments@gmail.com
Dear students get fully solved assignments
call us at :- 08263069601
or
mail us at help.mbaassignments@gmail.com

### More info:

Published by: MBA HELP on Feb 02, 2013
Copyright:Attribution Non-commercial

### Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, DOCX, TXT or read online from Scribd
See More
See less

08/01/2013

pdf

text

original

Dear students get fully solved assignmentscall us at :- 08263069601or

mail us at help.mbaassignments@gmail.com

Master of Business Administration- MBA Semester 1MB0048
–
Operations Research- 4 Credits(Book ID: B1631)Assignment Set - 1 (60 Marks)Note: Assignment Set -1 must be written within 6-8 pages. Answer all questions.Q1. a. What do you mean by linear programming problem? Explain the steps involved in linearprogramming problem formulation? 5 +5 = 10 marks (200 - 250 words each)
Answer : A problem consists of a linear function of variable called objective function subject to set of linear equation or inequalities called constraints, are known as linear programming problem.In LP model the various parameters namely the objective function coefficients, R.H.S, coefficients of the constraints and resource values are certainly known and their value do not change with time.Thus the profit or cost per unit of product, availability of labour and material, market demand isknown with certainty.
Linear Programming Problem Formulationb. A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, itcannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper in a week.There are 160 production hours in aweek. It requires 0.20 and 0.40 hours to produce a ton of grade X and Y papers.The mill earns a profit of Rs. 200 and Rs. 500 per ton of grade X and Y paperrespectively. Formulate this as a Linear Programming Problem.
Answer :
Q2. a. Discuss the methodology of Operations Research.5 +5 = 10 marks(200 - 250 words each)Answer : Essential characteristics
Three essential characteristics of operations research are a systems orientation, the use of interdisciplinary teams, and the application of scientific method to the conditions under which theresearch is conducted.

b. Explain in brief the phases of Operations Research.
Answer :
The phases of OR are
:1 Observe the problem environment2 Analyse and define the problem3 Develop a model4 Selection of data input5 solution and testing6 Implementation of the solution
In detailStep I. ObserveQ3. Solve the following Linear Programming Problem using Simple method. 10 marksMaximize Z= 3x1 + 2X2Subject to the constraints:
X1+ X2 ≤ 4

X1+ X2 ≤ 2

X1, X2 ≥ 0

Answer : Max
Q4. Explain the procedure of MODI method of finding solution through optimalitytest. 10 marks(300 - 350 words each)
Answer :
Transportation Algorithm for Minimization Problem (MODI Method)

Step 1
Make the transportation table entering the origin capacities ai, the cost cij and destinationrequirement bj
Q5. a. Explain the steps in Hungarian method.
Answer : The Hungarian algorithm allows a "minimum matching" to be found. This can be used ininstances where there are multiple quotes for a group of activities and each activity must be done bya different person, to find the minimum cost to complete all of the activities.

b. Solve the following assignment problem. 5 +5 = 10 marks(200 - 250 words each)OperatorsMachine 1 2 3 4A 60 50 45 45B 40 45 55 35C 55 70 60 50D 45 45 40 45
Answer :
Q6. a. Explain the steps involved in
Vogel’s approximation method (VAM) of
solving Transportation Problem. 5 +5 = 10marks(200 - 250words each)
Answer :
Vogel's Approximation Method (VAM)
This method is based on the 'difference' associated with each row and column in the matrix givingunitcost of transportation cij. This 'difference' is defined as the arithmetic difference between thesmallest and nextto the smallest element in that row or column. This difference in a row or columnindicates the minimum unitpenalty incurred in failing to make an allocation to the smallest cost cellin that row or column. Thisdifference also provides a measure of proper priorities for makingallocations to the respective rows and
b. Solve the following transportation problem using Vogel’s approximation method.
Factories Distribution Centres SupplyC1 C2 C3 C4

## Activity (14)

### Showing

AllMost RecentReviewsAll NotesLikes
You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
chinmayeedeepak liked this
Susil Tiwari added this note|
how can provide this assignment for me,,can u pls email me at this email id suselguru@gmail.com can u call me sushil 9427899803
Praveen Sharma liked this
tuniya4 liked this
Aryan Khan liked this
manoraman liked this
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->