Scribd
Upload
68 views2 pages

AOR Assignment I

The document contains 5 questions related to operations research. Question 1 asks to formulate a linear programming problem to maximize total profit for a company producing two components given constraints on machine time, assembly time, and costs of production. Question 2 defines and explains key terms related to linear programming. Question 3 asks to use a graphical method to solve a given linear programming problem. Question 4 asks to solve a given linear programming problem using the simplex method and formulate its dual. Question 5 asks to optimally assign 5 jobs to 6 machines to minimize total cost given costs for each job-machine assignment.

Uploaded by

Paras Walia
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
68 views2 pages

AOR Assignment I

The document contains 5 questions related to operations research. Question 1 asks to formulate a linear programming problem to maximize total profit for a company producing two components given constraints on machine time, assembly time, and costs of production. Question 2 defines and explains key terms related to linear programming. Question 3 asks to use a graphical method to solve a given linear programming problem. Question 4 asks to solve a given linear programming problem using the simplex method and formulate its dual. Question 5 asks to optimally assign 5 jobs to 6 machines to minimize total cost given costs for each job-machine assignment.

Uploaded by

Paras Walia
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Applied Operations Research Assignment No.

1 Date of Submission: Aug 29, 2013 (Thursday) MBA-III (B), Batch 2012-14
Q1. An electric appliance company produces two components P1 and P2. Each unit of P1 costs the company Rs 13 in wages and Rs 14 in material while each unit of P2 costs the company Rs 16 in wages and Rs 15 in material. The selling price of P1 is Rs 28 per unit and of P2 is Rs 45 per unit. Production of each P1 requires 2 hours of machine time & 4 hours of assembly time whereas production of each P2 requires 3 hours of machine time and 5 hours of assembly time. Company has got only Rs 20,000 to meet the cost. Company wants to determine the number of units of P1 and P2 , to be manufactured , so as to maximize total profit to the company , given that a total of 2500 hours of machine time & 1500 hours of assembly time is available. Formulate LP problem. Q2. Explain the following terms: a. Basic Variables & Non- Basic Variables b. Initial Feasible Solution c. Unbounded Solution d. Optimal Solution e. Multiple Optimal Solution f. Infeasible Solution g. Iso-Profit Line h. Key Element i. Index Row i. Duality Q3. Use graphical method to solve: Max. Z= 20 X1 + 10 X2 s.t. X1 + 2X2 40 3X1 + X2 30 4X1 + 3 X2 60 X1, X2 0 Q4. Solve by Simplex: Min. Z= 5 X1 + 3 X2 s.t. 2X1 + 4X2 12 2X1 + 2X2 = 10 5X1 + 2X2 10 X1, X2 0

Also formulate Dual of the above LPP. Q5. Five jobs A,B, C, D & E are to be assigned to six machines 1,2,3,4,5 & 6. The cost in Rs. of assigning a job to a machine is given below. Fine the most optimum assignment of jobs to machines 1 12 10 11 6 8 2 10 18 10 14 12 3 15 25 3 10 11 4 22 15 8 13 7 5 18 16 5 13 13 6 8 12 9 12 10

A B C D E

You might also like