IGNOU PGDIOM MMPO 1 SOLVED ASSIGNMENT

Included:

MMPO 1 2025 - English

ASSIGNMENT

Course Code

MMPO-001

Course Title

Assignment Code

Operations Research

MMPO-001/TMA/JULY/2024

Coverage

All Blocks

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

1. What is a linear programming problem? Discuss the scope and role of linear programming in solving management problems.

2. Discuss the various methods of finding the initial basic feasible solution of a transportation problem and state the advantages, disadvantages and two areas of application for them.

3. Write a short note on the following

a. Two-person zo-san game.

b. Goal Programming

c. Dynamic Programming

d. Kendall's Notation.

4. Discuss integer linear programming. Give an example of each of a pure and d integer linear programming problem.

5. "Game theory provides a systematic quantitative approach for analysing competitive situations in which the competitors make use of logical processes and techniques in order to determine an optimal strategy for winning. Comanent.

MMPO 001 (July 2025 - January 2026) - ENGLISH

ASSIGNMENT

Course Code

MMPO-001

Course Title

Operations Research

Assignment Code

MMPO-001/TMA/JULY/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 July 2025 Semester is 31 October 2025and for January 2026 Semester is 30 April, 2026.

1. Explain the concept and computational steps of the simplex method for solving linear programming problems. How would you identify whether an optimal solution to a problem obtained using the simplex algorithm is unique or not?

2. A manufacturer employs three inputs: man-hours, machine-hours and cloth material to manufacture two types of dresses. Type A dress fetches him a profit of Rs. 160/- per piece, while type B, that of Rs. 180/- per piece. The manufacturer has enough man-hours to manufacture 50 pieces of type A or 20 pieces of type B dresses per day, while the machine-hours he possesses suffice only for 36 pieces of type A or for 24 pieces of type B dresses. Formulate the linear programming model and solve it graphically.

3. What is integer linear programming (LP)? Explain the merits and demerits of 'rounding off a continuous optimal solution to an LP problem to obtain an integer solution.

4. Discuss the similarities in the solution procedures for transportation and assignment models.

5. Describe a single-server waiting model. Give an example from real life for each of the

following queuing models:

a) First-come-first-served

b) Last-come-first-served

c) Random pick service

d) Customers stay only if served instantly

MMPO 001 (July 2026 - January 2027) - ENGLISH

ASSIGNMENT
Course Code : MMPO-001
Course Title : Operations Research
Assignment Code : MMPO-001/TMA/JULY/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 July 2026 Semester is 31st October 2026
and for January 2027 Semester is 30th April 2027.
1. Define Operations Research. Explain its scope and discuss any three major limitations of
Operations Research in managerial decision-making.
2. A retired person wants to invest up to an amount of Rs 30,000 in fixed income securities.
His broker recommends investing in two bonds: Bond A yielding 7% and Bond B
yielding 10%. After some consideration, he decides to invest at most Rs 12,000 in Bond
B and at least Rs 6,000 in Bond A. He also wants the amount invested in Bond A to be at
least equal to the amount invested in Bond B. What should the broker recommend if the
investor wants to maximise his return on investment? Solve graphically.
3. Explain the importance of Integer Programming in business decisions. Give two real-life
examples where Integer Programming is more appropriate than Linear Programming.
4. Discuss the situations where Monte Carlo Simulation is preferred over mathematical
optimization techniques. Explain any two important steps in the Monte Carlo Simulation
process.
5. Solve the following assignment problem to find the optimal solution using the Hungarian
Assignment Method (HAM). Four workers are to be assigned to four different jobs (A, B,
C, D) so as to minimize the aggregate time taken (in minutes). Based on previous
experience, he has the information that the time taken by each worker for each job is
given in the table below:
Time Taken (in minutes) by 4 Workers
Worker Job
Job A Job B Job C Job D
1 45 40 51 67
2 57 42 63 55
3 49 52 48 64
4 41 45 60 55

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.