IGNOU MS 51 SOLVED ASSIGNMENT

MS 51 Solved Assignment
High Demand Verified Solution
★★★★★ 4.9/5 (149 Students)

₹80

₹30

MS 51: Operations Research

Title Name IGNOU MS 51 SOLVED ASSIGNMENT
Type Soft Copy (E-Assignment) .pdf
University IGNOU
Degree MASTER DEGREE PROGRAMMES
Course Code MBA
Course Name Master in Business Administration
Subject Code MS 51
Subject Name Operations Research
Year 2026
Session -
Language English Medium
Assignment Code MS 51/Assignment-1/2026
Product Description Assignment of MBA (Master in Business Administration) 2026. Latest MS 51 2026 Solved Assignment Solutions
Last Date of IGNOU Assignment Submission Last Date of Submission of IGNOU BEGC-131 (BAG) 2025-26 Assignment is for January 2026 Session: 30th September, 2026 (for December 2025 Term End Exam).

Semester Wise
January 2025 Session: 30th March, 2026 (for June 2026 Term End Exam).
July 2025 Session: 30th September, 2025 (for December 2025 Term End Exam).
FormatReady-to-Print PDF (.soft copy)

📅 Important Submission Dates

  • January 2025 Session: 31st October, 2025
  • July 2025 Session: 30th April, 2025
  • January 2025 Session: 31st October, 2025
  • July 2025 Session: 30th April, 2025
  • January 2026 Session: 30th April, 2026
  • July 2026 Session: 31st October, 2026

Why Choose Our Solved Assignments?

Accuracy: Solved by IGNOU subject experts.
Guidelines: Strictly follows 2025-26 official word limits.
Scoring: Designed to help students achieve 90+ marks.
📋 Assignment Content Preview
Included:

MS 51 (January 2025 - July 2025) - ENGLISH

ASSIGNMENT

Course Code:MS-51

Course Title:Operations Research

Assignment Code:MS-51/TMA/JAN/2025

Coverage:All Blocks

Note: Attempt all the questions and submit this assignment to the Coordinator of your study centre. Last date of submission for January 2025 session is 30th April, 2025 and for July 2025 session is 31 October, 2025.

1. A company manufactures two products, X and Y, using machines A, B, and C. Machine A has 4 hours of capacity available during the coming week. Similarly, the available capacity of machines B and C during the coming week is 24 hours and 35 hours, respectively. One unit of product X requires one hour of Machine A, 3 hours of machine B and 10 hours of Machine C. Similarly, one unit of product Y requires 1 hour, 8 hours and 7 hours of machine A, B and C, respectively. When one unit of X is sold in the market, it yields a profit of Rs. 5/- per product, and that of Y is Rs. 7/- per unit. Formulate a linear programming model and solve this problem using the graphical method to find the optimal product mix.

2. 'Linear programming is one of the most frequently and successfully employed Operations Research techniques to managerial and business decisions. Elucidate this statement with some examples.

3. Explain, by taking an illustration, the North-West Corner rule, the Least Cost Method and the Vogel's Approximation Method to obtain the initial feasible solution to a transportation problem.

4. What is a stage in dynamic programming? Explain the steps involved in solutions to dynamic programming problems.

5. Discuss the assumptions underlying the basic EOQ formula. Also, state the economic order quantity model, discuss its sensitivity, and explain its significant extensions.


MS 51 (January 2025 - July 2025) - ENGLISH

ASSIGNMENT

Course Code:MS-51

Course Title:Operations Research

Assignment Code:MS-51/TMA/JAN/2025

Coverage:All Blocks

Note: Attempt all the questions and submit this assignment to the Coordinator of your study centre. Last date of submission for January 2025 session is 30th April, 2025 and for July 2025 session is 31 October, 2025.

1. A company manufactures two products, X and Y, using machines A, B, and C. Machine A has 4 hours of capacity available during the coming week. Similarly, the available capacity of machines B and C during the coming week is 24 hours and 35 hours, respectively. One unit of product X requires one hour of Machine A, 3 hours of machine B and 10 hours of Machine C. Similarly, one unit of product Y requires 1 hour, 8 hours and 7 hours of machine A, B and C, respectively. When one unit of X is sold in the market, it yields a profit of Rs. 5/- per product, and that of Y is Rs. 7/- per unit. Formulate a linear programming model and solve this problem using the graphical method to find the optimal product mix.

2. 'Linear programming is one of the most frequently and successfully employed Operations Research techniques to managerial and business decisions". Elucidate this statement with some examples.

3. Explain, by taking an illustration, the North-West Corner rule, the Least Cost Method and the Vogel's Approximation Method to obtain the initial feasible solution to a transportation problem.

4. What is a stage in dynamic programming? Explain the steps involved in solutions to dynamic programming problems.

5. Discuss the assumptions underlying the basic EOQ formula. Also, state the economic order quantity model, discuss its sensitivity, and explain its significant extensions.


MS 51 (January 2026 - July 2026) - ENGLISH

ASSIGNMENT

Course Code : MS - 51

Course Title : Operations Research

Assignment Code : MS - 51/TMA/JAN/2026

Coverage : All Blocks

Note: Attempt all the questions and submit this assignment to the Coordinator of your study centre. Last date of submission for January 2026 session is 30th April, 2026 and for July 2026 session is 31st October, 2026.


1. Define Operations Research and explain its scope. Discuss the limitations of Operations Research and enumerate the major techniques used in OR for managerial decision-making.

2. What constitutes inventory ordering costs, carrying costs and stock out costs? Explain the behaviour and relationship of these costs.

3. An agriculturist has a 125-acre farm. He produces radish, muttar (Peas) and potato. Whatever he raises is fully sold in the market. He gets Rs. 5 for radish per kg, Rs 4 for muttar (Peas) and Rs 5 for potato per kg. The average per acre yield is 1500 kg of radish, 1800 kg of muttar (Peas) and 1200 kg of potato. To produce each 100 kg of radish and muttar (Peas) and 80 kg of potato, a sum of Rs 12.50 has to be used for manure. Labour required for each acre to raise the crop is 6 man-days for radish and potato each and 5 man-days for muttar (Peas). A total of 500 man-days for labour at a rate of Rs 40 per man-day are available. Formulate this as a linear programming model to maximize the agriculturist's total profit.

4. “When it becomes difficult to use an optimization technique for solving a problem, one has to resort to simulation technique.” Discuss.

5. Using the following cost matrix, determine (a) optimal job assignment and (b) the cost of assignments

Job/ Machines 1 2 3 4 5
A 10 3 3 2 8
B 9 7 8 2 7
C 7 5 6 2 4
D 3 5 8 2 4
E 9 10 9 6 10

❓ Frequently Asked Questions (FAQs)
Q: How will I receive the PDF?
A: Immediately after payment, the download link will appear and be sent to your email.

Q: Is this hand-written or typed?
A: This is a professional typed computer PDF. You can use it as a reference for your handwritten submission.

Get the full solved PDF for just Rs. 15

Top