Help?
PLEASE MATCH YOUR ASSIGNMENT QUESTIONS ACCORDING TO YOUR SESSION
IGNOU MMPO-01 (July 2025 – January 2026) Assignment Questions
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
