Question

Find the optimum solution to the following transportation problem:

Image ignouacademy-com--p-2025-39801

18 Feb 2025
Answer :
Word Count : 702
To solve the transportation problem numerically, we need to use the Transportation Algorithm (also known as the Northwest Corner Rule, Least Cost Method, or Vogel's Approximation Method) to find the initial feasible solution, followed by the Stepping Stone Method or Modified Distribution (MODI) Method to optimize the solution. Since the problem is represented as an image, I cannot directly extract the data. However, I will outline the steps to solve the transportation problem numerically. You can apply these steps to the specific data from the image. --- ### Steps to Solve the Transportation Problem: #### 1. Formulate the Problem - Identify the supply (availability) at each source. - Identify the demand (requirement) at each destination. - Identify the cost matrix, which represents the cost of transporting one unit from a source to a destination. #### 2. Check for Balanced Problem - A transportation problem is balanced if the total supply equals the total demand: \[ \sum \text{Supply} = \sum \text{Demand} \] - If the problem is unbalanced, add a dummy source or destination to balance it. #### 3. Find an Initial Feasible Solution
_______ ___ __________ _______ ________ _______ _______ _____ _________.
_____ ______ _______ ____ _____.
_______ ______ _________ ______ _________ ____.
_________ ________ _______ _______ ___ _____.
__________ ____ _____ ____ _____ _____ _________ ___ _______.
_______ _________ _________ _______ __________ ________ ______ _____ _____ ___.
____ _______ _____ ______ __________ _________ _______.
______ __________ __________ _________ ______.
____ __________ _____ ____ _____.
__________ _________ ______ ______ _________ ____ ____ ________ ___ ________ ______.
__________ ___ ___ __________ ______ __________ ________.
_____ _________ ____ _____ _____ ____ ______ ______.
__________ ______ ____ _______ ___ ___ ________ ________ ____ _____.
_____ _______ ____ __________ ____ _____ _________ ____ _________ ________ ____.
______ _______ _____ _______ ________ _____ _____ _________ ___ _________.
___ ________ _______ _________ ____ ___ _________ ______ ____ ____.
___ _______ __________ ___ ___ ________ _______ __________ __________ _______.
________ _________ _______ ________ ______.
_____ __________ ____ ____ ______ _____ _____ _______.
________ _______ _______ ____ _____ __________ _________ ________.
________ ______ _______ ____ ____ _________ ______.
_____ _____ ____ ______ ____ __________ ______ __________ ________ _____ __________ ____.
______ ___ __________ ___ ___ _____ ________.
________ __________ ______ _______ _________ __________ _________ ____ ______ ___ _____.
_________ _________ ____ ________ _________ ____.
_________ _____ ________ _________ _____ _________ _____ __________ ________.
_______ __________ ____ ______ ___ ______ _______ _______ _________ __________ _____.
______ ____ _____ ________ _____ ________ ___ ___.
_______ ___ ___ __________ __________ ________ ___ ________.
__________ __________ _______ __________ _____ ____.
_____ _____ _________ _______ _________ ___ ____ _______ ___ ____ __________ _________.
__________ ________ _____ _______ ________.
_____ ______ ___ __________ _______ ___ _______ _______ ____.
__________ _______ ______ _____ ______ _________ __________ _____ ________ _______ ________ ______.
______ _______ _____ ___ ___ _____ ____ ____.
________ ____ ____ ________ _____ ______ __________ ________ _____ _____ _________.
_____ ____ __________ ________ _________ ________ _________ _______ ___.
_________ _________ _______ ___ ________ __________ ______.
_____ ______ ____ _______ ______ ______ ______.
_______ _________ __________ ______ ________ __________.
_________ __________ ____ ________ _________ ______ ______ ________ ______ ____ __________.
_______ ____ ___ _____ _____ _______ ____ _______ _________ ____ _____ ____.
_____ ______ ______ ___ ____ ______ _________ ______ ________.
_______ ___ ___ ______ ______ _____ ___.
__________ __________ _________ _________ _________.
__________ ___ ______ _______ __________ ___ ____ ________ ______ ________.
_____ _____ _________ _____ ______ ___.
_______ _______ _____ _________ _____ ___ ______ ____ __________.
________ _______ _____ _______ _________ _____ ________ ____ __________ ______.
_________ _______ _____ ________ _______ ___ _________ ________ _______.
_____ ___ ___ __________ ____ _______ ____ ____ ____ ______ ___ _______.
_______ _______ __________ _______ ___ _______ ____ ______ _____ ______ _____ _______.
________ ________ _____ __________ ________ _________ ______ ________ _____.
______ ____ _________ _________ ________.
_________ ______ ______ ________ ______ _______ _____ _______ __________.
____ _____ ___ ______ _______ _________ ___ ____ _____.
_____ __________ ________ ________ ________ ____ ___ ________ _______ __________.
__________ ________ _____ ___ _______ ____.
________ ______ ________ ______ __________ __________ ________.
_______ _______ ___ ___ __________ __________ _____ ___.
_______ _____ _________ _______ ________ ________ _______ ___ __________ __________ ____ ____.
___.
IGNOU ACADEMY
Your IGNOU journey, made easier.
  • Solved Assignments
  • Study Notes
  • Guess Papers
  • Question Papers
Skip in 10
Top
📞
Call Support Instant phone assistance IGNOU AOR 1 2025 - Find the optimum solution to the following transportation problem: | IGNOU Academy
→
🟢
WhatsApp Chat Fast live messaging
→
Email Us Business enquiries & support
→